STOC 2001 - PDF Preprint Papers

STOC 2001 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2001 Paper

click to vote

STOC
2001
ACM

317views Algorithms» more STOC 2001»

Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time

14 years 11 months ago

Download page.mi.fu-berlin.de

Daniel A. Spielman, Shang-Hua Teng

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	317	Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time	claim
2	198	Almost optimal permutation routing on hypercubes	claim
3	163	Extractor codes	claim
4	161	A sharp threshold in proof complexity	claim
5	161	Quantitative solution of omega-regular games	claim
6	160	A sieve algorithm for the shortest lattice vector problem	claim
7	159	Optimal static range reporting in one dimension	claim
8	153	Applications of approximation algorithms to cooperative games	claim
9	151	Buffer overflow management in QoS switches	claim
10	151	On the cell probe complexity of membership and perfect hashing	claim
11	147	Conditions on input vectors for consensus solvability in asynchronous distributed systems	claim
12	144	Decidability of string graphs	claim
13	143	Computing crossing numbers in quadratic time	claim
14	140	Compatible sequences and a slow Winkler percolation	claim
15	139	Approximate distance oracles	claim
16	138	Fast computation of low rank matrix	claim
17	137	Computing with continuous-time Liapunov systems	claim
18	134	Data-streams and histograms	claim
19	134	Fully-dynamic min-cut	claim
20	133	Quantum mechanical algorithms for the nonabelian hidden subgroup problem	claim
21	133	Loss-less condensers, unbalanced expanders, and extractors	claim
22	132	Edge isoperimetry and rapid mixing on matroids and geometric Markov chains	claim
23	131	Profit-earning facility location	claim
24	129	Interaction in quantum communication and the complexity of set disjointness	claim
25	123	On optimal slicing of parallel programs	claim
26	122	One-dimensional quantum walks	claim
27	122	When is the evaluation of conjunctive queries tractable?	claim
28	122	Provisioning a virtual private network: a network design problem for multicommodity flow	claim
29	119	Complex tilings	claim
30	119	Private approximation of NP-hard functions	claim
31	119	Algorithms, games, and the internet	claim
32	117	Biased dictionaries with fast insert/deletes	claim
33	116	One line and n points	claim
34	116	Regular resolution lower bounds for the weak pigeonhole principle	claim
35	115	Running time and program size for self-assembled squares	claim
36	114	Dynamic TCP acknowledgement and other stories about e/(e-1)	claim
37	114	Testing metric properties	claim
38	114	Quantum computers that can be simulated classically in polynomial time	claim
39	111	Optimal outlier removal in high-dimensional	claim
40	109	Stackelberg scheduling strategies	claim
41	108	Quantum algorithms for solvable groups	claim
42	104	Spatial gossip and resource location protocols	claim
43	103	The price of selfish routing	claim
44	97	Sharp threshold and scaling window for the integer partitioning problem	claim
45	97	Online server allocation in a server farm via benefit task systems	claim
46	94	Spectral analysis of data	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers