Paper Review Records
All Paper Review Records
15 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
164
days
Adaptive Encodings for Small and Fast Compressed Suffix Arrays
Authors
Diego Díaz-Domínguez; Veli MäkinenShow moreShow less
Affiliations
1. Department of Computer Science, University of Helsinki, Helsinki, FinlandShow moreShow less
555
days
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
Authors
Stefan Hermann; Hans-Peter Lehmann; Giulio Ermanno Pibiri; Peter Sanders; Stefan WalzerShow moreShow less
Affiliations
1. Karlsruhe Institute of Technology, Karlsruhe, Germany; 2. Ca’ Foscari University of Venice, Venice, ItalyShow moreShow less
133
days
When Is String Reconstruction Using de Bruijn Graphs Hard?
Authors
Ben Bals; Benjamin Aram Berendsohn; Sebastiaan van Krieken; Solon P. Pissis; Leen Stougie; Hilde VerbeekShow moreShow less
Affiliations
1. Centrum Wiskunde en Informatica, Amsterdam, The Netherlands and Vrije Universiteit Amsterdam, Amsterdam, The Netherlands; 2. Max-Planck-Institut für Informatik, Saarbrücken, Germany; 3. Delft University of Technology, Delft, The Netherlands; 4. The Cyprus Institute, Nicosia, Cyprus; 5. Centrum Wiskunde en Informatica, Amsterdam, The NetherlandsShow moreShow less
399
days
A Dichotomy for Maximum PCSPs on Graphs
Authors
Tamio-Vesa Nakajima; Stanislav ŽivnýShow moreShow less
Affiliations
1. Philipps-Universität Marburg, Marburg, Germany; 2. University of Oxford, Oxford, United KingdomShow moreShow less
575
days
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs
Authors
Haim Kaplan; Matthew J. Katz; Rachel Saban; Micha SharirShow moreShow less
Affiliations
1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel; 2. The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer-Sheva, IsraelShow moreShow less
1,199
days
A (2 + ε )-Approximation Algorithm for Maximum Independent Set of Rectangles
Authors
Waldo Gálvez; Arindam Khan; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas WieseShow moreShow less
Affiliations
1. Universidad de Concepción, Concepción, Chile; 2. Indian Institute of Science, Bangalore, India; 3. LIRMM, Université de Montpellier, CNRS, Montpellier, France; 4. University of Augsburg, Augsburg, Germany; 5. Carnegie Mellon University, Pittsburgh, Pennsylvania, USA and New York University, New York, New York, USA; 6. Universidad de Chile, Santiago, Chile and Technical University of Munich, Munich, GermanyShow moreShow less
FAQ
How long does ACM Transactions on Algorithms take to review a manuscript?
As of 2026-11-16, CrushSCI has 15 complete review records for ACM Transactions on Algorithms. The fastest paper went from submission to acceptance in 133 days (When Is String Reconstruction Using de Bruijn Graphs Hard?, received 2026-04-02, accepted 2026-08-13); the slowest took 2100 days. The average is 586.2 days and the median is 456 days.
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.
