共 50 条
- [41] Tree Evaluation Is in Space O(log n• log log n) PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1268 - 1278
- [45] A O(log n) Signature-Based String Matching Algorithm PROCEEDINGS OF THE 2009 SIXTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS, VOLS 1-3, 2009, : 828 - 830
- [46] Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time ALGORITHMS - ESA 2011, 2011, 6942 : 155 - 166
- [48] Bisimilarity Minimization in O(m log n) Time APPLICATIONS AND THEORY OF PETRI NETS, PROCEEDINGS, 2009, 5606 : 123 - 142