John Kallaugher

Orcid: 0000-0003-2591-3298

According to our database1, John Kallaugher authored at least 16 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
1
1
2
1
1
1
3
2
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Complexity Classification of Product State Problems for Local Hamiltonians.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024
How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing.
CoRR, 2024

2023
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model.
Electron. Colloquium Comput. Complex., 2023

2022
Simulating Random Walks in Random Streams.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Factorial Lower Bounds for (Almost) Random Order Streams.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Approximating Local Graph Structure in Almost Random Order Streams.
CoRR, 2021

An Optimal Algorithm for Triangle Counting.
CoRR, 2021

A Quantum Advantage for a Natural Streaming Problem.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

An Optimal Algorithm for Triangle Counting in the Stream.
Proceedings of the Approximation, 2021

2020
Separations and equivalences between turnstile streaming and linear sketching.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Exponential Separations Between Turnstile Streaming and Linear Sketching.
CoRR, 2019

The Complexity of Counting Cycles in the Adjacency List Streaming Model.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

2018
The Sketching Complexity of Graph and Hypergraph Counting.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
A Hybrid Sampling Scheme for Triangle Counting.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Improved graph sampling for triangle counting.
CoRR, 2016


  Loading...