- Approximate Majorization and Fair Online Load Balancing Ashish Goel
- Valiant Load-Balancing in Backbone Networks
- Small Subset Queries and Bloom Filters Using Ternary Associative Memories, with Applications
- An Incentive-Based Architecture for Social Recommendations
- Obtaining High Throughput in Networks with Tiny Buffers Neda Beheshti*, Yashar Ganjali, Ashish Goel, Nick McKeown*
- Price Based Protocols For Fair Resource Allocation: Convergence Time Analysis and Extension to Leontief Utilities
- Dimension Augmentation and Combinatorial Criteria for Efficient Error-resistant DNA Self-assembly
- Asking the right questions: Model-driven Optimization using Probes
- Scale Free Aggregation in Sensor Networks Mihaela Enachescu a,1
- MONOTONE PROPERTIES OF RANDOM GEOMETRIC GRAPHS HAVE SHARP THRESHOLDS
- Optimal Self-Assembly of Counters at Temperature Two
- Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk
- Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs
- An Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
- MS&E 235: Internet Commerce Problem Session 2, April 22, 2009
- MS&E 235: Internet Commerce Problem Set 2, Due Tuesday, April 28, 2008
- Mathematical Programming and Combinatorial Optimization MS&E 212, Spring 2005-2006, Stanford University
- MS&E 319/CS 369X: Topics in Network Algorithms. Winter 2005-06 Course URL: http://www.stanford.edu/~ashishg/network-algorithms.
- Euclidean distortion and the Sparsest Cut [Extended abstract]
- MS&E 235: Internet Commerce Problem Set 3. Due February 28 by 5:00 pm.
- Linear Algebra Linear algebra is about linear systems of equations and their solutions. As a
- Linear Programs A linear program involves optimization (i.e., maximization or minimization)
- Improved Approximation Results for Stochastic Knapsack Problems Anand Bhalgat
- Using Approximate Majorization to Characterize Protocol Fairness Ashish Goel \Lambda
- Incrementally Improving Lookup Latency in Distributed Hash Table Systems
- Towards Protocol Equilibrium with Oblivious Debojyoti Dutta
- MS&E 235: Internet Commerce Problem Set 1, Due April 16, 2009
- Exact Sampling in Machine Scheduling Problems Sungwoo Cho Ashish Goel
- The Design of A Distributed Rating Scheme for Peertopeer Systems
- Efficient Computation of Delaysensitive Routes from One Source to All Destinations
- Stochastic Analysis of Stable Marriages in Combined Input Output Queued Switches
- MS&E 130/231: Information Systems, Autumn 2005-06 Instructor: Ashish Goel
- Error Free Self-Assembly using Error Prone Tiles Ho-Lin Chen
- Algorithms and Incentives for Robust Ranking Rajat Bhattacharjee
- Multi-processor Scheduling to Minimize Flow Time with Resource Augmentation
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Exact Sampling of TCP Window States \Lambda Ashish Goel y
- Scheduling Data Transfers in a Network and the Set Scheduling Problem \Lambda
- Network Flows A wide variety of engineering and management problems involve optimization
- Extending Greedy Multicast Routing to Delay Sensitive Applications
- Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing
- MS&E 111/ENGR 62: Supplementary Notes Ashish Goel
- MS&E 235: Internet Commerce Problem Set 2, Due Tuesday, February 12, 2008 (in class for non-SCPD students)
- Abstract Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the
- Combining Fairness with Throughput: Online Routing with Multiple Objectives
- Journal of Interconnection Networks c World Scientific Publishing Company
- Improving Eigenvector-Based Reputation Systems Against Collusions Hui Zhang Ashish Goel y Ramesh Govindan z Kahn Mason x
- MS&E 235: Internet Commerce Problem Set 4 Solutions
- Stochastic Load Balancing and Related Problems ASHISH GOEL
- Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks
- MS&E 235: Internet Commerce Problem Set 4. Due March 13 by 5:00 pm.
- Given any linear program, there is another related linear program called the dual. In this chapter, we will develop an understanding of the dual linear
- Approximation via Cost Sharing: Simpler and Better Approximation Algorithms for Network Design
- Reductions Among High Dimensional Proximity Ashish Goel \Lambda Piotr Indyk y Kasturi Varadarajan z
- Approximation Algorithms for Directed Steiner Problems \Lambda Moses Charikar y
- On the Network Coding Advantage for Wireless Multicast in Euclidean Space
- Distributed Admission Control, Scheduling, and Routing with Stale Information
- Running Time and Program Size for Selfassembled Squares \Lambda Leonard Adleman y Qi Cheng z Ashish Goel x MingDeh Huang --
- Incrementally Improving Lookup Latency in Distributed Hash Table Hui Zhang # Ashish Goel + Ramesh Govindan #
- Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives
- Mathematical Programming and Combinatorial Optimization Prof. Ashish Goel
- ALGORITHMS FOR NETWORK ROUTING, MULTICASTING, SWITCHING, AND DESIGN
- Advertisement Allocation for Generalized Second Pricing Schemes Ashish Goel
- MS&E 235: Internet Commerce Problem Session 2 Solutions
- Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model Rajat Bhattacharjee
- Reducing Maximum Stretch in Compact Routing Mihaela Enachescu
- ThroughputCompetitive OnLine Routing Baruch Awerbuch \Lambda
- MS&E 111/ENGR 62: Supplementary Notes Ashish Goel
- Self-Assembling Tile Systems that Heal from Small Fragments Stanford University
- Towards Programmable Molecular Machines Ho-Lin Chen
- ENGR62/MS&E111 Autumn 20032004 Prof. Ben Van Roy October 1, 2003
- Combinatorial Optimization Problems in SelfAssembly # Leonard Adleman
- Privacy Violations Using Microtargeted Ads: A Case Study Aleksandra Korolova
- Linear Self-Assemblies: Equilibria, Entropy and Convergence Rates
- Embedding Bounded Bandwidth Graphs into 1 Douglas E. Carroll 1
- Mathematical Programming and Combinatorial Optimization MS&E 212, Spring 2005-2006, Stanford University
- Reducing Facet Nucleation during Algorithmic Self-Assembly
- MS&E 235: Internet Commerce Problem Set 1, Due January 31, 2008
- MS&E 235: Internet Commerce Problem Session 1, April 16, 2009
- Avoiding Ballot Stuffing in eBay-like Reputation Systems Rajat Bhattacharjee
- Pricing for Fairness: Distributed Resource Allocation for Multiple Sung-woo Cho
- SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
- Routers with Very Small Buffers Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, and Tim Roughgarden
- Formulation and Analysis of Linear Programs Benjamin Van Roy and Kahn Mason
- Lecture notes for CME352 Molecular Algorithms. February 3rd. Tile transformations Cellular automator. State transition function, the state of T is a function
- Balaji Prabhakar is an Assistant Professor of Electrical Engineering and Computer Science at Stanford University. He received his Phd from the University of California at Los Angeles in December 1994. He was
- Pricing for Fairness: Distributed Resource Allocation for Multiple Sung-woo Cho
- Counting Triangles and the Curse of the Last Reducer Siddharth Suri Sergei Vassilvitskii
- Personalized Social Recommendations -Accurate or Private?