Pages that link to "Item:Q3579173"
From MaRDI portal
The following pages link to Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Q3579173):
Displaying 50 items.
- Combinatorial optimization problems in self-assembly (Q3579174) (← links)
- Random sampling in residual graphs (Q3579176) (← links)
- On the complexity of equilibria (Q3579177) (← links)
- Competitive generalized auctions (Q3579178) (← links)
- Competitive recommendation systems (Q3579179) (← links)
- The Glauber dynamics on colourings of a graph with high girth and maximum degree (Q3579180) (← links)
- Clairvoyant scheduling of random walks (Q3579181) (← links)
- Near-optimal sparse fourier representations via sampling (Q3579182) (← links)
- Equitable cost allocations via primal-dual-type algorithms (Q3579183) (← links)
- Tight security proofs for the bounded-storage model (Q3579184) (← links)
- An exponential separation between regular and general resolution (Q3579185) (← links)
- Size space tradeoffs for resolution (Q3579186) (← links)
- Universally composable two-party and multi-party secure computation (Q3579187) (← links)
- Resolution lower bounds for the weak pigeonhole principle (Q3579188) (← links)
- Hard examples for bounded depth frege (Q3579189) (← links)
- Improved cryptographic hash functions with worst-case/average-case connection (Q3579190) (← links)
- Secure multi-party quantum computation (Q3579191) (← links)
- The complexity of approximating entropy (Q3579192) (← links)
- On communication over an entanglement-assisted quantum channel (Q3579193) (← links)
- Girth and euclidean distortion (Q3579194) (← links)
- A new greedy approach for facility location problems (Q3579195) (← links)
- Limits to list decodability of linear codes (Q3579196) (← links)
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets (Q3579197) (← links)
- New results on monotone dualization and generating hypergraph transversals (Q3579198) (← links)
- The importance of being biased (Q3579199) (← links)
- The Joy of Theory (Q3579200) (← links)
- Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines (Q3579201) (← links)
- On randomized online scheduling (Q3579202) (← links)
- On the complexity of matrix product (Q3579203) (← links)
- Reimer's inequality and tardos' conjecture (Q3579204) (← links)
- 2-round zero knowledge and proof auditors (Q3579205) (← links)
- Concurrent zero-knowledge with timing, revisited (Q3579206) (← links)
- Hardness results for approximate hypergraph coloring (Q3579207) (← links)
- Space lower bounds for distance approximation in the data stream model (Q3579208) (← links)
- Monotonicity testing over general poset domains (Q3579209) (← links)
- Strict polynomial-time in simulation and extraction (Q3579210) (← links)
- Relations between average case complexity and approximation complexity (Q3579211) (← links)
- Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε (Q3579212) (← links)
- Algorithmic derandomization via complexity theory (Q3579213) (← links)
- Quantum lower bound for the collision problem (Q3579214) (← links)
- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems (Q3579215) (← links)
- Computing the betti numbers of arrangements (Q3579216) (← links)
- 3-manifold knot genus is NP-complete (Q3579217) (← links)
- On the power of unique 2-prover 1-round games (Q3579218) (← links)
- Learnability beyond AC <sup>0</sup> (Q3579219) (← links)
- Approximating the smallest grammar (Q3579221) (← links)
- Dynamic subgraph connectivity with geometric applications (Q3579222) (← links)
- The complexity of choosing an <i>H</i> -colouring (nearly) uniformly at random (Q3579223) (← links)
- A unified analysis of hot video schedulers (Q3579224) (← links)
- Models and thresholds for random constraint satisfaction problems (Q3579225) (← links)
