Published in: LIPIcs, Volume 325, 16th Innovations in Theoretical Computer Science Conference (ITCS 2025)
John Kallaugher, Ojas Parekh, Kevin Thompson, Yipu Wang, and Justin Yirka. Complexity Classification of Product State Problems for Local Hamiltonians. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 63:1-63:32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{kallaugher_et_al:LIPIcs.ITCS.2025.63, author = {Kallaugher, John and Parekh, Ojas and Thompson, Kevin and Wang, Yipu and Yirka, Justin}, title = {{Complexity Classification of Product State Problems for Local Hamiltonians}}, booktitle = {16th Innovations in Theoretical Computer Science Conference (ITCS 2025)}, pages = {63:1--63:32}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-361-4}, ISSN = {1868-8969}, year = {2025}, volume = {325}, editor = {Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.63}, URN = {urn:nbn:de:0030-drops-226910}, doi = {10.4230/LIPIcs.ITCS.2025.63}, annote = {Keywords: quantum complexity, quantum algorithms, local hamiltonians} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Rajesh Jayaram and John Kallaugher. An Optimal Algorithm for Triangle Counting in the Stream. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 11:1-11:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{jayaram_et_al:LIPIcs.APPROX/RANDOM.2021.11, author = {Jayaram, Rajesh and Kallaugher, John}, title = {{An Optimal Algorithm for Triangle Counting in the Stream}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {11:1--11:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.11}, URN = {urn:nbn:de:0030-drops-147046}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.11}, annote = {Keywords: Triangle Counting, Streaming, Graph Algorithms, Sampling, Sketching} }
Feedback for Dagstuhl Publishing