Computer Science
Paper Review Records
All Paper Review Records
5 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
A strong direct sum theorem for distributional query complexity
AuthorsGuy Blanc; Caleb Koch; Carmen Strassle; Li-Yang Tan
Affiliations1. Department of Computer Science, Stanford University, Stanford, USA
Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
AuthorsGreta Panova
Affiliations1. University of Southern California, Los Angeles, USA
Lifting Dichotomies
AuthorsYaroslav Alekseev; Yuval Filmus; Alexander V. Smal
Affiliations1. The Taub Faculty of Computer Science, Technion —Israel Institute of Technology, Haifa, Israel; 2. The Taub Faculty of Computer Science and Faculty of Mathematics, Technion —Israel Institute of Technology, Haifa, Israel; 3. JetBrains Research, Limassol, Cyprus
Separation of the Factorization Norm and Randomized Communication Complexity
AuthorsTsun-Ming Cheung; Hamed Hatami; Kaave Hosseini; Morgan Shirley
Affiliations1. Institute of Information Science, Academia Sinica, Taipei, Taiwan; 2. School of Computer Science, McGill University, Montreal, Canada; 3. Department of Computer Science, University of Rochester, New York, USA; 4. Department of Computer Science, University of Victoria, Vancouver Island, Canada
Quantum Automating TC 0 -Frege Is LWE-Hard
AuthorsNoel Arteche; Gaia Carenini; Matthew Gray
Affiliations1. Lund University, Lund, Sweden; 2. University of Copenhagen, Copenhagen, Denmark; 3. University of Cambridge, Cambridge, UK; 4. University of Oxford, Oxford, UK
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.