Pages that link to "Item:Q2931363"
From MaRDI portal
The following pages link to Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Q2931363):
Displaying 50 items.
- Explicit capacity-achieving list-decodable codes (Q2931364) (← links)
- Gowers uniformity, influence of variables, and PCPs (Q2931365) (← links)
- Sub-constant error low degree test of almost-linear size (Q2931366) (← links)
- The Santa Claus problem (Q2931367) (← links)
- On maximizing welfare when utility functions are subadditive (Q2931368) (← links)
- A randomized polynomial-time simplex algorithm for linear programming (Q2931369) (← links)
- Reducibility among equilibrium problems (Q2931370) (← links)
- The complexity of computing a Nash equilibrium (Q2931371) (← links)
- New trade-offs in cost-sharing mechanisms (Q2931372) (← links)
- The effect of collusion in congestion games (Q2931373) (← links)
- Black-box constructions for secure computation (Q2931374) (← links)
- Information-theoretically secure protocols and security under composition (Q2931375) (← links)
- Private approximation of search problems (Q2931376) (← links)
- Counting independent sets up to the tree threshold (Q2931378) (← links)
- The DLT priority sampling is essentially optimal (Q2931379) (← links)
- Optimal phylogenetic reconstruction (Q2931380) (← links)
- Time-space tradeoffs for implementations of snapshots (Q2931381) (← links)
- Byzantine agreement in the full-information model in O(log n) rounds (Q2931382) (← links)
- Fast leader-election protocols with bounded cheaters' edge (Q2931383) (← links)
- Pricing for fairness (Q2931384) (← links)
- Near-optimal algorithms for unique games (Q2931385) (← links)
- New approximation guarantee for chromatic number (Q2931386) (← links)
- Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (Q2931387) (← links)
- Time-space trade-offs for predecessor search (Q2931388) (← links)
- A combinatorial characterization of the testable graph properties (Q2931390) (← links)
- Graph limits and parameter testing (Q2931391) (← links)
- Zero knowledge with efficient provers (Q2931393) (← links)
- Zero-knowledge against quantum attacks (Q2931394) (← links)
- Local zero knowledge (Q2931395) (← links)
- Building triangulations using ε-nets (Q2931397) (← links)
- Conditional hardness for approximate coloring (Q2931398) (← links)
- Clique-width minimization is NP-hard (Q2931399) (← links)
- Can every randomized algorithm be derandomized? (Q2931400) (← links)
- Finding small balanced separators (Q2931401) (← links)
- Linear time low tree-width partitions and algorithmic consequences (Q2931403) (← links)
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs (Q2931404) (← links)
- Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures (Q2931405) (← links)
- On the fourier tails of bounded functions over the discrete cube (Q2931406) (← links)
- Lattice problems and norm embeddings (Q2931407) (← links)
- Pseudorandom walks on regular digraphs and the RL vs. L problem (Q2931408) (← links)
- An efficient algorithm for solving word equations (Q2931409) (← links)
- Online trading algorithms and robust option pricing (Q2931410) (← links)
- On adequate performance measures for paging (Q2931411) (← links)
- Extractors for a constant number of polynomially small min-entropy independent sources (Q2931412) (← links)
- Narrow proofs may be spacious (Q2931413) (← links)
- Logarithmic hardness of the directed congestion minimization problem (Q2931414) (← links)
- Hardness of cut problems in directed graphs (Q2931415) (← links)
- Integrality gaps for sparsest cut and minimum linear arrangement problems (Q2931416) (← links)
- On earthmover distance, metric labeling, and 0-extension (Q2931417) (← links)
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform (Q2931418) (← links)
