Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Pattern matching in a digitized image
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Analysis of Or-parallel execution models
ACM Transactions on Programming Languages and Systems (TOPLAS)
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Finding level-ancestors in trees
Journal of Computer and System Sciences
Proceedings of the 30th IEEE symposium on Foundations of computer science
Optimal parallel suffix tree construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Symmetry breaking for suffix tree construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Large-scale assembly of DNA strings and space-efficient construction of suffix trees
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient detection of determinacy races in Cilk programs
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Nonplanar topological inference and political-map graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Reconstructing a history of recombinations from a set of sequences
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Output-sensitive generation of random events
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for generalized cut trees
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel coloring algorithms for a family of tree-representable graphs
CSC '91 Proceedings of the 19th annual conference on Computer Science
Minimum cuts in near-linear time
Journal of the ACM (JACM)
Shortest path queries in planar graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel
IEEE Transactions on Parallel and Distributed Systems
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Linear-time recognition of bipartite graphs plus two edges
Discrete Mathematics
Optimal parallel algorithms for direct dominance problems
Nordic Journal of Computing
An Optimal Algorithm for Finding NCA on Pure Pointer Machines
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Level Ancestor Problem Simplified
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Ancestor Problems on Pure Pointer Machines
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Data Mining from Large Text Databases
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Efficient Discovery of Proximity Patterns with Suffix Arrays
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Augmenting Suffix Trees, with Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Building knowledge base management systems
The VLDB Journal — The International Journal on Very Large Data Bases
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On-Line Error Monitoring for Several Data Structures
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Journal of Experimental Algorithmics (JEA)
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic collision detection between two simple polygons
Computational Geometry: Theory and Applications
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory
IEEE Transactions on Knowledge and Data Engineering
Approximating geometric bottleneck shortest paths
Computational Geometry: Theory and Applications
Information Processing Letters
Efficient keyword search for smallest LCAs in XML databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Oblivious string embeddings and edit distance approximations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Software—Practice & Experience
Two flow network simplification algorithms
Information Processing Letters
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Theoretical Computer Science
Single backup table schemes for shortest-path routing
Theoretical Computer Science - Foundations of software science and computation structures
Longest repeats with a block of k don't cares
Theoretical Computer Science
Searching for a set of correlated patterns
Journal of Discrete Algorithms
All maximal-pairs in step-leap representation of melodic sequence
Information Sciences: an International Journal
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
Drawing c-planar biconnected clustered graphs
Discrete Applied Mathematics
Algorithms for extracting motifs from biological weighted sequences
Journal of Discrete Algorithms
Linear time algorithm for the longest common repeat problem
Journal of Discrete Algorithms
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
On the range maximum-sum segment query problem
Discrete Applied Mathematics
Effective keyword search for valuable lcas over xml documents
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Rectangular layouts and contact graphs
ACM Transactions on Algorithms (TALG)
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Enabling Schema-Free XQuery with meaningful query focus
The VLDB Journal — The International Journal on Very Large Data Bases
All-pairs disjoint paths from a common ancestor in Õ(nω) time
Theoretical Computer Science
A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Superimposed Code-Based Indexing Method for Extracting MCTs from XML Documents
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Dual-failure distance and connectivity oracles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing
Retrieving meaningful relaxed tightest fragments for XML keyword search
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Discovering subword associations in strings in time linear in the output size
Journal of Discrete Algorithms
On Cartesian Trees and Range Minimum Queries
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
SAIL: Structure-aware indexing for effective and progressive top-k keyword search over XML documents
Information Sciences: an International Journal
A Compressed Enhanced Suffix Array Supporting Fast String Matching
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Practical Algorithms for the Longest Common Extension Problem
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Finding All Approximate Gapped Palindromes
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Information Processing Letters
Two flow network simplification algorithms
Information Processing Letters
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Testing convexity properties of tree colorings
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Efficient keyword search over data-centric XML documents
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Performance guarantees for B-trees with different-sized atomic keys
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exploit keyword query semantics and structure of data for effective XML keyword search
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A minimal periods algorithm with applications
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
The longest common extension problem revisited and applications to approximate string searching
Journal of Discrete Algorithms
On space efficient two dimensional range minimum data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Finding Patterns In Given Intervals
Fundamenta Informaticae
Faster query algorithms for the text fingerprinting problem
Information and Computation
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
Refining causality: who copied from whom?
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards a parallel topological watershed: first results
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Efficient algorithms for simplifying flow networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Algorithms for Reticulate Networks of Multiple Phylogenetic Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Locally consistent parsing and applications to approximate string comparisons
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Ordered and unordered top-K range reporting in large data sets
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the range maximum-sum segment query problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Approximate distance queries in disk graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Efficient enumeration of phylogenetically informative substrings
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Improved algorithms for the range next value problem and applications
Theoretical Computer Science
Efficient algorithms for local ranking
Information Processing Letters
MAXLCA: a new query semantic model for XML keyword search
Journal of Web Engineering
Research note: Efficient nearer-ancestor algorithm for network routing
Computer Communications
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Variations of the parameterized longest previous factor
Journal of Discrete Algorithms
Least random suffix/prefix matches in output-sensitive time
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Compact separator decompositions in dynamic trees and applications to labeling schemes
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Two-dimensional range minimum queries
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
A simple construction of two-dimensional suffix trees in linear time
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Computing discriminating and generic words
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
Theoretical Computer Science
| Hi-index | 0.01 |