Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
New data structures for orthogonal range queries
SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees
Journal of the ACM (JACM)
Multidimensional divide-and-conquer
Communications of the ACM
A unifying look at data structures
Communications of the ACM
A Worst-Case Analysis of Nearest Neighbor Searching by Projection
Proceedings of the 7th Colloquium on Automata, Languages and Programming
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the History of the Minimum Spanning Tree Problem
IEEE Annals of the History of Computing
On the application of sheared retrieval to orthogonal range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Linear data structures for two types of range search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Space-time tradeoffs for orthogonal range queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Computing Euclidean maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Euclidean minimum spanning trees and bichromatic closest pairs
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On finding minimal 2-connected subgraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Parallel construction of optimal alphabetic trees
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Multiple matching of rectangular patterns
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Multi-method dispatching: a geometric approach with applications to string matching problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A provably efficient computational model for approximate spatiotemporal retrieval
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Output-size sensitive algorithms for finding maximal vectors
SCG '85 Proceedings of the first annual symposium on Computational geometry
Distance problems in computational geometry with fixed orientations
SCG '85 Proceedings of the first annual symposium on Computational geometry
Efficient algorithms for document retrieval problems
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
Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Parallel dynamic lowest common ancestors
Nordic Journal of Computing
Minimum spanning trees in d dimensions
Nordic Journal of Computing
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Range Max Datacube for Fixed Dimensions
ICDT '03 Proceedings of the 9th International Conference on Database Theory
2-D Spatial Indexing Scheme in Optimal Time
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
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
Algorithms for Transposition Invariant String Matching
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Constructing Tournament Representations: An Exercise in Pointwise Relational Programming
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
Remote revocation of smart cards in a private DRM system
ACSW Frontiers '05 Proceedings of the 2005 Australasian workshop on Grid computing and e-research - Volume 44
Transposition invariant string matching
Journal of Algorithms
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
On the range maximum-sum segment query problem
Discrete Applied Mathematics
Efficient dynamic dispatching with type slicing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of Discrete Algorithms
Faster index for property matching
Information Processing Letters
Efficient intensity map splitting algorithms for intensity-modulated radiation therapy
Information Processing Letters
Balanced parentheses strike back
ACM Transactions on Algorithms (TALG)
Algorithms for computing variants of the longest common subsequence problem
Theoretical Computer Science
Well-separated pair decomposition in linear time?
Information Processing Letters
Optimal prefix and suffix queries on texts
Information Processing Letters
A New Efficient Algorithm for Computing the Longest Common Subsequence
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Fitting a Step Function to a Point Set
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
ACM Transactions on Algorithms (TALG)
Range mode and range median queries in constant time and sub-quadratic space
Information Processing Letters
Efficient data structures for range-aggregate queries on trees
Proceedings of the 12th International Conference on Database Theory
Assembling approximately optimal binary search trees efficiently using arithmetics
Information Processing Letters
On Cartesian Trees and Range Minimum Queries
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Space Efficient Multi-dimensional Range Reporting
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Probabilistic histograms for probabilistic data
Proceedings of the VLDB Endowment
Interval Stabbing Problems in Small Integer Ranges
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
Transposition invariant string matching
Journal of Algorithms
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
Improved bounds for range mode and range median queries
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
An efficient parallel algorithm for building the separating tree
Journal of Parallel and Distributed Computing
Combinatorial queries and updates on partial words
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A fun application of compact data structures to indexing geographic data
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
On space efficient two dimensional range minimum data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Algorithms and theory of computation handbook
Finding Patterns In Given Intervals
Fundamenta Informaticae
Range queries over a compact representation of minimum bounding rectangles
ER'10 Proceedings of the 2010 international conference on Advances in conceptual modeling: applications and challenges
Colored range queries and document retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Computing toolpaths for 5-axis NC machines
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Efficient top-k queries for orthogonal ranges
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Theoretical Computer Science
On finding skylines in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Secure authenticated comparisons
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
New algorithms for 1-D facility location and path equipartition problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Path minima queries in dynamic weighted trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A fast algorithm for three-dimensional layers of maxima problem
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Maxima-finding algorithms for multidimensional samples: A two-phase approach
Computational Geometry: Theory and Applications
Faster algorithms for computing longest common increasing subsequences
Journal of Discrete Algorithms
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
Top-k document retrieval in optimal time and linear space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Amortized rigidness in dynamic cartesian trees
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
Faster two dimensional scaled matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Faster algorithms for computing longest common increasing subsequences
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Optimal integer alphabetic trees in linear time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Geometric minimum spanning trees with GEOFILTERKRUSKAL*
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Algorithms for range-aggregate query problems involving geometric aggregation operations
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Two dimensional parameterized matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
A modification of the landau-vishkin algorithm computing longest common extensions via suffix arrays
BSB'05 Proceedings of the 2005 Brazilian conference on Advances in Bioinformatics and Computational Biology
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms
On the range maximum-sum segment query problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Representing a functional curve by curves with fewer peaks
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Minimizing setup and beam-on times in radiation therapy
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Unified view of backward backtracking in short read mapping
Algorithms and Applications
Algorithms for computing variants of the longest common subsequence problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Two constant-factor-optimal realizations of adaptive heapsort
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Restricted transposition invariant approximate string matching under edit distance
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Encoding 2d range maximum queries
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
External memory orthogonal range reporting with fast updates
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Finding maximum sum segments in sequences with uncertainty
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Improved algorithms for the range next value problem and applications
Theoretical Computer Science
Efficient algorithms for local ranking
Information Processing Letters
Space-efficient range reporting for categorical data
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
A faster grammar-based self-index
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Two-Dimensional range diameter queries
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Computing feasible toolpaths for 5-axis machines
Theoretical Computer Science
Discrete range searching primitive for the GPU and its applications
Journal of Experimental Algorithmics (JEA)
Succinct indices for range queries with applications to orthogonal range maxima
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The weak-heap data structure: Variants and applications
Journal of Discrete Algorithms
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
Theoretical Computer Science
Worst-Case I/O-Efficient Skyline Algorithms
ACM Transactions on Database Systems (TODS)
Finding patterns in given intervals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Two-dimensional range minimum queries
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
A new field splitting algorithm for intensity-modulated radiation therapy
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Range non-overlapping indexing and successive list indexing
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Two dimensional range minimum queries and fibonacci lattices
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
New algorithms for computer graphics
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
Computing discriminating and generic words
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Colored range queries and document retrieval
Theoretical Computer Science
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Sequential dependency computation via geometric data structures
Computational Geometry: Theory and Applications
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
Data structures for range-aggregate extent queries
Computational Geometry: Theory and Applications
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
Theoretical Computer Science
Cross-document pattern matching
Journal of Discrete Algorithms
On the compression of search trees
Information Processing and Management: an International Journal
| Hi-index | 0.01 |
Three techniques in computational geometry are explored: Scaling solves a problem by viewing it at increasing levels of numerical precision; activation is a restricted type of update operation, useful in sweep algorithms; the Cartesian tree is a data structure for problems involving maximums and minimums. These techniques solve the minimum spanning tree problem in Rk1 and Rk@@@@ in O(n(lg n)rlg lg n) time and O(n) space, where for Rk@@@@ and k ≥ 3, r &equil; k−2; for Rk1, r &equil; 1, 2, 4 for k &equil; 3, 4, 5 and r &equil; k for k 5. Other problems solved include Rk1and Rk all nearest neighbors, post office and maximum spanning tree; Rk maxima, Rk rectangle searching problems, and Zkp all nearest neighbors (1 ≤ p ≤ @@@@).