The following pages link to (Q294722):
Displaying 50 items.
- (Q172552) (redirect page) (← links)
- Finding OR in a noisy broadcast network (Q294723) (← links)
- On fair division of a homogeneous good (Q485780) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Buffer management for colored packets with deadlines (Q693758) (← links)
- The ordered covering problem (Q722532) (← links)
- A new approach to fair distribution of welfare (Q776237) (← links)
- An improved approximation ratio for the minimum linear arrangement problem (Q845884) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- On the complexity of finding balanced oneway cuts (Q1014383) (← links)
- On the hardness of approximating max-satisfy (Q1045886) (← links)
- Zero-knowledge proofs of identity (Q1112785) (← links)
- Multi-oracle interactive protocols with constant space verifiers (Q1190986) (← links)
- On the complexity of finite random functions (Q1209362) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- A fast randomized LOGSPACE algorithm for graph connectivity (Q1349893) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- A spectrum of time-space trade-offs for undirected \(s-t\) connectivity (Q1356886) (← links)
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
- Collecting coupons on trees, and the cover time of random walks (Q1386177) (← links)
- Error reduction by parallel repetition - a negative result (Q1397480) (← links)
- On the cost of recomputing: Tight bounds on pebbling with faults (Q1575959) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- A note on approximating Max-Bisection on regular graphs (Q1603473) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Contagious sets in random graphs (Q1688015) (← links)
- On cutting a few vertices from a graph (Q1811082) (← links)
- Derandomized graph products (Q1842777) (← links)
- On the drift of short schedules. (Q1853539) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Approximating min sum set cover (Q1884768) (← links)
- PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
- A tight negative example for MMS fair allocations (Q2152130) (← links)
- Target set selection for conservative populations (Q2235265) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- Approximating the bandwidth of caterpillars (Q2391175) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- Improved approximation of the minimum cover time (Q2566000) (← links)
- (Q2721963) (← links)
- (Q2753732) (← links)
- Approximation Algorithms for Maximization Problems Arising in Graph Partitioning (Q2775885) (← links)
- A Polylogarithmic Approximation of the Minimum Bisection (Q2784494) (← links)
- On giant components and treewidth in the layers model (Q2811162) (← links)
- Two prover protocols (Q2817609) (← links)
- A minimal model for secure computation (extended abstract) (Q2817650) (← links)
- Nonmonotonic phenomena in packet routing (Q2819590) (← links)
- Universal Factor Graphs (Q2843260) (← links)
- Connectivity of Random High Dimensional Geometric Graphs (Q2851881) (← links)
- Detecting high log-densities (Q2875146) (← links)
