Pages that link to "Item:Q5419068"

The following pages link to Proceedings of the forty-third annual ACM symposium on Theory of computing (Q5419068):

Displaying 50 items.

• Schaefer's Theorem for Graphs (Q2796406) (← links)
• Privately Releasing Conjunctions and the Statistical Query Barrier (Q2862200) (← links)
• Strong Direct Product Theorems for Quantum Communication and Query Complexity (Q4907578) (← links)
• Pareto Optimal Solutions for Smoothed Analysts (Q4907582) (← links)
• An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance (Q4907584) (← links)
• Santa Claus Schedules Jobs on Unrelated Machines (Q4907585) (← links)
• The Power of Simple Tabulation Hashing (Q5395685) (← links)
• Tight bounds for parallel randomized load balancing (Q5419070) (← links)
• Social networks spread rumors in sublogarithmic time (Q5419071) (← links)
• Quantum one-way communication can be exponentially stronger than classical communication (Q5419072) (← links)
• Cover times, blanket times, and majorizing measures (Q5419075) (← links)
• A general framework for graph sparsification (Q5419076) (← links)
• Breaking o(n ^1/2 )-approximation algorithms for the edge-disjoint paths problem with congestion two (Q5419077) (← links)
• The equivalence of the random oracle model and the ideal cipher model, revisited (Q5419078) (← links)
• Separating succinct non-interactive arguments from all falsifiable assumptions (Q5419079) (← links)
• Limits of provable security from standard assumptions (Q5419080) (← links)
• On optimal single-item auctions (Q5419081) (← links)
• Optimal auctions with correlated bidders are easy (Q5419082) (← links)
• An impossibility result for truthful combinatorial auctions with submodular valuations (Q5419083) (← links)
• From convex optimization to randomized mechanisms (Q5419084) (← links)
• Towards coding for maximum errors in interactive communication (Q5419085) (← links)
• High-rate codes with sublinear-time decoding (Q5419086) (← links)
• From affine to two-source extractors via approximate duality (Q5419087) (← links)
• Correlation testing for affine invariant properties on F _p ⁿ in the high error regime (Q5419088) (← links)
• Rank-1 bimatrix games (Q5419089) (← links)
• Exact algorithms for solving stochastic games (Q5419090) (← links)
• Dueling algorithms (Q5419091) (← links)
• Moser and tardos meet Lovász (Q5419093) (← links)
• A full derandomization of schöning's k-SAT algorithm (Q5419094) (← links)
• Pseudorandom generators for combinatorial shapes (Q5419095) (← links)
• Pseudorandom generators for group products (Q5419096) (← links)
• Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (Q5419097) (← links)
• Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (Q5419098) (← links)
• Analyzing network coding gossip made easy (Q5419099) (← links)
• An algorithm for the graph crossing number problem (Q5419100) (← links)
• Improved algorithms for min cut and max flow in undirected planar graphs (Q5419101) (← links)
• Directed spanners via flow-based linear programs (Q5419102) (← links)
• The computational complexity of linear optics (Q5419103) (← links)
• A quasipolynomial-time algorithm for the quantum separability problem (Q5419104) (← links)
• Parallel repetition of entangled games (Q5419105) (← links)
• Distributed verification and hardness of distributed approximation (Q5419106) (← links)
• Linearizable implementations do not suffice for randomized distributed computation (Q5419107) (← links)
• The topology of wireless communication (Q5419108) (← links)
• Optimal path search in small worlds (Q5419109) (← links)
• An LLL-reduction algorithm with quasi-linear time complexity (Q5419110) (← links)
• NP-hardness of approximately solving linear equations over reals (Q5419111) (← links)
• Black-box identity testing of depth-4 multilinear circuits (Q5419112) (← links)
• Blackbox identity testing for bounded top fanin depth-3 circuits (Q5419113) (← links)
• Contraction decomposition in h-minor-free graphs and algorithmic applications (Q5419114) (← links)
• A simpler algorithm and shorter proof for the graph minor decomposition (Q5419115) (← links)