Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Bernstein, Aaron
394  Ergebnisse:
OpenAccess-Volltexte X
Personensuche X
?
1

Are There Graphs Whose Shortest Path Structure Requires Lar..:

Bernstein, Aaron ; Bodwin, Greg ; Wein, Nicole
Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024).  , 2024
Link: https://doi.org/10.4230/..
 
?
2

Dynamic Graph Algorithms (Dagstuhl Seminar 22461):

Bernstein, Aaron ; Chechik, Shiri ; Forster, Sebastian...
doi:10.4230/DagRep.12.11.45.  , 2023
Link: https://doi.org/10.4230/..
 
?
3

Warm-season temperatures and emergency department visits am..:

Stowell, Jennifer D ; Sun, Yuantong ; Spangler, Keith R...
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9623446/.  , 2023
Link: http://www.ncbi.nlm.nih...
 
?
4

Are there graphs whose shortest path structure requires lar..:

Bernstein, Aaron ; Bodwin, Greg ; Wein, Nicole
http://arxiv.org/abs/2308.13054.  , 2023
Link: http://arxiv.org/abs/230..
 
?
5

All-Norm Load Balancing in Graph Streams via the Multiplica..:

Assadi, Sepehr ; Bernstein, Aaron ; Langley, Zachary
http://arxiv.org/abs/2301.07007.  , 2023
Link: http://arxiv.org/abs/230..
 
?
6

All-Norm Load Balancing in Graph Streams via the Multiplica..:

Assadi, Sepehr ; Bernstein, Aaron ; Langley, Zachary
doi:10.4230/LIPIcs.ITCS.2023.7.  , 2023
Link: https://doi.org/10.4230/..
 
?
7

Parallel and Distributed Exact Single-Source Shortest Paths..:

Ashvinkumar, Vikrant ; Bernstein, Aaron ; Cao, Nairen...
http://arxiv.org/abs/2303.00811.  , 2023
Link: http://arxiv.org/abs/230..
 
?
8

Negative-Weight Single-Source Shortest Paths in Near-linear..:

Bernstein, Aaron ; Nanongkai, Danupon ; Wulff-Nilsen, Christian
http://arxiv.org/abs/2203.03456.  , 2022
Link: http://arxiv.org/abs/220..
 
?
9

Decremental Matching in General Graphs:

Assadi, Sepehr ; Bernstein, Aaron ; Dudeja, Aditi
doi:10.4230/LIPIcs.ICALP.2022.11.  , 2022
Link: https://doi.org/10.4230/..
 
?
10

Closing the Gap Between Directed Hopsets and Shortcut Sets:

Bernstein, Aaron ; Wein, Nicole
http://arxiv.org/abs/2207.04507.  , 2022
Link: http://arxiv.org/abs/220..
 
?
11

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversa..:

Bernstein, Aaron ; van den Brand, Jan ; Probst Gutenberg, Maximilian...
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.ICALP.2022.20.  , 2022
Link: https://hdl.handle.net/2..
 
?
12

Substitution mutational signatures in whole-genome-sequence..:

Degasperi, Andrea ; Zou, Xueqing ; Amarante, Tauanne Dias...
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7613262/.  , 2022
Link: http://www.ncbi.nlm.nih...
 
?
13

Substitution mutational signatures in whole-genome-sequence..:

Degasperi, Andrea ; Zou, Xueqing ; Dias Amarante, Tauanne...
doi:10.5281/zenodo.5570306.  , 2022
Link: https://zenodo.org/recor..
 
?
14

Substitution mutational signatures in whole-genome-sequence..:

Degasperi, Andrea ; Zou, Xueqing ; Dias Amarante, Tauanne...
doi:10.5281/zenodo.5571550.  , 2022
Link: https://zenodo.org/recor..
 
?
15

Decremental Matching in General Graphs:

Assadi, Sepehr ; Bernstein, Aaron ; Dudeja, Aditi
http://arxiv.org/abs/2207.00927.  , 2022
Link: http://arxiv.org/abs/220..
 
1-15