Paper Review Records
All Paper Review Records
11 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
149
days
Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan
Authors
Tianqi Chen; Zhiyi TanShow moreShow less
Affiliations
School of Mathematical Science, Zhejiang University, Hangzhou 310027, PR ChinaShow moreShow less
406
days
Logical characterization of branching bisimilarity over random processes
Authors
Xian Xu; Wenbo ZhangShow moreShow less
Affiliations
East China University of Science and Technology, Shanghai, China; Shanghai Ocean University, Shanghai, ChinaShow moreShow less
106
days
Notes about the linear complexity of quaternary cyclotomic sequences of order four
Authors
Vladimir Edemskiy; Zeyu CaoShow moreShow less
Affiliations
Yaroslav-the-Wise Novgorod State University, Department of Applied Mathematics and Informatics, B. St. Petersburgskaya, 41, Veliky Novgorod, 173003, RussiaShow moreShow less
343
days
Finding the cyclic covers of a string
Authors
Roberto Grossi; Costas S. Iliopoulos; Jesper Jansson; Zara Lim; Wing-Kin Sung; Wiktor ZubaShow moreShow less
Affiliations
Dipartimento di Informatica, Università di Pisa, Italy; Department of Informatics, King's College London, UK; Graduate School of Informatics, Kyoto University, Kyoto, Japan; The Chinese University of Hong Kong, Hong Kong, China; Hong Kong Genome Institute, Hong Kong Science Park, Hong Kong, China; Centrum Wiskunde & Informatica, Amsterdam, the NetherlandsShow moreShow less
290
days
The complexity of computing the period and the exponent of a digraph
Authors
Stefan Kiefer; Andrew RyzhikovShow moreShow less
Affiliations
Department of Computer Science, University of Oxford, UKShow 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.
