FOCS 2000 - PDF Preprint Papers

FOCS 2000 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2000 Paper

click to vote

FOCS
2000
IEEE

173views Theoretical Computer Science» more FOCS 2000»

Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation

14 years 3 months ago

Download www.madalgo.au.dk

In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...

Piotr Indyk

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	173	Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation	claim
2	173	Extracting Randomness from Samplable Distributions	claim
3	149	Clustering Data Streams	claim
4	149	Approximating the single source unsplittable min-cost flow problem	claim
5	143	A polylogarithmic approximation of the minimum bisection	claim
6	123	Cache-Oblivious B-Trees	claim
7	116	Opportunistic Data Structures with Applications	claim
8	109	The Common Fragment of CTL and LTL	claim
9	108	On the Hardness of Graph Isomorphism	claim
10	107	Hierarchical Placement and Network Design Problems	claim
11	105	Zaps and Their Applications	claim
12	105	Computing the Determinant and Smith Form of an Integer Matrix	claim
13	104	Extracting Randomness via Repeated Condensing	claim
14	102	On the boundary complexity of the union of fat triangles	claim
15	101	Nearly Optimal Expected-Case Planar Point Location	claim
16	99	Optimal myopic algorithms for random 3-SAT	claim
17	99	Private Quantum Channels	claim
18	97	Polynomial Time Approximation Schemes for Geometric k-Clustering	claim
19	93	The Randomness Recycler: A New Technique for Perfect Sampling	claim
20	93	Fairness Measures for Resource Allocation	claim
21	92	On Clusterings - Good, Bad and Spectral	claim
22	92	Efficient Algorithms for Universal Portfolios	claim
23	91	Topological Persistence and Simplification	claim
24	90	Hardness of Approximate Hypergraph Coloring	claim
25	89	Nested Graph Dissection and Approximation Algorithms	claim
26	89	How Bad is Selfish Routing?	claim
27	88	Optimization Problems in Congestion Control	claim
28	88	Cost-Distance: Two Metric Network Design	claim
29	86	Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors	claim
30	84	Succinct quantum proofs for properties of finite groups	claim
31	83	Linear Waste of Best Fit Bin Packing on Skewed Distributions	claim
32	82	New Data Structures for Orthogonal Range Searching	claim
33	82	Detecting a Network Failure	claim
34	82	The Online Median Problem	claim
35	81	Fast parallel circuits for the quantum Fourier transform	claim
36	76	The Cover Time, the Blanket Time, and the Matthews Bound	claim
37	72	Pseudorandom Generators in Propositional Proof Complexity	claim
38	69	Universality and Tolerance	claim
39	68	Testing that distributions are close	claim
40	67	Randomized Rumor Spreading	claim
41	67	Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method	claim
42	64	"Soft-decision" Decoding of Chinese Remainder Codes	claim
43	62	Random graph models for the web graph	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers