FOCS 2006 - PDF Preprint Papers

FOCS 2006 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2006 Paper

click to vote

FOCS
2006
IEEE

330views Theoretical Computer Science» more FOCS 2006»

Local Graph Partitioning using PageRank Vectors

13 years 10 months ago

Download www.math.ucsd.edu

A local graph partitioning algorithm ﬁnds a cut near a speciﬁed starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...

Reid Andersen, Fan R. K. Chung, Kevin J. Lang

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	330	Local Graph Partitioning using PageRank Vectors	claim
2	194	Improved approximation algorithms for multidimensional bin packing problems	claim
3	192	Dispersion of Mass and the Complexity of Randomized Geometric Algorithms	claim
4	186	Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs	claim
5	181	Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders	claim
6	176	Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions	claim
7	167	Computing Nash Equilibria: Approximation and Smoothed Complexity	claim
8	164	Algorithms on negatively curved spaces	claim
9	156	Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e	claim
10	148	Higher Lower Bounds for Near-Neighbor and Further Rich Problems	claim
11	147	On the time complexity of 2-tag systems and small universal Turing machines	claim
12	146	The Effectiveness of Lloyd-Type Methods for the k-Means Problem	claim
13	146	Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design	claim
14	144	A simple condition implying rapid mixing of single-site dynamics on spin systems	claim
15	144	Minimum Bounded Degree Spanning Trees	claim
16	142	On the Compressibility of NP Instances and Cryptographic Applications	claim
17	142	On a Geometric Generalization of the Upper Bound Theorem	claim
18	140	Inclusion--Exclusion Algorithms for Counting Set Partitions	claim
19	138	Ramsey partitions and proximity data structures	claim
20	136	Planar Earthmover is not in L_1	claim
21	134	Witnesses for non-satisfiability of dense random 3CNF formulas	claim
22	132	Algebraic Structures and Algorithms for Matching and Matroid Problems	claim
23	132	Concurrent Non-Malleable Zero Knowledge	claim
24	132	Strategic Network Formation through Peering and Service Agreements	claim
25	129	Towards Secure and Scalable Computation in Peer-to-Peer Networks	claim
26	129	Improved Approximation Algorithms for Large Matrices via Random Projections	claim
27	128	A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks	claim
28	127	Cryptography from Anonymity	claim
29	125	How to Play Unique Games Using Embeddings	claim
30	125	Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach	claim
31	123	New Limits on Fault-Tolerant Quantum Computation	claim
32	123	Lower Bounds for Additive Spanners, Emulators, and More	claim
33	122	Input-Indistinguishable Computation	claim
34	122	Fault-Tolerant Distributed Computing in Full-Information Networks	claim
35	121	New Results for Learning Noisy Parities and Halfspaces	claim
36	121	On the Optimality of the Dimensionality Reduction Method	claim
37	119	Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification	claim
38	118	Improved Dynamic Planar Point Location	claim
39	118	The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels	claim
40	118	Cryptographic Hardness for Learning Intersections of Halfspaces	claim
41	117	Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization	claim
42	116	Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority	claim
43	116	Explicit Exclusive Set Systems with Applications to Broadcast Encryption	claim
44	115	Better lossless condensers through derandomized curve samplers	claim
45	115	Hardness of Learning Halfspaces with Noise	claim
46	114	On the Impact of Combinatorial Structure on Congestion Games	claim
47	113	Balanced Allocations of Cake	claim
48	111	Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP	claim
49	110	Lp metrics on the Heisenberg group and the Goemans-Linial conjecture	claim
50	110	Index Coding with Side Information	claim
51	107	Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths	claim
52	104	On the Quantum Query Complexity of Local Search in Two and Three Dimensions	claim
53	103	Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body	claim
54	102	Statistical Zero-Knowledge Arguments for NP from Any One-Way Function	claim
55	101	Postselection threshold against biased noise	claim
56	100	Points on Computable Curves	claim
57	99	Planar Point Location in Sublogarithmic Time	claim
58	98	Subspace Polynomials and List Decoding of Reed-Solomon Codes	claim
59	83	Lower bounds for circuits with MOD_m gates	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers