An almost optimal algorithm for unbounded searching
From MaRDI portal
Cites work
Cited in
(56)- Integer representation in the mixed base (2,3)
- The longest common subsequence problem revisited
- Searching with known error probability
- Techniques for parallel manipulation of sparse matrices
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Binary search and recursive graph problems
- How many probes are needed to compute the maximum of a random walk?
- Minimal sets on propositional formulae. Problems and reductions
- Quantum key search with side channel advice
- A general class of resource tradeoffs
- Online scheduling with partial job values: does timesharing or randomization help?
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
- Range minimum queries in minimal space
- Space-efficient Huffman codes revisited
- On short fastest paths in temporal graphs
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct
- Finger search in grammar-compressed strings
- Toward more localized local algorithms: removing assumptions concerning global knowledge
- Adaptive sorting: an information theoretic perspective
- Fast sequential and parallel algorithms for finding extremal sets
- From time to space: fast algorithms that yield small and fast data structures
- Improved algorithms for group testing with inhibitors
- How to Share a Secret, Infinitely
- Refined algorithms for hitting many intervals
- On computing distances between leaves in a complete tree
- On compressing permutations and adaptive sorting
- Searching and encoding for infinite ordered sets
- Unbounded search and recursive graph problems
- Randomized mutual exclusion on a multiple access channel
- Tracing compressed curves in triangulated surfaces
- Efficient algorithms for chemical threshold testing problems
- Optimal encoding of non-stationary sources
- Searching games with errors -- fifty years of coping with liars
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
- An instance-based algorithm for deciding the bias of a coin
- Fast calculation of p-values for one-sided Kolmogorov-Smirnov type statistics
- Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
- A Wait-free Queue with Polylogarithmic Step Complexity
- Consecutive occurrences with distance constraints
- The central tree property and algorithmic problems on subgroups of free groups
- Coupling from the past for the null recurrent Markov chain
- A wait-free queue with polylogarithmic step complexity
- Minimum flow decomposition in graphs with cycles using integer linear programming
- Consecutive occurrences with distance constraints
- Minmax optimal list searching with _2 _2 n average cost
- Fast RSK correspondence by doubling search
- The longest common subsequence problem for small alphabets in the word RAM model
- Twenty questions with random error
- Fast and scalable monitoring for value-freeze operator augmented signal temporal logic
- Galloping in fast-growth natural merge sorts
- Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions
- Beyond logarithmic bounds: querying in constant expected time with learned indexes
- Lazy B-trees
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
- The complexity of finding SUBSEQ(A)
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
This page was built for publication: An almost optimal algorithm for unbounded searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229581)
