Quantum data structure for range minimum query
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4060743 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2086398 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 7561744 (Why is no real title available?)
- scientific article; zbMATH DE number 7788411 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A Lower Bound on the Complexity of Orthogonal Range Queries
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- A data structure for dynamic trees
- A unifying look at data structures
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
- An(other) Entropy-Bounded Compressed Suffix Tree
- Compressed suffix trees with full functionality
- Computational geometry. Algorithms and applications.
- Data structures for range minimum queries in multidimensional arrays
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient dynamic range minimum query
- Efficient pattern matching with scaling
- Efficient worst-case data structures for range searching
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding dominators revisited (extended abstract)
- Finding the maximum, merging, and sorting in a parallel computation model
- Fully functional static and dynamic succinct trees
- Improved algorithms for the range next value problem and applications
- Improved quantum algorithm for triangle finding via combinatorial arguments
- Konstruktion nichtrekursiver Funktionen
- Lempel-Ziv factorization using less time \& space
- Lower bound for succinct range minimum query
- Lowest common ancestors in trees and directed acyclic graphs
- Marked ancestor problems
- Near-optimal quantum algorithms for string problems
- Nested Quantum Walks with Quantum Data Structures
- New Data Structures for Orthogonal Range Queries
- On (dynamic) range minimum queries in external memory
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- On space efficient two dimensional range minimum data structures
- On succinct representations of binary trees
- Orthogonal range searching on the RAM, revisited
- Parallelism in Comparison Problems
- Path minima queries in dynamic weighted trees
- Persistent predecessor search and orthogonal point location on the word RAM
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Algorithms for the Triangle Problem
- Quantum Query Complexity of Some Graph Problems
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- Quantum Walk Algorithm for Element Distinctness
- Quantum algorithm for lexicographically minimal string rotation
- Quantum algorithms for the subset-sum problem
- Quantum machine learning: a classical perspective
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
- Quantum random access memory
- Quantum random oracle model with auxiliary input
- Quantum speed-ups for string synchronizing sets, longest common substring, and \(k\)-mismatch matching
- Recursion and double recursion
- Recursive Star-Tree Parallel Data Structure
- Replacing suffix trees with enhanced suffix arrays
- Space Efficient Multi-dimensional Range Reporting
- Space-Efficient Algorithms for Document Retrieval
- Space-Efficient Framework for Top-k String Retrieval Problems
- Space-Time Trade-Offs for Orthogonal Range Queries
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Succinct data structures for flexible text retrieval systems
- Succinct indices for range queries with applications to orthogonal range maxima
- The quantum query complexity of approximating the median and related statistics
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Time-efficient quantum walks for 3-distinctness
- Two-Dimensional Range Minimum Queries
- Zum Hilbertschen Aufbau der reellen Zahlen.
This page was built for publication: Quantum data structure for range minimum query
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859729)
