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.
On the notions of bounded bypass, and how to make any deadlock-free MUTEX protocol satisfy one of them
AuthorsRob van Glabbeek; Daniele Gorla; Myrthe Spronck
Affiliations1. School of Informatics, University of Edinburgh, Edinburgh, UK; 2. School of Computer Science and Engineering, University of New South Wales, Sydney, Australia; 3. Dept. of Computer Science, Sapienza University of Rome, Rome, Italy; 4. Dept. of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
Non-uniform content-oblivious leader election in 2-edge-connected networks
AuthorsJérémie Chalopin; Yi-Jun Chang; Lyuting Chen; Giuseppe A. Di Luna; Haoran Zhou
Affiliations1. CNRS, LIS, Aix-Marseille University, Marseille, France; 2. National University of Singapore, Singapore, Singapore; 3. DIAG, Sapienza University of Rome, Rome, Italy
Exploration on highly dynamic graphs
AuthorsAshish Saxena; Kaushik Mondal
Affiliations1. Department of Mathematics, Indian Institute of Technology Ropar, Rupnagar, India
Demand-aware plane Spanners of Bounded Degree
AuthorsEsra Ceylan; Klaus-Tycho Foerster; Stefan Schmid; Katsiaryna Zaitsava
Affiliations1. University of Vienna, Vienna, Austria; 2. TU Dortmund, Dortmund, Germany; 3. TU Berlin, Berlin, Germany
Optimal simultaneous Byzantine Agreement, common knowledge and limited information exchange
AuthorsRon van der Meyden
Affiliations1. School of Computer Science and Engineering, UNSW Sydney, Sydney, Australia
Time-optimal self-stabilizing leader election in population protocols
AuthorsJanna Burman; Ho-Lin Chen; Hsueh-Ping Chen; David Doty; Thomas Nowak; Eric Severson; Chuan Xu
Affiliations1. Université Paris-Saclay, CNRS, Orsay, France; 2. National Taiwan University, Taipei, Taiwan; 3. University of California, Davis, Davis, USA; 4. Université Paris-Saclay, CNRS, ENS Paris-Saclay, Gif-sur-Yvette, France; 5. Institut Universitaire de France, Paris, France; 6. Inria Sophia-Antipolis, Valbonne, France
Team formation and applications
AuthorsYuval Emek; Shay Kutten; Ido Rafael; Gadi Taubenfeld
Affiliations1. Faculty of Data and Decision Sciences, Technion — Israel Institute of Technology, Haifa, Israel; 2. School of Computer Science, Reichman University, Herzliya, Israel
Memory lower bounds and impossibility results for anonymous dynamic broadcast
AuthorsGarrett Parzych; Joshua J. Daymude
Affiliations1. School of Computing and Augmented Intelligence, Arizona State University, Tempe, USA; 2. Biodesign Center for Biocomputing, Security and Society, Arizona State University, Tempe, USA
A topological characterization of stabilizing consensus
AuthorsUlrich Schmid; Stephan Felber; Hugo Rincon Galeana
Affiliations1. Embedded Computing Systems Group E191-02, TU Wien, Vienna, Austria; 2. Internet Architecture and Management, TU Berlin, Berlin, Germany
Satrapy: From abstract to practical consensus for heterogeneous quorum systems
AuthorsXiao Li; Eric M. Chan; Mohsen Lesani
Affiliations1. BCOE, University of California, Riverside, Riverside, USA; 2. BSE, University of California, Santa Cruz, Santa Cruz, 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.