Succinct indices for path minimum, with applications (Q2362355): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-016-0170-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2414522820
@@ Property / OpenAlex ID: W2414522820 / rank @@
+Normal rank
@@ Property / cites work @@
+A unifying look at data structures
@@ Property / cites work: A unifying look at data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal static range reporting in one dimension
@@ Property / cites work: Optimal static range reporting in one dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754135
@@ Property / cites work: Q2754135 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct indexes for strings, binary relations and multilabeled trees
+Normal rank
@@ Property / cites work @@
+A survey on tree edit distance and related problems
+Normal rank
@@ Property / cites work @@
+Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
+Normal rank
@@ Property / cites work @@
+Succinct sampling from discrete distributions
@@ Property / cites work: Succinct sampling from discrete distributions / rank @@
+Normal rank
@@ Property / cites work @@
+Two Dimensional Range Minimum Queries and Fibonacci Lattices
+Normal rank
@@ Property / cites work @@
+Path Minima Queries in Dynamic Weighted Trees
@@ Property / cites work: Path Minima Queries in Dynamic Weighted Trees / rank @@
+Normal rank
@@ Property / cites work @@
+On space efficient two dimensional range minimum data structures
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
+Normal rank
@@ Property / cites work @@
+Succinct Indices for Path Minimum, with Applications to Path Reporting
+Normal rank
@@ Property / cites work @@
+Orthogonal range searching on the RAM, revisited
@@ Property / cites work: Orthogonal range searching on the RAM, revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Computing on a free tree via complexity-preserving mappings
+Normal rank
@@ Property / cites work @@
+THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
@@ Property / cites work: THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+On Cartesian Trees and Range Minimum Queries
@@ Property / cites work: On Cartesian Trees and Range Minimum Queries / rank @@
+Normal rank
@@ Property / cites work @@
+A linear lower bound on index size for text retrieval
+Normal rank
@@ Property / cites work @@
+Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
+Normal rank
@@ Property / cites work @@
+Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees
+Normal rank
@@ Property / cites work @@
+A uniform paradigm to succinctly encode various families of trees
+Normal rank
@@ Property / cites work @@
+Universal Succinct Representations of Trees?
@@ Property / cites work: Universal Succinct Representations of Trees? / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed representations of sequences and full-text indexes
+Normal rank
@@ Property / cites work @@
+Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+Normal rank
@@ Property / cites work @@
+Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
+Normal rank
@@ Property / cites work @@
+A Data Structure for Dynamically Maintaining Rooted Trees
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct ordinal trees with level-ancestor queries
+Normal rank
@@ Property / cites work @@
+Optimal lower bounds for rank and select indexes
@@ Property / cites work: Optimal lower bounds for rank and select indexes / rank @@
+Normal rank
@@ Property / cites work @@
+More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Succinct ordinal trees based on tree covering
@@ Property / cites work: Succinct ordinal trees based on tree covering / rank @@
+Normal rank
@@ Property / cites work @@
+Path Queries in Weighted Trees
@@ Property / cites work: Path Queries in Weighted Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Data Structures for Path Queries
@@ Property / cites work: Succinct Data Structures for Path Queries / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Path Counting and Reporting in Linear Space
+Normal rank
@@ Property / cites work @@
+A framework for succinct labeled ordinal trees over large alphabets
+Normal rank
@@ Property / cites work @@
+Path Minima in Incremental Unrooted Trees
@@ Property / cites work: Path Minima in Incremental Unrooted Trees / rank @@
+Normal rank
@@ Property / cites work @@
+A simpler minimum spanning tree verification algorithm
+Normal rank
@@ Property / cites work @@
+Linear verification for spanning trees
@@ Property / cites work: Linear verification for spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5705139
@@ Property / cites work: Q5705139 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921648
@@ Property / cites work: Q2921648 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Representation of Balanced Parentheses and Static Trees
+Normal rank
@@ Property / cites work @@
+Succinct representations of weighted trees supporting path queries
+Normal rank
@@ Property / cites work @@
+An inverse-Ackermann type lower bound for online minimum spanning tree verification
+Normal rank
@@ Property / cites work @@
+Succinct indexable dictionaries with applications to encoding             <i>k</i>             -ary trees, prefix sums and multisets
+Normal rank
@@ Property / cites work @@
+Squeezing succinct data structures into entropy bounds
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank