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

Dynamic graph algorithms with batch updates in the massivel..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Nowicki, Krzysztof ; Onak, Krzysztof - p. 2939-2957 , 2021
Link: https://dl.acm.org/doi/1..
 
?
2

Dynamic Graph Algorithms with Batch Updates in the Massivel..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Nowicki, Krzysztof ; Onak, Krzysztof - p. 2939-2958 , 2021
Link: https://doi.org/10.1137/..
 
?
3

Fully Dynamic MIS in Uniformly Sparse Graphs:

Onak, Krzysztof ; Schieber, Baruch ; Solomon, Shay.
ACM Transactions on Algorithms.  16 (2020)  2 - p. 1-19 , 2020
Link: https://doi.org/10.1145/..
 
?
4

Fully Dynamic MIS in Uniformly Sparse Graphs:

Onak, Krzysztof ; Schieber, Baruch ; Solomon, Shay.
ACM Transactions on Algorithms (TALG).  16 (2020)  2 - p. 1-19 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

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

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

Fully dynamic maximal independent set with sublinear in n u..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Assadi, Sepehr ; Onak, Krzysztof ; Schieber, Baruch. - p. 1919-1936 , 2019
Link: https://dl.acm.org/doi/1..
 
?
8

Planar graphs: Random walks and bipartiteness testing:

Czumaj, Artur ; Monemizadeh, Morteza ; Onak, Krzysztof.
Random Structures & Algorithms.  55 (2019)  1 - p. 104-124 , 2019
Link: https://doi.org/10.1002/..
 
?
9

Streaming Algorithms for Estimating the Matching Size in Pl..:

Esfandiari, Hossein ; Hajiaghayi, Mohammadtaghi ; Liaghat, Vahid..
ACM Transactions on Algorithms (TALG).  14 (2018)  4 - p. 1-23 , 2018
Link: https://dl.acm.org/doi/1..
 
?
10

Streaming Algorithms for Estimating the Matching Size in Pl..:

Esfandiari, Hossein ; Hajiaghayi, Mohammadtaghi ; Liaghat, Vahid..
ACM Transactions on Algorithms.  14 (2018)  4 - p. 1-23 , 2018
Link: https://doi.org/10.1145/..
 
?
11

The query complexity of graph isomorphism: bypassing distri..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
Onak, Krzysztof ; Sun, Xiaorui - p. 165-171 , 2018
Link: https://dl.acm.org/doi/1..
 
?
12

Fully dynamic maximal independent set with sublinear update..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
Assadi, Sepehr ; Onak, Krzysztof ; Schieber, Baruch. - p. 815-826 , 2018
Link: https://dl.acm.org/doi/1..
 
?
13

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

Fast Algorithms for Parsing Sequences of Parentheses with F..:

, In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Backurs, Arturs ; Onak, Krzysztof - p. 477-488 , 2016
Link: https://dl.acm.org/doi/1..
 
?
15

Superlinear Lower Bounds for Multipass Graph Processing:

Guruswami, Venkatesan ; Onak, Krzysztof
Algorithmica.  76 (2016)  3 - p. 654-683 , 2016
Link: https://doi.org/10.1007/..
 
1-15