• Publications
  • Influence
Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications
TLDR
We have obtaincd some results in pebble coordination problems and the diameter of permutation groups. Expand
  • 231
  • 44
  • PDF
An Optimization Approach for Approximate Nash Equilibria
TLDR
In this paper we propose a new methodology for determining approximate Nash equilibria of non-cooperative bimatrix games and, based on that, we provide an efficient algorithm that computes 0.3393- approximate Equilibria, the best approximation till now. Expand
  • 143
  • 21
Weighted random sampling with a reservoir
TLDR
In this work, a new algorithm for drawing a weighted random sample from a population of n weighted items, where m ≤ n, is presented. Expand
  • 206
  • 20
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
TLDR
We study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. Expand
  • 273
  • 14
  • PDF
Space Efficient Hash Tables with Worst Case Constant Access Time
TLDR
We generalize Cuckoo Hashing to d-ary Cuckroo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 + ε)n memory cells, for any constant ε > 0. Expand
  • 121
  • 13
  • PDF
Selfish Unsplittable Flows
  • 89
  • 11
BSP vs LogP
TLDR
BSP and LogP can be viewed as closely related variants within the bandwidth-latency framework for modeling parallel computation. Expand
  • 84
  • 11
Selfish unsplittable flows
TLDR
We generalize the model of Koutsoupias and Papadimitriou to weighted congestion games. Expand
  • 158
  • 9
  • PDF
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture
TLDR
The classical occupancy problem is concerned with studying the number of empty bins resulting from a random allocation of m balls to n bins. Expand
  • 116
  • 8
  • PDF
Space Efficient Hash Tables with Worst Case Constant Access Time
TLDR
We generalize Cuckoo Hashing to d-ary hashing and show how this yields a simple dictionary that has worst case constant access time and expected constant update time, works with (1+?) n space, and supports satellite information. Expand
  • 76
  • 8