default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Kallaugher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2024
[c10]John Kallaugher
, Ojas Parekh, Nadezhda Voronova:
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model. STOC 2024: 1805-1815- 2022
- [c9]Ashish Chiplunkar, John Kallaugher, Michael Kapralov, Eric Price:
Factorial Lower Bounds for (Almost) Random Order Streams. FOCS 2022: 486-497 - [c8]John Kallaugher, Ojas Parekh:
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut. FOCS 2022: 498-506 - [c7]John Kallaugher, Michael Kapralov, Eric Price:
Simulating Random Walks in Random Streams. SODA 2022: 3091-3126 - 2021
- [c6]Rajesh Jayaram, John Kallaugher:
An Optimal Algorithm for Triangle Counting in the Stream. APPROX-RANDOM 2021: 11:1-11:11 - [c5]John Kallaugher:
A Quantum Advantage for a Natural Streaming Problem. FOCS 2021: 897-908 - 2020
- [c4]John Kallaugher, Eric Price:
Separations and equivalences between turnstile streaming and linear sketching. STOC 2020: 1223-1236 - 2019
- [c3]John Kallaugher, Andrew McGregor, Eric Price, Sofya Vorotnikova:
The Complexity of Counting Cycles in the Adjacency List Streaming Model. PODS 2019: 119-133 - 2018
- [c2]John Kallaugher, Michael Kapralov, Eric Price:
The Sketching Complexity of Graph and Hypergraph Counting. FOCS 2018: 556-567 - 2017
- [c1]John Kallaugher, Eric Price:
A Hybrid Sampling Scheme for Triangle Counting. SODA 2017: 1778-1797
Informal and Other Publications
- 2024
- [i11]John Kallaugher, Ojas Parekh, Kevin Thompson, Yipu Wang, Justin Yirka:
Complexity Classification of Product State Problems for Local Hamiltonians. CoRR abs/2401.06725 (2024) - 2023
- [i10]John Kallaugher, Ojas Parekh, Nadezhda Voronova:
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model. CoRR abs/2311.14123 (2023) - [i9]John Kallaugher, Ojas Parekh, Nadezhda Voronova:
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i8]John Kallaugher, Ojas Parekh:
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut. CoRR abs/2206.00213 (2022) - 2021
- [i7]Rajesh Jayaram, John Kallaugher:
An Optimal Algorithm for Triangle Counting. CoRR abs/2105.01785 (2021) - [i6]John Kallaugher:
A Quantum Advantage for a Natural Streaming Problem. CoRR abs/2106.04633 (2021) - [i5]Ashish Chiplunkar, John Kallaugher, Michael Kapralov, Eric Price:
Approximating Local Graph Structure in Almost Random Order Streams. CoRR abs/2110.10091 (2021) - [i4]John Kallaugher, Michael Kapralov, Eric Price:
Simulating Random Walks in Random Streams. CoRR abs/2112.07532 (2021) - 2019
- [i3]John Kallaugher, Eric Price:
Exponential Separations Between Turnstile Streaming and Linear Sketching. CoRR abs/1905.02358 (2019) - 2018
- [i2]John Kallaugher, Michael Kapralov, Eric Price:
The Sketching Complexity of Graph and Hypergraph Counting. CoRR abs/1808.04995 (2018) - 2016
- [i1]John Kallaugher, Eric Price:
Improved graph sampling for triangle counting. CoRR abs/1610.02066 (2016)
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 22:23 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:
