Pages that link to "Item:Q2819528"
From MaRDI portal
The following pages link to Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Q2819528):
Displayed 50 items.
- A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) (Q2819529) (← links)
- A polynomial combinatorial algorithm for generalized minimum cost flow (Q2819530) (← links)
- PCP characterizations of NP (Q2819531) (← links)
- Fast approximate PCPs (Q2819532) (← links)
- Approximate testing with relative error (Q2819533) (← links)
- All pairs lightest shortest paths (Q2819534) (← links)
- Unique maximum matching algorithms (Q2819535) (← links)
- Improved upper bounds on information-theoretic private information retrieval (extended abstract) (Q2819536) (← links)
- One-way functions are essential for single-server private information retrieval (Q2819537) (← links)
- On targeting Markov segments (Q2819538) (← links)
- Exploiting regularities in Web traffic patterns for cache replacement (Q2819539) (← links)
- Optimal buy-and-hold strategies for financial markets with bounded daily returns (Q2819540) (← links)
- Algorithmic mechanism design (extended abstract) (Q2819541) (← links)
- Construction of extractors using pseudo-random generators (extended abstract) (Q2819542) (← links)
- On recycling the randomness of states in space bounded computation (Q2819543) (← links)
- Security-preserving hardness-amplification for any regular one-way function (Q2819544) (← links)
- Scheduling data transfers in a network and the set scheduling problem (Q2819545) (← links)
- Minimizing the flow time without migration (Q2819546) (← links)
- Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks (Q2819547) (← links)
- From static to dynamic routing (Q2819548) (← links)
- Chinese remaindering with errors (Q2819549) (← links)
- A displacement approach to efficient decoding of algebraic-geometric codes (Q2819550) (← links)
- Oblivious transfer and polynomial evaluation (Q2819551) (← links)
- Secure computation with honest-looking parties (extended abstract) (Q2819552) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) (Q2819553) (← links)
- Lifting Markov chains to speed up mixing (Q2819554) (← links)
- Faster mixing via average conductance (Q2819555) (← links)
- Majorizing estimators and the approximation of #P-complete problems (Q2819556) (← links)
- Optimal bounds for the predecessor problem (Q2819557) (← links)
- A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube (Q2819559) (← links)
- Lower bounds for high dimensional nearest neighbor search and related problems (Q2819560) (← links)
- Molecular scale heat engines and scalable quantum computation (Q2819561) (← links)
- Quantum Fourier sampling simplified (Q2819563) (← links)
- Lower bounds for leader election and collective coin-flipping in the perfect information model (Q2819564) (← links)
- A theorem on sensitivity and applications in private computation (Q2819565) (← links)
- Exponential separation of quantum and classical communication complexity (Q2819566) (← links)
- Undecidability on quantum finite automata (Q2819568) (← links)
- Dense quantum coding and a lower bound for 1-way quantum automata (Q2819570) (← links)
- The quantum query complexity of approximating the median and related statistics (Q2819571) (← links)
- Makespan minimization in job shops (Q2819572) (← links)
- A PTAS for minimizing the weighted sum of job completion times on parallel machines (Q2819573) (← links)
- Improved approximation schemes for scheduling unrelated parallel machines (Q2819574) (← links)
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) (Q2819575) (← links)
- Sublinear time algorithms for metric space problems (Q2819576) (← links)
- Covering rectilinear polygons with axis-parallel rectangles (Q2819577) (← links)
- Compact grid layouts of multi-level networks (Q2819578) (← links)
- Complexity of graph partition problems (Q2819579) (← links)
- Finding similar regions in many strings (Q2819580) (← links)
- Multi-method dispatching (Q2819581) (← links)
- Worst-case and amortised optimality in union-find (extended abstract) (Q2819582) (← links)