Share This Author
A Very Hard log-Space Counting Class
- C. Àlvarez, Birgit Jenner
- MathematicsTheor. Comput. Sci.
- 4 January 1993
A Characterization of Universal Stability in the Adversarial Queuing Model
- C. Àlvarez, M. Blesa, M. Serna
- MathematicsSIAM J. Comput.
- 2004
TLDR
Pure Nash Equilibria in Games with a Large Number of Actions
- C. Àlvarez, J. Gabarró, M. Serna
- EconomicsMFCS
- 29 August 2005
TLDR
A compendium of problems complete for symmetric logarithmic space
- C. Àlvarez, R. Greenlaw
- Mathematicscomputational complexity
- 1 April 2000
Abstract. The paper's main contributions are a compendium of problems that are complete for symmetric logarithmic space (SL), a collection of material relating to SL, a list of open problems, and an…
Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees,
- C. Àlvarez, J. Gabarró, M. Serna
- EconomicsISAAC
- 19 December 2005
TLDR
A very hard log space counting class
- C. Àlvarez, Birgit Jenner
- Computer Science, MathematicsProceedings Fifth Annual Structure in Complexity…
- 8 July 1990
TLDR
Network Creation Games: Structure vs Anarchy
- C. Àlvarez, A. Messegué
- Computer ScienceArXiv
- 28 June 2017
TLDR
Universal stability of undirected graphs in the adversarial queueing model
- C. Àlvarez, M. Blesa, M. Serna
- MathematicsSPAA '02
- 10 August 2002
TLDR
Adaptive logspace reducibility and parallel time
- C. Àlvarez, J. Balcázar, Birgit Jenner
- Computer ScienceMathematical systems theory
- 1 March 1995
TLDR
Adversarial models for priority‐based networks
- C. Àlvarez, M. Blesa, Josep Díaz, M. Serna, Antonio Fernández
- Computer Science, MathematicsNetworks
- 25 August 2003
TLDR
...
...