- Retrieval Scheduling For Collaborative Multimedia Presentations \Lambda
- Statistical Analysis of Algorithms: A Case Study of MarketClearing Mechanisms in the
- Efficient and Resilient Backbones for Multihop Wireless Networks Seungjoon Lee Bobby Bhattacharjee Aravind Srinivasan Samir Khuller
- Low Discrepancy Sets Yield Approximate MinWise Independent Permutation Families \Lambda
- Dependent Rounding and its Applications to Approximation Algorithms Rajiv Gandhi y Samir Khuller z Srinivasan Parthasarathy x Aravind Srinivasan {
- Efficient Lookup on Unstructured Topologies Ruggero Morselli, Bobby Bhattacharjee,
- CMSC 858S: Randomized Algorithms Instructions
- Scalable Resilient Media Streaming Suman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind Srinivasan
- An Improved Approximation Algorithm For Vertex Cover with Hard Capacities
- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks
- On the approximability of Clique and related maximization problems ?
- NEW ALGORITHMIC ASPECTS OF THE LOCAL LEMMA WITH APPLICATIONS TO ROUTING AND PARTITIONING #
- Explicit ORDispersers with Polylogarithmic Degree \Lambda Michael Saks y Aravind Srinivasan z Shiyu Zhou x
- Improved Approximation Algorithms for the Partial Vertex Cover Problem
- The Computational Complexity Column Eric Allender
- A Note on the Distribution of the Number of Prime Factors of the Integers
- IMPROVED APPROXIMATION GUARANTEES FOR PACKING AND COVERING INTEGER PROGRAMS \Lambda
- The One-Inclusion Graph Algorithm is Near-Optimal for the Prediction Model of Learning
- Scheduling on Unrelated Machines under TreeLike Precedence Constraints #
- New Approaches to Covering and Packing Problems Aravind Srinivasan
- Approximating the Domatic Number Uriel Feige Magn us M. Halld orsson y Guy Kortsarz z Aravind Srinivasan x
- On k-Column Sparse Packing Programs Nikhil Bansal1
- RANDOMIZED DISTRIBUTED EDGE COLORING VIA AN EXTENSION OF THE CHERNOFFHOEFFDING BOUNDS \Lambda
- COMPUTING WITH VERY WEAK RANDOM SOURCES # ARAVIND SRINIVASAN + AND DAVID ZUCKERMAN #
- Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons
- Approximation Algorithms for Computing Capacity of Wireless Networks with SINR constraints
- Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm
- CMSC 858S: Randomized Algorithms Handout 1: Basic course information
- Approximating LowCongestion Routing and ColumnRestricted Packing Problems
- An Improved Approximation Ratio for the Covering Steiner Anupam Gupta y Aravind Srinivasan z
- CMSC 858S: Randomized Algorithms MidTerm Exam
- Experimental Analysis of Algorithms for BilateralContract Clearing Mechanisms Arising
- : A Protocol for Scalable Anonymous Communication Rob Sherwood Bobby Bhattacharjee Aravind Srinivasan
- CMSC 858S: Randomized Algorithms Handout 2: Basics regarding expectations and the probabilistic method
- CMSC 858S: Randomized Algorithms Handout 4: The Lov asz Local Lemma and Packet Routing
- On the Covering Steiner Problem Anupam Gupta1
- Multicommodity Flow and Circuit Switching Tom Leighton
- Mobile Data Offloading through Opportunistic Communications and Social Participation
- Approximation algorithms for throughput maximization in wireless networks with delay
- Curriculum Vitae Aravind Srinivasan
- EndtoEnd PacketScheduling in Wireless Adhoc Networks V.S. ANIL KUMAR 1 MADHAV V. MARATHE 1 SRINIVASAN PARTHASARATHY 2
- New algorithmic aspects of the Local Lemma with applications to routing and partitioning
- Improved bounds and algorithms for hypergraph twocoloring \Lambda Jaikumar Radhakrishnan y Aravind Srinivasan z
- Improved Bounds on the Sample Complexity of Learning
- CMSC 858S: Randomized Algorithms Due date: Beginning of class on December 7, 2001
- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks
- A Unified Approach to Scheduling on Unrelated Parallel Machines V. S. Anil Kumar
- Maximum Bipartite Flow in Networks with Adaptive Channel Width
- Fast Distributed Algorithms for (Weakly) Connected Dominating Sets
- Improving Recommendation Accuracy by Clustering Social Networks with Trust
- Rigorous probabilistic trust-inference with applications to clustering Thomas DuBois, Jennifer Golbeck, Aravind Srinivasan
- Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
- Cross-Layer Latency Minimization in Wireless Networks with SINR Constraints
- A Client-driven Approach for Channel Management in Wireless LANs Arunesh Mishra1
- Scheduling on Unrelated Machines under Tree-Like Precedence Constraints
- Efficient Lookup on Unstructured Topologies Ruggero Morselli
- Algorithmic Aspects of Capacity in Wireless Networks V.S. Anil Kumar
- Provable Algorithms for Parallel Sweep Scheduling on Unstructured V.S. Anil Kumar 1
- Integrality ratio for Group Steiner Trees and Directed Steiner Trees Eran Halperin
- Finding Large Independent Sets of Hypergraphs in Parallel Hadas Shachnai
- Minimum Weighted Completion Time (1999; Afrati et al.) V.S. Anil Kumar, Virginia Tech
- The discrepancy of permutation families J. H. Spencer
- A New Approximation Technique for Resource-Allocation Problems
- Domatic Partitions and the Lovasz Local Lemma Aravind Srinivasan
- On Random Sampling Auctions for Digital Goods Saeed Alaei
- CostSharing Mechanisms for Network Design Anupam Gupta y Aravind Srinivasan z
- An Improved Approximation Algorithm For Vertex Cover with Hard Capacities
- Contention Resolution with Constant Expected Delay Leslie Ann Goldberg
- CMSC 858S: Randomized Algorithms Handout 5: Pessimistic estimators
- Distributed Ranked Search Vijay Gopalakrishnan 1 , Ruggero Morselli 2 , Bobby Bhattacharjee 3 , Pete Keleher 3 , and
- Improved Algorithms via Approximations of Probability Distributions1
- Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks
- Lower bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance
- Approximation Algorithms for Stochastic and Risk-Averse Optimization Aravind Srinivasan
- Improved Algorithmic Versions of the Lovasz Local Lemma Aravind Srinivasan
- Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
- Randomized Algorithms and Probabilistic Analysis in Wireless Networking
- CMSC 858S: Randomized Algorithms Handout 6: The vertex-connectivity of random graphs
- BETTER APPROXIMATION GUARANTEES FOR JOBSHOP SCHEDULING \Lambda
- FINDING LARGE INDEPENDENT SETS IN GRAPHS AND HYPERGRAPHS
- A CONSTANTFACTOR APPROXIMATION ALGORITHM FOR PACKET ROUTING AND BALANCING LOCAL VS. GLOBAL
- Provable Algorithms for Parallel Generalized Sweep Scheduling #
- CMSC 858S: Randomized Algorithms Handout 3: Facts related to the ChernoffHoeffding bounds
- Structural and Algorithmic Aspects of Massive Social Networks Stephen Eubank V.S. Anil Kumar Madhav V. Marathe Aravind Srinivasan y
- Distributions on levelsets with applications to approximation algorithms Aravind Srinivasan
- An Extension of the Lovasz Local Lemma, and its Applications to Integer Programming
- CostSharing Mechanisms for Network Design Anupam Gupta y Aravind Srinivasan z
- Capacity of Wireless Networks under SINR Interference Constraints
- Predicting Trust and Distrust in Social Networks Thomas DuBois, Jennifer Golbeck, and Aravind Srinivasan
- Optimizing Epidemic Protection for Socially Essential C. Barrett R. Beckman K. Bisset J. Chen S. Eubank V. S. Anil Kumar
- Networking Lessons: From Computers to Water Iyswarya Narayanan, Venkatesh Sarangan, Arunchandar Vasan
