The following pages link to (Q3994535):
Displaying 50 items.
- Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194) (← links)
- Improved algorithms for group testing with inhibitors (Q293316) (← links)
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Learning Boolean halfspaces with small weights from membership queries (Q329608) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- Rounds in combinatorial search (Q378259) (← links)
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- Minimum average-case queries of \(q+1\)-ary search game with small sets (Q412374) (← links)
- Learning a hidden graph (Q479267) (← links)
- Finding at least one excellent element in two rounds (Q538153) (← links)
- The plurality problem with three colors and more. (Q557833) (← links)
- Finding the maximum and minimum (Q678861) (← links)
- Learning a hidden uniform hypergraph (Q683922) (← links)
- Computing majority with triple queries (Q690459) (← links)
- Reconstruction of hidden graphs and threshold group testing (Q719032) (← links)
- Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325) (← links)
- A revised algorithm for searching for all defective edges in a graph (Q765324) (← links)
- Selecting two different defective coins (Q849821) (← links)
- A competitive algorithm in searching for many edges in a hypergraph (Q869578) (← links)
- Linear extension majority cycles for small (n\(\leq 9)\) partial orders (Q920120) (← links)
- Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
- Counting linear extension majority cycles in partially ordered sets on up to 13 elements (Q980203) (← links)
- Binary trees with choosable edge lengths (Q989581) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Binary search with delayed and missing answers (Q1007537) (← links)
- Searching for an edge in a graph with restricted test sets (Q1024439) (← links)
- Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
- Edge search in graphs with restricted test sets (Q1045083) (← links)
- Some results on the complexity of families of sets (Q1176725) (← links)
- A binary search problem on graphs (Q1186168) (← links)
- An improved algorithm for quantitative group testing (Q1193729) (← links)
- Group testing with unreliable tests (Q1269106) (← links)
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance (Q1270819) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Geometric applications of posets (Q1276942) (← links)
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping (Q1281767) (← links)
- On polychotomous search problems (Q1330533) (← links)
- An empirical analysis of terminological representation systems (Q1332849) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- Search problems: One, two or many rounds (Q1344611) (← links)
- A group testing problem for graphs with several defective edges (Q1348382) (← links)
- New lower bounds on the cost of binary search trees (Q1351808) (← links)
- Edge search in hypergraphs (Q1356674) (← links)
- A nonadaptive version of Ulam's problem with one lie (Q1360979) (← links)
- A non-adaptive search algorithm that identifies up to three defects (Q1361624) (← links)
- Variants of the majority problem. (Q1422403) (← links)
- Recognition problems and communication complexity. (Q1422409) (← links)
- Optimal detection of two counterfeit coins with two-arms balance. (Q1427807) (← links)
- The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables (Q1578507) (← links)
- A ternary search problem on two disjoint sets (Q1627863) (← links)
