The following pages link to (Q3792452):
Displayed 49 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Finding at least one excellent element in two rounds (Q538153) (← links)
- Separation with restricted families of sets (Q739393) (← links)
- Nonadaptive group testing with lies: probabilistic existence theorems (Q984649) (← links)
- Binary search with delayed and missing answers (Q1007537) (← links)
- On the cut-off point for combinatorial group testing (Q1283788) (← links)
- New lower bounds on the cost of binary search trees (Q1351808) (← links)
- Edge search in hypergraphs (Q1356674) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Probabilistic existence theorems in group testing (Q1395870) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- A search problem on a bipartite network (Q1735184) (← links)
- Minimax trees in linear time with applications (Q1761500) (← links)
- Edge search in graphs and hypergraphs of bounded rank (Q1801680) (← links)
- Strategies for the Renyi--Ulam game with fixed number of lies (Q1884914) (← links)
- Identification of partial disjunction, parity, and threshold functions (Q1978506) (← links)
- On the cost of unsuccessful searches in search trees with two-way comparisons (Q2051772) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
- Evacuating equilateral triangles and squares in the face-to-face model (Q2206722) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
- Priority evacuation from a disk: the case of \(n = 1,2,3\) (Q2285157) (← links)
- Optimization of sequential-parallel search for objects for the model of the distributed Poisson flow of their appearance (Q2289464) (← links)
- Rounds in a combinatorial search problem (Q2309553) (← links)
- On binary search trees (Q2366072) (← links)
- Searching for two counterfeit coins with two-arms balance (Q2576348) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (Q2680178) (← links)
- Disjoint Spread Systems and Fault Location (Q2830441) (← links)
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) (Q2947016) (← links)
- On Maximum Discounted Effort Reward Search Problem (Q3188766) (← links)
- Evacuating an Equilateral Triangle in the Face-to-Face Model (Q3300807) (← links)
- God save the queen (Q3305734) (← links)
- Testing of Hypothesis and Identification (Q3439241) (← links)
- Dynamic Trees with Almost-Optimal Access Cost (Q5009598) (← links)
- Querying with Uncertainty (Q5056054) (← links)
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057) (← links)
- Optimal binary search trees (Q5906917) (← links)
- Byzantine fault tolerant symmetric-persistent circle evacuation (Q5918713) (← links)
- Time-energy tradeoffs for evacuation by two robots in the wireless model (Q5919064) (← links)
- Byzantine fault tolerant symmetric-persistent circle evacuation (Q5925703) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks (Q6042397) (← links)
- Stacking Designs: Designing Multifidelity Computer Experiments with Target Predictive Accuracy (Q6131423) (← links)
- Optimal Sets of Questions for Twenty Questions (Q6141868) (← links)
- Overcoming probabilistic faults in disoriented linear search (Q6148081) (← links)
- Optimal circle search despite the presence of faulty robots (Q6161451) (← links)
- Delivery to safety with two cooperating robots (Q6169542) (← links)
- Algorithms for \(p\)-Faulty Search on a half-line (Q6174824) (← links)