Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Bernstein, Aaron
39  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Deterministic Decremental SSSP and Approximate Min-Cost Flo..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Bernstein, Aaron ; Gutenberg, Maximilian Probst ; Saranurak, Thatchaphol - p. 1000-1008 , 2022
Link: https://doi.org/10.1109/..
 
?
2

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

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Bernstein, Aaron ; Nanongkai, Danupon ; Wulff-Nilsen, Christian - p. 600-611 , 2022
Link: https://doi.org/10.1109/..
 
?
3

A framework for dynamic matching in weighted graphs:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Bernstein, Aaron ; Dudeja, Aditi ; Langley, Zachary - p. 668-681 , 2021
Link: https://dl.acm.org/doi/1..
 
?
4

Near-Optimal Decremental SSSP in Dense Weighted Digraphs:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Bernstein, Aaron ; Gutenberg, Maximilian Probst ; Wulff-Nilsen, Christian - p. 1112-1122 , 2020
Link: https://doi.org/10.1109/..
 
?
5

Deterministic Decremental Reachability, SCC, and Shortest P..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Bernstein, Aaron ; Gutenberg, Maximilian Probst ; Saranurak, Thatchaphol - p. 1123-1134 , 2020
Link: https://doi.org/10.1109/..
 
?
6

Decremental strongly-connected components and single-source..:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
Bernstein, Aaron ; Probst, Maximilian ; Wulff-Nilsen, Christian - p. 365-376 , 2019
Link: https://dl.acm.org/doi/1..
 
?
7

Distributed exact weighted all-pairs shortest paths in near..:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
Bernstein, Aaron ; Nanongkai, Danupon - p. 334-342 , 2019
Link: https://dl.acm.org/doi/1..
 
?
8

Coresets Meet EDCS : algorithms for matching and vertex ..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Assadi, Sepehr ; Bateni, Mohammad Hossein ; Bernstein, Aaron.. - p. 1616-1635 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

A deamortization approach for dynamic spanner and dynamic m..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bernstein, Aaron ; Forster, Sebastian ; Henzinger, Monika - p. 1899-1918 , 2019
Link: https://dl.acm.org/doi/1..
 
?
10

Online bipartite matching with amortized O(log2 n) replacem..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bernstein, Aaron ; Holm, Jacob ; Rotenberg, Eva - p. 947-959 , 2018
Link: https://dl.acm.org/doi/1..
 
?
11

Incremental Topological Sort and Cycle Detection inExpected..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bernstein, Aaron ; Chechi, Shiri - p. 21-34 , 2018
Link: https://doi.org/10.1137/..
 
?
12

Online Bipartite Matching with AmortizedReplacements:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bernstein, Aaron ; Holm, Jacob ; Rotenberg, Eva - p. 947-959 , 2018
Link: https://doi.org/10.1137/..
 
?
13

Incremental topological sort and cycle detection in [Equati..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bernstein, Aaron ; Chechik, Shiri - p. 21-34 , 2018
Link: https://dl.acm.org/doi/1..
 
?
14

Biodiversity, Health Implications of:

, In: International Encyclopedia of Public Health,
Bernstein, Aaron - p. 219-222 , 2017
Link: https://doi.org/10.1016/..
 
?
15

Deterministic partially dynamic single source shortest path..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bernstein, Aaron ; Chechik, Shiri - p. 453-469 , 2017
Link: https://dl.acm.org/doi/1..
 
1-15