Pages that link to "Item:Q1229581"
From MaRDI portal
The following pages link to An almost optimal algorithm for unbounded searching (Q1229581):
Displayed 42 items.
- Improved algorithms for group testing with inhibitors (Q293316) (← links)
- Refined algorithms for hitting many intervals (Q344570) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Randomized mutual exclusion on a multiple access channel (Q518923) (← links)
- Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions (Q710617) (← links)
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case (Q922525) (← links)
- Integer representation in the mixed base \((2,3)\) (Q1040415) (← links)
- The longest common subsequence problem revisited (Q1098310) (← links)
- Searching with known error probability (Q1115619) (← links)
- Techniques for parallel manipulation of sparse matrices (Q1119337) (← links)
- The complexity of selection and ranking in X+Y and matrices with sorted columns (Q1161291) (← links)
- Binary search and recursive graph problems (Q1391302) (← links)
- How many probes are needed to compute the maximum of a random walk? (Q1593629) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Quantum key search with side channel advice (Q1746986) (← links)
- A general class of resource tradeoffs (Q1837531) (← links)
- Online scheduling with partial job values: does timesharing or randomization help? (Q1879362) (← links)
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints (Q2029253) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Space-efficient Huffman codes revisited (Q2094355) (← links)
- On short fastest paths in temporal graphs (Q2232230) (← links)
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct (Q2272991) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Adaptive sorting: an information theoretic perspective (Q2480779) (← links)
- Fast sequential and parallel algorithms for finding extremal sets (Q2710788) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- How to Share a Secret, Infinitely (Q3181038) (← links)
- On computing distances between leaves in a complete tree (Q3890125) (← links)
- Searching and encoding for infinite ordered sets (Q3933757) (← links)
- Unbounded search and recursive graph problems (Q5096341) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- Efficient algorithms for chemical threshold testing problems (Q5941290) (← links)
- Optimal encoding of non-stationary sources (Q5944439) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
- An instance-based algorithm for deciding the bias of a coin (Q6132245) (← links)
- Fast calculation of p-values for one-sided Kolmogorov-Smirnov type statistics (Q6170541) (← links)
- Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines (Q6180227) (← links)
- A Wait-free Queue with Polylogarithmic Step Complexity (Q6202234) (← links)