Information Processing Letters 37 (1991) 233236 NorthHolland Maria Sera Department of Applied Mat... more Information Processing Letters 37 (1991) 233236 NorthHolland Maria Sera Department of Applied Mathematics 1 and Department of Languages and Informatic Systems, Polytechnic University of Catatonia, Av. Par. Gregorio Maranon sn, 08028 Barcelona, Spain Communicated by ...
We study universal stability of directed and undirected graphs in the adversarial queuing model f... more We study universal stability of directed and undirected graphs in the adversarial queuing model for static packet routing. In this setting, packets are injected in some edge and have to traverse a predefined path before leaving the system. Restrictions on the allowed packet trajectory ...
Proceedings of the fourteenth annual …, Jan 1, 2002
ABSTRACT In this paper we study the universal stability of undirected graphs in the adversarial q... more ABSTRACT In this paper we study the universal stability of undirected graphs in the adversarial queueing model for packet routing. In this setting, packets must be injected in some edge and have to traverse a path before leaving the system. Restric-tions on the allowed types of ...
We examine here the existence of approximations in NC of P-complete problems. We show that many P... more We examine here the existence of approximations in NC of P-complete problems. We show that many P-complete problems (such as UNIT, PATH, circuit value etc.) cannot have an approximating solution in NC for any value of the absolute performance ratio R of the approximation, ...
Mathematical Foundations of Computer …, Jan 1, 2005
Abstract. We study the computational complexity of deciding the ex-istence of a Pure Nash Equilib... more Abstract. We study the computational complexity of deciding the ex-istence of a Pure Nash Equilibrium in multi-player strategic games. We address two fundamental questions: how can we represent a game? and how can we represent a game with polynomial pay-off functions? Our re- ...
Handbook on Randomized Computing, volume II …, Jan 1, 2001
CiteSeerX - Document Details (Isaac Councill, Lee Giles): Introduction Worst case analysis of an ... more CiteSeerX - Document Details (Isaac Councill, Lee Giles): Introduction Worst case analysis of an algorithm gives information on hard instances that may not be representative of its real behavior on the data of interest. In such situations, the analysis of its average behavior may give ...
Information Processing Letters 37 (1991) 233236 NorthHolland Maria Sera Department of Applied Mat... more Information Processing Letters 37 (1991) 233236 NorthHolland Maria Sera Department of Applied Mathematics 1 and Department of Languages and Informatic Systems, Polytechnic University of Catatonia, Av. Par. Gregorio Maranon sn, 08028 Barcelona, Spain Communicated by ...
We study universal stability of directed and undirected graphs in the adversarial queuing model f... more We study universal stability of directed and undirected graphs in the adversarial queuing model for static packet routing. In this setting, packets are injected in some edge and have to traverse a predefined path before leaving the system. Restrictions on the allowed packet trajectory ...
Proceedings of the fourteenth annual …, Jan 1, 2002
ABSTRACT In this paper we study the universal stability of undirected graphs in the adversarial q... more ABSTRACT In this paper we study the universal stability of undirected graphs in the adversarial queueing model for packet routing. In this setting, packets must be injected in some edge and have to traverse a path before leaving the system. Restric-tions on the allowed types of ...
We examine here the existence of approximations in NC of P-complete problems. We show that many P... more We examine here the existence of approximations in NC of P-complete problems. We show that many P-complete problems (such as UNIT, PATH, circuit value etc.) cannot have an approximating solution in NC for any value of the absolute performance ratio R of the approximation, ...
Mathematical Foundations of Computer …, Jan 1, 2005
Abstract. We study the computational complexity of deciding the ex-istence of a Pure Nash Equilib... more Abstract. We study the computational complexity of deciding the ex-istence of a Pure Nash Equilibrium in multi-player strategic games. We address two fundamental questions: how can we represent a game? and how can we represent a game with polynomial pay-off functions? Our re- ...
Handbook on Randomized Computing, volume II …, Jan 1, 2001
CiteSeerX - Document Details (Isaac Councill, Lee Giles): Introduction Worst case analysis of an ... more CiteSeerX - Document Details (Isaac Councill, Lee Giles): Introduction Worst case analysis of an algorithm gives information on hard instances that may not be representative of its real behavior on the data of interest. In such situations, the analysis of its average behavior may give ...
Uploads
Papers by Maria Serna