Carme Alvarez Faura
Carme Alvarez Faura
Verified email at cs.upc.edu
TitleCited byYear
A very hard log-space counting class
C Álvarez, B Jenner
Theoretical Computer Science 107 (1), 3-30, 1993
1611993
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
512004
Parallel complexity in the design and analysis of concurrent systems
C Álvarez, JL Balcázar, J Gabarró, M Sántha
International Conference on Parallel Architectures and Languages Europe, 288-303, 1991
391991
A compendium of problems complete for symmetric logarithmic space
C Alvarez, R Greenlaw
Computational Complexity 9 (2), 123-145, 2000
352000
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
282005
Pure Nash equilibria in games with a large number of actions
C Àlvarez, J Gabarró, M Serna
International Symposium on Mathematical Foundations of Computer Science, 95-106, 2005
272005
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
242002
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
192004
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
191989
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
182004
Adaptive logspace reducibility and parallel time
C Àlvarez, JL Balcazar, B Jenner
Mathematical systems theory 28 (2), 117-140, 1995
171995
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
16*2010
The hardness of intervalizing four colored caterpillars
C Àlvarez, J Dıaz, M Serna
Discrete Mathematics 235 (1-3), 19-27, 2001
162001
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
152004
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
151991
A compendium of problems complete for symmetric logarithmic space
C Alvarez, R Greenlaw
Electronic Colloquium on Computational Complexity (ECCC) 3 (39), 1996
141996
A note on logspace optimization
C Àlvarez, B Jenner
Computational Complexity 5 (2), 155-166, 1995
131995
Adversarial models for priority-based networks
C Àlvarez, M Blesa, J Díaz, A Fernández, M Serna
International Symposium on Mathematical Foundations of Computer Science, 142-151, 2003
112003
The robustness of stability under link and node failures
C Àlvarez, M Blesa, M Serna
Theoretical Computer Science 412 (50), 6855-6878, 2011
102011
Sensor field: A computational model
C Àlvarez, A Duch, J Gabarro, M Serna
International Symposium on Algorithms and Experiments for Sensor Systems …, 2009
102009
The system can't perform the operation now. Try again later.
Articles 1–20