Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
Real-time deques, multihead Turing machines, and purely functional programming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Purely functional random-access lists
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An optimal RAM implementation of catenable min double-ended queues
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
Approximate string matching with gaps
Nordic Journal of Computing
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
An efficient alignment algorithm for masked sequences
Theoretical Computer Science
Computing similarity of run-length encoded strings with affine gap penalty
Theoretical Computer Science
On minimizing pattern splitting in multi-track string matching
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Algorithms and theory of computation handbook
A fully compressed algorithm for computing the edit distance of run-length encoded strings
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Computing similarity of run-length encoded strings with affine gap penalty
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.89 |