An almost optimal algorithm for unbounded searching
From MaRDI portal
Cites work
Cited in
(46)- On compressing permutations and adaptive sorting
- Finger search in grammar-compressed strings
- The complexity of finding SUBSEQ(A)
- Fast calculation of p-values for one-sided Kolmogorov-Smirnov type statistics
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
- Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
- Tracing compressed curves in triangulated surfaces
- Searching games with errors -- fifty years of coping with liars
- On short fastest paths in temporal graphs
- Binary search and recursive graph problems
- Quantum key search with side channel advice
- The longest common subsequence problem revisited
- Techniques for parallel manipulation of sparse matrices
- Improved algorithms for group testing with inhibitors
- Space-efficient Huffman codes revisited
- From time to space: fast algorithms that yield small and fast data structures
- Minimal sets on propositional formulae. Problems and reductions
- Adaptive sorting: an information theoretic perspective
- Optimal encoding of non-stationary sources
- Range minimum queries in minimal space
- The central tree property and algorithmic problems on subgroups of free groups
- On computing distances between leaves in a complete tree
- Coupling from the past for the null recurrent Markov chain
- Searching with known error probability
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct
- Refined algorithms for hitting many intervals
- A general class of resource tradeoffs
- A Wait-free Queue with Polylogarithmic Step Complexity
- Integer representation in the mixed base \((2,3)\)
- Searching and encoding for infinite ordered sets
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
- How to Share a Secret, Infinitely
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
- An instance-based algorithm for deciding the bias of a coin
- How many probes are needed to compute the maximum of a random walk?
- A wait-free queue with polylogarithmic step complexity
- Unbounded search and recursive graph problems
- Fast sequential and parallel algorithms for finding extremal sets
- Efficient algorithms for chemical threshold testing problems
- Toward more localized local algorithms: removing assumptions concerning global knowledge
- Randomized mutual exclusion on a multiple access channel
- Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
- Consecutive occurrences with distance constraints
- Online scheduling with partial job values: does timesharing or randomization help?
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)
