- PRIMAL-DUAL RNC APPROXIMATION ALGORITHMS FOR SET COVER AND COVERING INTEGER PROGRAMS
- Tovnds FedeF IBM Almaden Research
- A local switch Markov chain on given degree graphs with application in connectivity of Peer-to-Peer networks
- Conductance and Congestion in Power Law Graphs Christos Gkantsidis
- AdWords and Generalized On-line Matching Aranyak Mehta Amin Saberi Umesh Vazirani Vijay Vazirani
- 7 proven methods to trick Google into positioning your website
- Pairwise Independence and Derandomization Michael Luby & Avi Wigderson
- Approximating Betweenness Centrality David A. Bader, Shiva Kintali, Kamesh Madduri, and Milena Mihail
- Towards Topology Aware Networks Christos Gkantsidis
- Random Walks in Peer-to-Peer Networks Christos Gkantsidis, Milena Mihail, and Amin Saberi
- On the Complexity of the View-Selection Problem Howard Karloff * Milena Mihail t
- CS174 Lecture 10 John Canny Chernoff Bounds
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
- Embedding Finite Metrics into Tree In this class we will obtain the following embedding result.
- Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
- Random Sampling in Residual Graphs David R. Karger
- The Approximability of NP-hard Problems Sanjeev Arora
- arXiv:cond-mat/0106096v16Jun2001 Statistical Mechanics of Complex Networks
- Percolation Search in Power Law Networks: Making Unstructured Peer-To-Peer Networks Scalable
- CS294-1 Algorithmic Aspects of Game Theory Spring 2001 Lecture 2: January 23
- arXiv:1002.2259v4[cs.DS]9Aug2010 Constructive Algorithms for Discrepancy Minimization
- Learning the Fourier Spectrum of Probabilistic Lists and Trees
- Mathematical results on scalefree random graphs B. Bollobas
- A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems
- conference notes 9 reviews 11 journals 15 gallimaufry 16 O P T I M A
- A Decentralized Algorithm for Spectral Analysis David Kempe
- Estimating Aggregates on a Peer-to-Peer Network MAYANK BAWA, HECTOR GARCIA-MOLINA, ARISTIDES GIONIS, RAJEEV MOTWANI
- arXiv:1008.1687v1[cs.DS]10Aug2010 A Deterministic Polynomial-time Approximation
- Rough Notes on Bansal's Algorithm Joel Spencer
- On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and
- Throughput-Delay Trade-off in Wireless Networks Abbas El Gamal, James Mammen, Balaji Prabhakar, Devavrat Shah
- Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser David Tse
- A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer
- Spectral Analysis of Random Graphs with Skewed Degree Distributions Anirban Dasgupta
- Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric
- Spectral Partitioning of Random Graphs Dept. of Computer Science and Engineering
- The structure and function of complex networks M. E. J. Newman
- Random Walks with Lookahead in Power Law Random Graphs
- George V, George VI, or any other George -Of National Anthems
- U. Penn, 11/13/2008 1 Parallel Thinking*
- The Ellipsoid Algorithm for Linear Programming Lecturer: Sanjeev Arora, COS 521, Fall 2005
- Selection (deterministic & randomized): finding the median in
- Mcnte-earlo AlgOrithIIlS for Enumeration and Reliability Problems
- Doc. Math.J. DMV 657 Semidefinite Programming
- Paxikshit Gopalan" Caching with Expiration Times
- Hybrid Search Schemes for Unstructured Peer-to-Peer Networks
- On the Number of Eulerian Orientations of a Graph Milena MihaiP
- Randomized Algorithms The idea that a process can be "random" is not a modern one; we can trace
- Fastest Mixing Markov Chain on A Graph Stephen Boyd
- Complexity 1 Where Can We Draw The Line?
- Peer-to-Peer Research at Stanford Mayank Bawa, Brian F. Cooper, Arturo Crespo, Neil Daswani,
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- Lecture 1, 08-22-11 CS 2050, Intro Discrete Math for Computer Science
- Lecture 2, 08-24-11 CS 2050, Intro Discrete Math for Computer Science
- Lecture 3, 08-26-11 CS 2050, Intro Discrete Math for Computer Science
- Lecture 9, 09-14-11 CS 2050, Intro Discrete Math for Computer Science
- Lecture 6, 09-02-11 CS 2050, Intro Discrete Math for Computer Science
