#### Filter Results:

- Full text PDF available (287)

#### Publication Year

1980

2017

- This year (15)
- Last 5 years (65)
- Last 10 years (188)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Daniel Kornhauser, Gary L. Miller, Paul G. Spirakis
- FOCS
- 1984

- Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis
- Theor. Comput. Sci.
- 2004

What is the price of anarchy when unsplittable demands are routed selfishly in general networks with load-dependent edge delays? Motivated by this question we generalize the model of [14] to the case of weighted congestion games. We show that varying demands of users crucially affect the nature of these games, which are no longer isomorphic to exact… (More)

- Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis
- Theory of Computing Systems
- 2003

We generalize Cuckoo Hashing to d-ary Cuckoo 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. Assuming uniform hashing, accessing or deleting table entries takes at most d=O (ln (1/ε)) probes and the expected amortized insertion time is constant. This is the first… (More)

- Marios Mavronicolas, Paul G. Spirakis
- Algorithmica
- 2001

We study the problem of <italic>routing</italic> traffic through a congested network. We focus on the simplest case of a network consisting of <italic>m</italic> parallel <italic>links</italic>. We assume a collection of <italic>n</italic> network <italic>users</italic>, each employing a <italic>mixed strategy</italic> which is a probability distribution… (More)

- Haralampos Tsaknakis, Paul G. Spirakis
- WINE
- 2007

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. The methodology is based on the formulation of an appropriate function of pairs of mixed strategies… (More)

- Pavlos S. Efraimidis, Paul G. Spirakis
- Inf. Process. Lett.
- 2006

- Zvi M. Kedem, Krishna V. Palem, Paul G. Spirakis
- STOC
- 1990

A parallel computing system becomes increasingly prone to failure as the number of processing elements in it increases. In this paper, we describe a completely general strategy that takes an arbitrary step of an ideal CRCW PRAM and automatically translates it to run e ciently and robustly on a PRAM in which processors are prone to failure. The strategy… (More)

The classical occupancy problem is concerned with studying the number of empty bins resulting from a random allocation of m balls to n bins. We provide a series of tail bounds on the distribution of the number of empty bins. These tail bounds should find application in randomized algorithms and probabilistic analysis. Our motivating application is the… (More)

We present a general and efficient strategy for computing mtustly on unreliable parallel machines. The model of a parallel machine that we use is a CRCW PRAM with dynamic resource fluctuations: processors can fail during the computation, and may possibly bc restored later. We first introduce the notions of dejinite and tentatitie algorithms for executing a… (More)

In this work, 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. We assume a collection of n users, each employing a mixed strategy, which is a probability distribution over links, to control the routing of its own assigned… (More)