Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Łącki, Jakub
123  Ergebnisse:
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

Scalable community detection via parallel correlation clust..:

Shi, Jessica ; Dhulipala, Laxman ; Eisenstat, David..
Proceedings of the VLDB Endowment.  14 (2021)  11 - p. 2305-2313 , 2021
Link: https://doi.org/10.14778..
 
?
3

Massively Parallel Computation via Remote Memory Access:

Behnezhad, Soheil ; Dhulipala, Laxman ; Esfandiari, Hossein...
ACM Transactions on Parallel Computing.  8 (2021)  3 - p. 1-25 , 2021
Link: https://doi.org/10.1145/..
 
?
4

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

Massively Parallel Computation via Remote Memory Access:

Behnezhad, Soheil ; Dhulipala, Laxman ; Esfandiari, Hossein...
ACM Transactions on Parallel Computing.  8 (2021)  3 - p. 1-25 , 2021
Link: https://dl.acm.org/doi/1..
 
?
6

Parallel graph algorithms in constant adaptive rounds: theo..:

Behnezhad, Soheil ; Dhulipala, Laxman ; Esfandiari, Hossein...
Proceedings of the VLDB Endowment.  13 (2020)  13 - p. 3588-3602 , 2020
Link: https://doi.org/10.14778..
 
?
7

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

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

Parallel graph algorithms in constant adaptive rounds : ..:

Behnezhad, Soheil ; Dhulipala, Laxman ; Esfandiari, Hossein...
Proceedings of the VLDB Endowment.  13 (2020)  13 - p. 3588-3602 , 2020
Link: https://dl.acm.org/doi/1..
 
?
10

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

Round Compression for Parallel Matching Algorithms:

Czumaj, Artur ; Ła̧cki, Jakub ; Ma̧dry, Aleksander...
SIAM Journal on Computing.  49 (2019)  5 - p. STOC18-1-STOC18-44 , 2019
Link: https://doi.org/10.1137/..
 
?
12

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

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

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

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..
 
1-15