Paper Review Records
All Paper Review Records
20 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
42
days
Fault-Tolerant ST-Diameter Oracles
Authors
Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich; Simon Krogmann; Martin SchirneckShow moreShow less
Affiliations
1. Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, L’Aquila, Italy; 2. Department of Computer Science and Engineering, Indian Institute of Technology Delhi, Delhi, India; 3. Efi Arazi School of Computer Science, Reichman University, Herzliya, Israel; 4. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany; 5. Derpartment of Informatics, Karlsruhe Institute of Technology, Karlsruhe, GermanyShow moreShow less
373
days
Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments
Authors
Pankaj K. Agarwal; Haim Kaplan; Matthew J. Katz; Micha SharirShow moreShow less
Affiliations
1. Department of Computer Science, Duke University, Durham, USA; 2. School of Computer Science, Tel Aviv University, Tel Aviv, Israel; 3. The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer Sheva, IsraelShow moreShow less
392
days
A Lower Bound on the Trace Norm of Boolean Matrices and its Applications
Authors
Tsun-Ming Cheung; Hamed Hatami; Kaave Hosseini; Aleksandar Nikolov; Toniann Pitassi; Morgan ShirleyShow moreShow less
Affiliations
1. 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, Rochester, USA; 4. Department of Computer Science, University of Toronto, Toronto, Canada; 5. Department of Computer Science, Columbia University, New York, USA; 6. Department of Computer Science, Lund University, Lund, SwedenShow moreShow less
199
days
A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games
Authors
Alistair Benford; Per Kristian LehreShow moreShow less
Affiliations
1. School of Informatics, University of Edinburgh, Edinburgh, UK; 2. School of Computer Science, University of Birmingham, Birmingham, UKShow moreShow less
339
days
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
Authors
Tijn de Vos; Aleksander ChristiansenShow moreShow less
Affiliations
1. TU Graz, Graz, Austria; 2. Technical University of Denmark, Copenhagen, DenmarkShow moreShow less
736
days
Counting Polyominoes, Revisited
Authors
Gill Barequet; Gil Ben-ShacharShow moreShow less
Affiliations
1. Department of Computer Science, The Technion—Israel Institute of Technology, Haifa, IsraelShow moreShow less
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.
Client
I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?
CrushSCI
Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.
- Suggested title
- Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment
- Database shortlist
- Environmental Technology & Innovation
SampleLatest 5 valid paper samples from 2026
Average review62 days
Median65 days