Maintaining order in a generalized linked list
Acta Informatica
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
Introduction to algorithms
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
String searching algorithms
Dynamic text indexing under string updates
Journal of Algorithms
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Pattern matching algorithms
Optimal On-Line Search and Sublinear Time Update in String Matching
SIAM Journal on Computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Isomorphism testing and display of symmetries in dynamic trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for dynamic text indexing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
Dynamic Algorithms for the Dyck Languages
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Undirected single source shortest paths in linear time
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Efficient approximate and dynamic matching of patterns using a labeling paradigm
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Text Sparsification via Local Maxima
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Text sparsification via local maxima
Theoretical Computer Science
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
Fast computation of a string duplication history under no-breakpoint-reuse
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Locally consistent parsing and applications to approximate string comparisons
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Towards real-time suffix tree construction
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Faster fully compressed pattern matching by recompression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Reachability in graph timelines
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |