November 01, 2019 conference-paper Parallel Reachability in Almost Linear Work and Square Root Depth Annual Symposium on Foundations of Computer Science DOI: 10.1109/focs.2019.00098 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 22 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access An Evaluation of Massively Parallel Algorithms for DFA Minimization 2024 Electronic Proceedings in Theoretical Computer Science article Computer Science semigroups and automata theory Open access 0 citations 1 result References 0