Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Karczmarz, Adam
48  Ergebnisse:
Personensuche X
?
1

Deterministic Fully Dynamic SSSP and More:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Van Den Brand, Jan ; Karczmarz, Adam - p. 2312-2321 , 2023
Link: https://doi.org/10.1109/..
 
?
2

Sensitivity and Dynamic Distance Oracles via Generic Matric..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Karczmarz, Adam ; Sankowski, Piotr - p. 1745-1756 , 2023
Link: https://doi.org/10.1109/..
 
?
3

Subquadratic dynamic path reporting in directed graphs agai..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Karczmarz, Adam ; Mukherjee, Anish ; Sankowski, Piotr - p. 1643-1656 , 2022
Link: https://dl.acm.org/doi/1..
 
?
4

Single-source shortest paths and strong connectivity in dyn..:

Charalampopoulos, Panagiotis ; Karczmarz, Adam
Journal of Computer and System Sciences.  124 (2022)  - p. 97-111 , 2022
Link: https://doi.org/10.1016/..
 
?
5

Planar Reachability Under Single Vertex or Edge Failures:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Italiano, Giuseppe F. ; Karczmarz, Adam ; Parotsidis, Nikos - p. 2739-2758 , 2021
Link: https://doi.org/10.1137/..
 
?
6

A deterministic parallel APSP algorithm and its application:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Karczmarz, Adam ; Sankowski, Piotr - p. 255-272 , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

Planar reachability under single vertex or edge failures:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Italiano, Giuseppe F. ; Karczmarz, Adam ; Parotsidis, Nikos - p. 2739-2758 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

A Deterministic Parallel APSP Algorithm and its Application:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Karczmarz, Adam ; Sankowski, Piotr - p. 255-272 , 2021
Link: https://doi.org/10.1137/..
 
?
9

Optimal Dynamic Strings:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Gawrychowski, Paweł ; Karczmarz, Adam ; Kociumaka, Tomasz.. - p. 1509-1528 , 2018
Link: https://doi.org/10.1137/..
 
?
10

Decrementai Transitive Closure and Shortest Paths for Plana..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Karczmarz, Adam - p. 73-92 , 2018
Link: https://doi.org/10.1137/..
 
?
11

Decremental transitive closure and shortest paths for plana..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Karczmarz, Adam - p. 73-92 , 2018
Link: https://dl.acm.org/doi/1..
 
?
12

Optimal dynamic strings:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Gawrychowski, Paweł ; Karczmarz, Adam ; Kociumaka, Tomasz.. - p. 1509-1528 , 2018
Link: https://dl.acm.org/doi/1..
 
?
13

Decremental single-source reachability in planar digraphs:

, In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing,
Italiano, Giuseppe F. ; Karczmarz, Adam ; Łącki, Jakub. - p. 1108-1121 , 2017
Link: https://dl.acm.org/doi/1..
 
?
14

Max $s,t$-Flow Oracles and Negative Cycle Detection in Plan..:

Karczmarz, Adam
http://arxiv.org/abs/2311.01094.  , 2023
Link: http://arxiv.org/abs/231..
 
?
15

Exact Shortest Paths with Rational Weights on the Word RAM:

Karczmarz, Adam ; Nadara, Wojciech ; Sokołowski, Marek
http://arxiv.org/abs/2311.03321.  , 2023
Link: http://arxiv.org/abs/231..
 
1-15