Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 69 matches
- 2022
- Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. SOSA 2022: 214-227 - 2021
- Krzysztof Nowicki, Krzysztof Onak:
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. SODA 2021: 2939-2958 - Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. CoRR abs/2109.03785 (2021) - 2020
- Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. SIAM J. Comput. 49(5) (2020) - 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) - Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Walking randomly, massively, and efficiently. STOC 2020: 364-377 - Krzysztof Nowicki, Krzysztof Onak:
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. CoRR abs/2002.07800 (2020) - 2019
- Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar graphs: Random walks and bipartiteness testing. Random Struct. Algorithms 55(1): 104-124 (2019) - Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. ICML 2019: 405-413 - Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. SODA 2019: 1919-1936 - Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. CoRR abs/1902.03519 (2019) - Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Walking Randomly, Massively, and Efficiently. CoRR abs/1907.05391 (2019) - 2018
- 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) - Krzysztof Onak, Xiaorui Sun:
Probability-Revealing Samples. AISTATS 2018: 2018-2026 - Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP 2018: 92:1-92:14 - Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully dynamic maximal independent set with sublinear update time. STOC 2018: 815-826 - Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round compression for parallel matching algorithms. STOC 2018: 471-484 - Krzysztof Onak, Xiaorui Sun:
The query complexity of graph isomorphism: bypassing distribution testing lower bounds. STOC 2018: 165-171 - Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear Update Time. CoRR abs/1802.09709 (2018) - Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. CoRR abs/1806.10051 (2018) - Krzysztof Onak:
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space. CoRR abs/1807.08745 (2018) - Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. CoRR abs/1808.10316 (2018) - 2017
- Ilias Diakonikolas, Elena Grigorescu, Jerry Li, Abhiram Natarajan, Krzysztof Onak, Ludwig Schmidt:
Communication-Efficient Distributed Learning of Discrete Distributions. NIPS 2017: 6391-6401 - Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. CoRR abs/1707.03478 (2017) - 2016
- Venkatesan Guruswami, Krzysztof Onak:
Superlinear Lower Bounds for Multipass Graph Processing. Algorithmica 76(3): 654-683 (2016) - Arturs Backurs, Krzysztof Onak:
Fast Algorithms for Parsing Sequences of Parentheses with Few Errors. PODS 2016: 477-488 - 2015
- 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
- Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev:
Parallel algorithms for geometric graph problems. STOC 2014: 574-583 - Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev:
Parallel Algorithms for Geometric Graph Problems. CoRR abs/1401.0042 (2014) - Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar Graphs: Random Walks and Bipartiteness Testing. CoRR abs/1407.2109 (2014)
skipping 39 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-07 20:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint