Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Deterministic load balancing and dictionaries in the parallel disk model
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
A simple optimal representation for balanced parentheses
Theoretical Computer Science
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
Making deterministic signatures quickly
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Biosequence Similarity Search on the Mercury System
Journal of VLSI Signal Processing Systems
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
In-place 2-d nearest neighbor search
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Roundtrip spanners and roundtrip routing in directed graphs
ACM Transactions on Algorithms (TALG)
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
History-Independent Cuckoo Hashing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Fast and compact regular expression matching
Theoretical Computer Science
Matching subsequences in trees
Journal of Discrete Algorithms
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
Indexing a dictionary for subset matching queries
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Regular expression matching with multi-strings and intervals
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Faster query algorithms for the text fingerprinting problem
Information and Computation
The tree inclusion problem: in optimal space and faster
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Matching subsequences in trees
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
New algorithms for regular expression matching
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Indexing a dictionary for subset matching queries
Algorithms and Applications
Research paper: The saga of minimum spanning trees
Computer Science Review
Least random suffix/prefix matches in output-sensitive time
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
A framework for dynamizing succinct data structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Mihai Pǎtraşcu: obituary and open problems
ACM SIGACT News
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Hi-index | 0.00 |