STOC 2004 - PDF Preprint Papers

STOC 2004 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2004 Paper

click to vote

STOC
2004
ACM

177views Algorithms» more STOC 2004»

Lower bounds for linear degeneracy testing

14 years 11 months ago

Download www.cs.princeton.edu

Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...

Nir Ailon, Bernard Chazelle

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	177	Lower bounds for linear degeneracy testing	claim
2	158	Collective asynchronous reading with polylogarithmic worst-case overhead	claim
3	157	Derandomizing homomorphism testing in general groups	claim
4	153	Bounded-concurrent secure multi-party computation with a dishonest majority	claim
5	153	Quantum and classical query complexities of local search are polynomially related	claim
6	152	Exponential separation of quantum and classical one-way communication complexity	claim
7	150	Typical properties of winners and losers in discrete optimization	claim
8	145	Using mixture models for collaborative filtering	claim
9	142	Lower bounds for local search by quantum arguments	claim
10	138	Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks	claim
11	134	The two possible values of the chromatic number of a random graph	claim
12	134	Better extractors for better codes?	claim
13	134	Approximate max-integral-flow/min-multicut theorems	claim
14	131	(Almost) tight bounds and existence theorems for confluent flows	claim
15	129	Sorting and searching in the presence of memory faults (without redundancy)	claim
16	126	Bypassing the embedding: algorithms for low dimensional metrics	claim
17	124	Rational secret sharing and multiparty computation: extended abstract	claim
18	122	Estimating the weight of metric minimum spanning trees in sublinear-time	claim
19	121	Lower bounds for dynamic connectivity	claim
20	118	Boosted sampling: approximation algorithms for stochastic optimization	claim
21	117	New notions of security: achieving universal composability without trusted setup	claim
22	114	Counting complexity classes for numeric computations II: algebraic and semialgebraic sets	claim
23	110	On sums of independent random variables with unbounded variance, and estimating the average degree in a graph	claim
24	109	Approximating the cut-norm via Grothendieck's inequality	claim
25	107	Primal-dual algorithms for deterministic inventory problems	claim
26	104	Approximation algorithm for k-node connected subgraphs via critical graphs	claim
27	104	Network games	claim
28	103	Multilinear formulas and skepticism of quantum computing	claim
29	102	A simple polynomial-time rescaling algorithm for solving linear programs	claim
30	101	Algorithms for dynamic geometric problems over data streams	claim
31	98	Batch codes and their applications	claim
32	97	Adaptive routing with end-to-end feedback: distributed learning and geometric approaches	claim
33	96	The complexity of pure Nash equilibria	claim
34	94	Sublinear algorithms for testing monotone and unimodal distributions	claim
35	94	Sharp thresholds For monotone properties in random geometric graphs	claim
36	94	Completeness in two-party secure computation: a computational view	claim
37	91	A decentralized algorithm for spectral analysis	claim
38	89	Hit-and-run from a corner	claim
39	89	A new family of Cayley expanders (?)	claim
40	88	Expander flows, geometric embeddings and graph partitioning	claim
41	88	Asymmetric k-center is log* n-hard to approximate	claim
42	88	Dictionary matching and indexing with errors and don't cares	claim
43	87	Approximation algorithms for deadline-TSP and vehicle routing with time-windows	claim
44	86	Using nondeterminism to amplify hardness	claim
45	84	Computing Nash equilibria for scheduling on restricted parallel links	claim
46	78	Robust pcps of proximity, shorter pcps and applications to coding	claim
47	77	Auction algorithms for market equilibrium	claim
48	76	Isotopic implicit surface meshing	claim
49	75	New hardness results for congestion minimization and machine scheduling	claim
50	74	On the performance of greedy algorithms in packet buffering	claim
51	73	Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus	claim
52	71	The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results	claim
53	64	Low distortion maps between point sets	claim
54	61	The zero-one principle for switching networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers