Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Łącki, Jakub
14  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Adaptive Massively Parallel Connectivity in Optimal Space:

, In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,
Latypov, Rustam ; Łącki, Jakub ; Maus, Yannic. - p. 431-441 , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

Clustering for Private Interest-based Advertising:

, In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining,
Epasto, Alessandro ; Muñoz Medina, Andrés ; Avery, Steven... - p. 2802-2810 , 2021
Link: https://dl.acm.org/doi/1..
 
?
3

Fully dynamic matching : beating 2-approximation in Δϵ u..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Behnezhad, Soheil ; Łącki, Jakub ; Mirrokni, Vahab - p. 2492-2508 , 2020
Link: https://dl.acm.org/doi/1..
 
?
4

Walking randomly, massively, and efficiently:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Łącki, Jakub ; Mitrović, Slobodan ; Onak, Krzysztof. - p. 364-377 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

Near-Optimal Massively Parallel Graph Connectivity:

, In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS),
Behnezhad, Soheil ; Dhulipala, Laxman ; Esfandiari, Hossein.. - p. 1615-1636 , 2019
Link: https://doi.org/10.1109/..
 
?
6

Massively Parallel Computation via Remote Memory Access:

, In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures,
Behnezhad, Soheil ; Dhulipala, Laxman ; Esfandiari, Hossein... - p. 59-68 , 2019
Link: https://dl.acm.org/doi/1..
 
?
7

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/..
 
?
8

Round compression for parallel matching algorithms:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
Czumaj, Artur ; Łącki, Jakub ; Mądry, Aleksander... - p. 471-484 , 2018
Link: https://dl.acm.org/doi/1..
 
?
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://dl.acm.org/doi/1..
 
?
10

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..
 
?
11

Algorithmic complexity of power law networks:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,
Brach, Paweł ; Cygan, Marek ; Łącki, Jakub. - p. 1306-1325 , 2016
Link: https://dl.acm.org/doi/1..
 
?
12

The Power of Dynamic Distance Oracles : Efficient Dynami..:

, In: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing,
Łącki, Jakub ; Oćwieja, Jakub ; Pilipczuk, Marcin.. - p. 11-20 , 2015
Link: https://dl.acm.org/doi/1..
 
?
13

Reachability in graph timelines:

, In: Proceedings of the 4th conference on Innovations in Theoretical Computer Science,
Lacki, Jakub ; Sankowski, Piotr - p. 257-268 , 2013
Link: https://dl.acm.org/doi/1..
 
?
14

Improved deterministic algorithms for decremental transitiv..:

, In: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms,
Łącki, Jakub - p. 1438-1445 , 2011
Link: https://dl.acm.org/doi/1..
 
1-14