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 42 items.
- Random sampling and approximation of MAX-CSP problems (Q3579226) (← links)
- Approximate clustering via core-sets (Q3579227) (← links)
- Cache-oblivious priority queue and graph algorithm applications (Q3579229) (← links)
- Average case analysis for batched disk scheduling and increasing subsequences (Q3579230) (← links)
- Selfish traffic allocation for server farms (Q3579231) (← links)
- Approximation schemes for preemptive weighted flow time (Q3579232) (← links)
- Approximation algorithms for minimum-cost k-vertex connected subgraphs (Q3579233) (← links)
- Approximate counting of inversions in a data stream (Q3579234) (← links)
- Similarity estimation techniques from rounding algorithms (Q3579235) (← links)
- Fast, small-space algorithms for approximate histogram maintenance (Q3579236) (← links)
- Stability of load balancing algorithms in dynamic adversarial systems (Q3579237) (← links)
- Tradeoffs in probabilistic packet marking for IP traceback (Q3579238) (← links)
- Crawling on web graphs (Q3579239) (← links)
- Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem (Q3579240) (← links)
- The invasiveness of off-line memory checking (Q3579241) (← links)
- On the composition of authenticated byzantine agreement (Q3579242) (← links)
- Wait-free consensus with infinite arrivals (Q3579245) (← links)
- Meldable heaps and boolean union-find (Q3579246) (← links)
- Verifying candidate matches in sparse and wildcard matching (Q3579248) (← links)
- Deterministic sorting in <i>O</i> ( <i>n</i> log log <i>n</i> ) time and linear space (Q3579249) (← links)
- Randomness conductors and constant-degree lossless expanders (Q3579250) (← links)
- Expanders from symmetric codes (Q3579251) (← links)
- Space-efficient approximate Voronoi diagrams (Q3579252) (← links)
- Finding nearest neighbors in growth-restricted metrics (Q3579253) (← links)
- Huffman coding with unequal letter costs (Q3579254) (← links)
- Solving convex programs by random walks (Q5901042) (← links)
- Almost all graphs with average degree 4 are 3-colorable (Q5901043) (← links)
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem (Q5901044) (← links)
- Recognizing string graphs in NP (Q5901045) (← links)
- Fitting algebraic curves to noisy data (Q5901046) (← links)
- On paging with locality of reference (Q5901047) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5901048) (← links)
- Hardness amplification within NP (Q5901049) (← links)
- On the advantage over a random assignment (Q5901050) (← links)
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (Q5901051) (← links)
- A new average case analysis for completion time scheduling (Q5901052) (← links)
- Optimal rate-based scheduling on multiprocessors (Q5901053) (← links)
- Clifford algebras and approximating the permanent (Q5901054) (← links)
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5901055) (← links)
- The price of anarchy is independent of the network topology (Q5901056) (← links)
- Optimal finger search trees in the pointer machine (Q5901057) (← links)
- Pseudo-random generators for all hardnesses (Q5901058) (← links)
