Computer Science
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.
Longest common subsequence including at most k segments
AuthorsTiantian Li; Haitao Jiang; Xuefeng Cui; Haodi Feng; Daming Zhu; Lusheng Wang
AffiliationsSchool of Software, Shandong University, Jinan, Shandong, China; School of Computer Science and Technology, Shandong University, Qingdao, Shandong, China; Department of Computer Science, City University of Hong Kong, Hongkong, China
Reachability in graphs having linear 2-arboricity two is NL-hard
AuthorsRonak Bhadra; Raghunath Tewari
AffiliationsIndian Institute of Technology Kanpur, Kanpur, 208016, Uttar Pradesh, India
Practical committing attacks against Rocca-S
AuthorsRyunosuke Takeuchi; Yosuke Todo; Tetsu Iwata
AffiliationsNagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8603, Japan; NTT Social Informatics Laboratories, 3-9-11 Midori-cho, Musashino 180-8585, Japan
The Steiner path aggregation problem
AuthorsDa Qi Chen; Daniel Hathcock; D. Ellis Hershkowitz; R. Ravi
AffiliationsUniversity of Virginia, Charlottesville, 22904, VA, USA; Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh, 15213, PA, USA; Brown University, Providence, 02912, RI, USA
The harmonious coloring game
AuthorsCláudia Linhares Sales; Thiago Marcilon; Nicolas Martins; Nicolas Nisse; Rudini Sampaio
AffiliationsDept. Computação, Universidade Federal do Ceará, Brazil; Centro de Ciências e Tecnologia, Universidade Federal do Cariri, Brazil; Inst. Engenharia e Desenvolv. Sustentável, UNILAB, Brazil; Université Côte d'Azur, INRIA, CNRS, I3S, France
Note on pancake sorting
AuthorsMarcin Peczarski
AffiliationsInstitute of Informatics, University of Warsaw, ul. Banacha 2, PL-02-097 Warszawa, Poland
Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan
AuthorsTianqi Chen; Zhiyi Tan
AffiliationsSchool of Mathematical Science, Zhejiang University, Hangzhou 310027, PR China
Logical characterization of branching bisimilarity over random processes
AuthorsXian Xu; Wenbo Zhang
AffiliationsEast China University of Science and Technology, Shanghai, China; Shanghai Ocean University, Shanghai, China
Notes about the linear complexity of quaternary cyclotomic sequences of order four
AuthorsVladimir Edemskiy; Zeyu Cao
AffiliationsYaroslav-the-Wise Novgorod State University, Department of Applied Mathematics and Informatics, B. St. Petersburgskaya, 41, Veliky Novgorod, 173003, Russia
Finding the cyclic covers of a string
AuthorsRoberto Grossi; Costas S. Iliopoulos; Jesper Jansson; Zara Lim; Wing-Kin Sung; Wiktor Zuba
AffiliationsDipartimento 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 Netherlands
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.