default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrzysztof Onak
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c35]Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Dynamic PageRank: Algorithms and Lower Bounds. ICALP 2024: 90:1-90:19- [i24]Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Dynamic PageRank: Algorithms and Lower Bounds. CoRR abs/2404.16267 (2024) - 2022
- [c34]Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. SOSA 2022: 214-227 - 2021
- [c33]Krzysztof Nowicki, Krzysztof Onak:
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. SODA 2021: 2939-2958 - [i23]Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. CoRR abs/2109.03785 (2021) - 2020
- [j7]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak
, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. SIAM J. Comput. 49(5) (2020) - [j6]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms 16(2): 26:1-26:19 (2020) - [c32]Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Walking randomly, massively, and efficiently. STOC 2020: 364-377 - [i22]Krzysztof Nowicki, Krzysztof Onak:
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. CoRR abs/2002.07800 (2020)
2010 – 2019
- 2019
- [j5]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar graphs: Random walks and bipartiteness testing. Random Struct. Algorithms 55(1): 104-124 (2019) - [c31]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. ICML 2019: 405-413 - [c30]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. SODA 2019: 1919-1936 - [i21]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. CoRR abs/1902.03519 (2019) - [i20]Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Walking Randomly, Massively, and Efficiently. CoRR abs/1907.05391 (2019) - 2018
- [j4]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. ACM Trans. Algorithms 14(4): 48:1-48:23 (2018) - [c29]Krzysztof Onak, Xiaorui Sun:
Probability-Revealing Samples. AISTATS 2018: 2018-2026 - [c28]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP 2018: 92:1-92:14 - [c27]Krzysztof Onak, Xiaorui Sun:
The query complexity of graph isomorphism: bypassing distribution testing lower bounds. STOC 2018: 165-171 - [c26]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round compression for parallel matching algorithms. STOC 2018: 471-484 - [c25]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully dynamic maximal independent set with sublinear update time. STOC 2018: 815-826 - [i19]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear Update Time. CoRR abs/1802.09709 (2018) - [i18]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. CoRR abs/1806.10051 (2018) - [i17]Krzysztof Onak:
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space. CoRR abs/1807.08745 (2018) - [i16]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. CoRR abs/1808.10316 (2018) - 2017
- [c24]Ilias Diakonikolas, Elena Grigorescu, Jerry Li, Abhiram Natarajan, Krzysztof Onak, Ludwig Schmidt:
Communication-Efficient Distributed Learning of Discrete Distributions. NIPS 2017: 6391-6401 - [i15]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. CoRR abs/1707.03478 (2017) - 2016
- [j3]Venkatesan Guruswami, Krzysztof Onak:
Superlinear Lower Bounds for Multipass Graph Processing. Algorithmica 76(3): 654-683 (2016) - [c23]Arturs Backurs, Krzysztof Onak:
Fast Algorithms for Parsing Sequences of Parentheses with Few Errors. PODS 2016: 477-488 - 2015
- [c22]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. SODA 2015: 1217-1233 - 2014
- [c21]Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev:
Parallel algorithms for geometric graph problems. STOC 2014: 574-583 - [i14]Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev:
Parallel Algorithms for Geometric Graph Problems. CoRR abs/1401.0042 (2014) - [i13]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar Graphs: Random Walks and Bipartiteness Testing. CoRR abs/1407.2109 (2014) - 2013
- [j2]Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos:
Fat Polygonal Partitions with Applications to Visualization and Embeddings. J. Comput. Geom. 4(1): 212-239 (2013) - [c20]Venkatesan Guruswami, Krzysztof Onak:
Superlinear Lower Bounds for Multipass Graph Processing. CCC 2013: 287-298 - [i12]Venkatesan Guruswami, Krzysztof Onak:
Superlinear lower bounds for multipass graph processing. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j1]Alexandr Andoni, Krzysztof Onak:
Approximating Edit Distance in Near-Linear Time. SIAM J. Comput. 41(6): 1635-1648 (2012) - [c19]Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld:
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. SODA 2012: 1123-1131 - [i11]Venkatesan Guruswami, Krzysztof Onak:
Superlinear lower bounds for multipass graph processing. CoRR abs/1212.6925 (2012) - 2011
- [c18]Alan Edelman, Avinatan Hassidim, Huy N. Nguyen, Krzysztof Onak:
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs. APPROX-RANDOM 2011: 530-541 - [c17]Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak:
Streaming Algorithms via Precision Sampling. FOCS 2011: 363-372 - [c16]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar Graphs: Random Walks and Bipartiteness Testing. FOCS 2011: 423-432 - [i10]Alan Edelman, Avinatan Hassidim, Huy N. Nguyen, Krzysztof Onak:
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs. CoRR abs/1106.4587 (2011) - [i9]Alexandr Andoni, Krzysztof Onak:
Approximating Edit Distance in Near-Linear Time. CoRR abs/1109.5635 (2011) - [i8]Krzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld:
A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size. CoRR abs/1110.1079 (2011) - 2010
- [b1]Krzysztof Onak:
New sublinear methods in the struggle against classical problems. Massachusetts Institute of Technology, Cambridge, MA, USA, 2010 - [c15]Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak:
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. FOCS 2010: 377-386 - [c14]Krzysztof Onak, Ronitt Rubinfeld:
Maintaining a large matching and a small vertex cover. STOC 2010: 457-464 - [p4]Krzysztof Onak:
Sublinear Graph Approximation Algorithms. Property Testing 2010: 158-166 - [p3]Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld:
Sublinear Algorithms in the External Memory Model. Property Testing 2010: 240-243 - [p2]Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak:
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. Property Testing 2010: 244-252 - [p1]Krzysztof Onak, Ronitt Rubinfeld:
Dynamic Approximate Vertex Cover and Maximum Matching. Property Testing 2010: 341-345 - [i7]Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak:
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. CoRR abs/1005.4033 (2010) - [i6]Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos:
Fat Polygonal Partitions with Applications to Visualization and Embeddings. CoRR abs/1009.1866 (2010) - [i5]Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak:
Streaming Algorithms from Precision Sampling. CoRR abs/1011.1263 (2010)
2000 – 2009
- 2009
- [c13]Andrew McGregor, Krzysztof Onak, Rina Panigrahy:
The Oil Searching Problem. ESA 2009: 504-515 - [c12]Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak:
Local Graph Partitions for Approximation and Testing. FOCS 2009: 22-31 - [c11]Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld:
External Sampling. ICALP (1) 2009: 83-94 - [c10]Alexandr Andoni, Krzysztof Onak:
Approximating edit distance in near-linear time. STOC 2009: 199-204 - [i4]Krzysztof Onak:
Testing Distribution Identity Efficiently. CoRR abs/0910.3243 (2009) - 2008
- [c9]Krzysztof Onak, Anastasios Sidiropoulos:
Circular partitions with applications to visualization and embeddings. SCG 2008: 28-37 - [c8]Huy N. Nguyen, Krzysztof Onak:
Constant-Time Approximation Algorithms via Local Improvements. FOCS 2008: 327-336 - [c7]Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory. FOCS 2008: 489-498 - [c6]Krzysztof Onak:
Testing Properties of Sets of Points in Metric Spaces. ICALP (1) 2008: 515-526 - [c5]Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Streaming algorithms for estimating entropy. ITW 2008: 227-231 - [c4]Shay Mozes, Krzysztof Onak, Oren Weimann:
Finding an optimal tree searching strategy in linear time. SODA 2008: 1096-1105 - [i3]Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory. CoRR abs/0804.4138 (2008) - [i2]Alexandr Andoni, Andrew McGregor, Krzysztof Onak, Rina Panigrahy:
Better Bounds for Frequency Moments in Random-Order Streams. CoRR abs/0808.2222 (2008) - 2007
- [c3]Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan:
Testing for Concise Representations. FOCS 2007: 549-558 - [c2]David R. Karger, Krzysztof Onak:
Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems. SODA 2007: 1207-1216 - [i1]Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan:
Testing for Concise Representations. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c1]Krzysztof Onak, Pawel Parys:
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders. FOCS 2006: 379-388
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
