Computer Science
Paper Review Records
All Paper Review Records
17 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
Polylogarithmic time algorithms for shortest path forests in programmable matter
AuthorsAndreas Padalkin; Christian Scheideler
Affiliations1. Department of Computer Science, Paderborn University, Paderborn, Germany
Connectivity Labeling in Faulty Colored Graphs
AuthorsAsaf Petruschka; Shay Sapir; Elad Tzalik
Affiliations1. Weizmann Institute, Rehovot, Israel
Improved all-pairs approximate shortest paths in congested clique
AuthorsHong Duc Bui; Shashwat Chandra; Yi-Jun Chang; Michal Dory; Dean Leitersdorf
Affiliations1. National University of Singapore, Singapore, Singapore; 2. University of Haifa, Haifa, Israel
Content-oblivious leader election on rings
AuthorsFabian Frei; Ran Gelles; Ahmed Ghazy; Alexandre Nolin
Affiliations1. 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, Germany
Universal pattern formation by oblivious robots under sequential schedulers
AuthorsPaola Flocchini; Alfredo Navarra; Debasish Pattanayak; Francesco Piselli; Nicola Santoro
Affiliations1. 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, Canada
Gathering teams of bounded memory agents on a line
AuthorsYounan Gao; Andrzej Pelc
Affiliations1. Department of Computer Science, University of Milano-Bicocca, Milan, Italy; 2. Départment d’Informatique, Université du Québec en Outaouais, Gatineau, Canada
Distributed MIS in O (log log n ) Awake Complexity
AuthorsFabien Dufoulon; William K. Moses Jr.; Gopal Pandurangan
Affiliations1. School of Computing and Communications, Lancaster University, Lancaster, UK; 2. Department of Computer Science, Durham University, Durham, UK; 3. Department of Computer Science, University of Houston, Houston, USA
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.