Paper Review Records
All Paper Review Records
19 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
271
days
Polylogarithmic time algorithms for shortest path forests in programmable matter
Authors
Andreas Padalkin; Christian ScheidelerShow moreShow less
Affiliations
1. Department of Computer Science, Paderborn University, Paderborn, GermanyShow moreShow less
365
days
Connectivity Labeling in Faulty Colored Graphs
Authors
Asaf Petruschka; Shay Sapir; Elad TzalikShow moreShow less
Affiliations
1. Weizmann Institute, Rehovot, IsraelShow moreShow less
508
days
Improved all-pairs approximate shortest paths in congested clique
Authors
Hong Duc Bui; Shashwat Chandra; Yi-Jun Chang; Michal Dory; Dean LeitersdorfShow moreShow less
Affiliations
1. National University of Singapore, Singapore, Singapore; 2. University of Haifa, Haifa, IsraelShow moreShow less
197
days
Content-oblivious leader election on rings
Authors
Fabian Frei; Ran Gelles; Ahmed Ghazy; Alexandre NolinShow moreShow less
Affiliations
1. CSAIL, Massachusetts Institute of Technology, Cambridge, United States of America; 2. Faculty of Engineering, Bar-Ilan University, Ramat Gan, Israel; 3. CISPA Helmholtz Center for Information Security, Saarbrücken, Germany; 4. Saarland University, Saarbrücken, GermanyShow moreShow less
212
days
Universal pattern formation by oblivious robots under sequential schedulers
Authors
Paola Flocchini; Alfredo Navarra; Debasish Pattanayak; Francesco Piselli; Nicola SantoroShow moreShow less
Affiliations
1. School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Canada; 2. Department of Mathematics and Computer Science, University of Perugia, Perugia, Italy; 3. Department of Computer Science and Engineering, Indian Institute of Technology Indore, Indore, India; 4. School of Computer Science, Carleton University, Ottawa, CanadaShow moreShow less
249
days
Gathering teams of bounded memory agents on a line
Authors
Younan Gao; Andrzej PelcShow moreShow less
Affiliations
1. Department of Computer Science, University of Milano-Bicocca, Milan, Italy; 2. Départment d’Informatique, Université du Québec en Outaouais, Gatineau, CanadaShow 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