A very hard log-space counting class C Àlvarez, B Jenner Theoretical Computer Science 107 (1), 3-30, 1993 | 191 | 1993 |
A characterization of universal stability in the adversarial queuing model C Àlvarez, M Blesa, M Serna SIAM Journal on Computing 34 (1), 41-66, 2004 | 57 | 2004 |
A compendium of problems complete for symmetric logarithmic space C Alvarez, R Greenlaw Computational Complexity 9, 123-145, 2000 | 57 | 2000 |
Parallel complexity in the design and analysis of concurrent systems C Alvarez, JL Balcázar, J Gabarró, M Santha Parle’91 Parallel Architectures and Languages Europe: Volume I: Parallel …, 1991 | 41 | 1991 |
Pure Nash equilibria in games with a large number of actions C Alvarez, J Gabarro, M Serna International Symposium on Mathematical Foundations of Computer Science, 95-106, 2005 | 32 | 2005 |
Adversarial models for priority‐based networks C Àlvarez, M Blesa, J Díaz, M Serna, A Fernández Networks: An International Journal 45 (1), 23-35, 2005 | 32 | 2005 |
The Hom Problem is Decidable CÀ G. Godoy, O. Gimenez, L. Ramos STOC '10: Proceedings of the 42nd ACM Symposium on Theory of Computing, p …, 2010 | 29* | 2010 |
Universal stability of undirected graphs in the adversarial queueing model C Àlvarez, M Blesa, M Serna Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002 | 24 | 2002 |
Complexity classes with complete problems between P and NP-C C Àlvarez, J Díaz, J Torán International Conference on Fundamentals of Computation Theory, 13-24, 1989 | 22 | 1989 |
Adaptive logspace reducibility and parallel time C Àlvarez, JL Balcazar, B Jenner Mathematical systems theory 28 (2), 117-140, 1995 | 19 | 1995 |
Efficient and reliable high level communication in randomly deployed wireless sensor networks C Àlvarez, J Díaz, J Petit, J Rolim, M Serna Proceedings of the second international workshop on Mobility management …, 2004 | 18 | 2004 |
The impact of failure management on the stability of communication networks C Àlvarez, M Blesa, M Serna Proceedings. Tenth International Conference on Parallel and Distributed …, 2004 | 18 | 2004 |
The complexity of deciding stability under FFS in the Adversarial Queueing model C Àlvarez, M Blesa, J Dıaz, A Fernández, M Serna Information Processing Letters 90 (5), 261-266, 2004 | 18 | 2004 |
The hardness of intervalizing four colored caterpillars C Àlvarez, J Dıaz, M Serna Discrete Mathematics 235 (1-3), 19-27, 2001 | 17 | 2001 |
Functional oracle queries as a measure of parallel time C Àlvarez, JL Balcázar, B Jenner Annual Symposium on Theoretical Aspects of Computer Science, 422-433, 1991 | 17 | 1991 |
Network creation games: Structure vs anarchy C Àlvarez, A Messegué arXiv preprint arXiv:1706.09132, 2017 | 14 | 2017 |
On the price of anarchy for high-price links C Àlvarez, A Messegué International Conference on Web and Internet Economics, 316-329, 2019 | 13 | 2019 |
Celebrity games C Àlvarez, MJ Blesa, A Duch, A Messegué, M Serna Theoretical computer science 648, 56-71, 2016 | 13 | 2016 |
A note on logspace optimization C Àlvarez, B Jenner Computational Complexity 5, 155-166, 1995 | 13 | 1995 |
The parallel complexity of two problems on concurrency C Àlvarez, J Gabarró Information Processing Letters 38 (2), 61-70, 1991 | 13 | 1991 |