Computer Science
Paper Review Records
All Paper Review Records
14 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
AuthorsSepehr Assadi; Soheil Behnezhad; Christian Konrad; Kheeran Naidu; Janani Sundaresan
Affiliations1. University of Waterloo Faculty of Mathematics; 2. Northeastern University - Boston Campus; 3. University of Bristol
Distributed Δ-Coloring Plays Hide-and-Seek
AuthorsAlkida Balliu; Sebastian Brandt; Fabian Kuhn; Dennis Olivetti
Affiliations1. Gran Sasso Science Institute; 2. CISPA Helmholtz Center for Information Security; 3. Department of Computer Science, University of Freiburg
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
AuthorsAlkida Balliu; Sebastian Brandt; Fabian Kuhn; Dennis Olivetti; Gustav Schmid
Affiliations1. Gran Sasso Science Institute; 2. CISPA Helmholtz Center for Information Security; 3. Department of Computer Science, University of Freiburg; 4. University of Freiburg
Near Optimal Alphabet-Soundness Tradeoff PCPs
AuthorsDor Minzer; Kai Zhe Zheng
Affiliations1. MIT
On the Computability of Measures of Regular Sets of Infinite Trees
AuthorsDamian Niwiński; Paweł Parys; Michał Skrzypczak
Affiliations1. Faculty of Mathematics, Informatics and Mechanics, University of Warsaw
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
AuthorsNeil Olver; Leon Sering; Laura Vargas Koch
Affiliations1. Department of Mathematics, The London School of Economics and Political Science; 2. ETH Zurich; 3. School of Business and Economics, RWTH Aachen University
Quantitative Equational Logic
AuthorsGiorgio Bacci; Radu Mardare; Prakash Panangaden; Gordon Plotkin
Affiliations1. Department of Computer Science, AAU; 2. School of Mathematics and Computer Science, Heriot-Watt University; 3. School of Computer Science, McGill University; 4. School of Informatics, University
Robustly Learning Mixtures of k Arbitrary Gaussians
AuthorsAinesh Bakshi; Ilias Diakonikolas; He Jia; Daniel Kane; Pravesh Kothari; Santosh Vempala
Affiliations1. Carnegie Mellon University; 2. New York University; 3. Computer Sciences, University of Wisconsin Madison; 4. Computer Science, Georgia Institute of Technology; 5. Northwestern University; 6. Computer Science and Engineering, University of California San Diego; 7. Princeton University
Simulating Time with Square-Root Space
AuthorsRyan Williams
Affiliations1. CSAIL and EECS, Massachusetts Institute of Technology
Vizing’s Theorem in Near-Linear Time
AuthorsSepehr Assadi; Soheil Behnezhad; Sayan Bhattacharya; Martin Costa; Shay Solomon; Tianyi Zhang
Affiliations1. University of Waterloo; 2. Northeastern University; 3. University of Warwick; 4. Tel Aviv University; 5. State Key Laboratory for Novel Software Technology, Nanjing University
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.