The following pages link to The complexity of parallel search (Q1106664):
Displaying 23 items.
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086) (← links)
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance (Q1270819) (← links)
- Designing algorithms by expectations (Q1328761) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189) (← links)
- On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory (Q1379838) (← links)
- Probabilistic recurrence relations revisited (Q1391296) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
- Optimal detection of a counterfeit coin with multi-arms balances (Q1897358) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- The opacity of backbones (Q2051797) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Searching for two counterfeit coins with two-arms balance (Q2576348) (← links)
- (Q3304157) (← links)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- A deterministic parallel reduction from weighted matroid intersection search to decision (Q6130320) (← links)
