( en | de | ru )

 

Disambiguation of "Serna, Maria J."

Author of the publication

copydeleteadd this publication to your clipboard
The complexity of deciding stability under FFS in the Adversarial Queueing model.

, , , , and . Inf. Process. Lett., 90 (5): 261-266 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

María-Trinidad Serna-Encinas

Andrés Serna

Angel Serna

Gerda Sernau

Alexandra Serna

 

Other publications of authors with the same name

The Complexity of Testing Properties of Simple Games, , , and . CoRR, (2008)Uncertainty in basic short-term macroeconomic models with angel-daemon games., and . IJDATS, 9 (4): 314-330 (2017)Can Fixation be Guaranteed in the Generalized Moran Process?, , , , , and . CoRR, (2012)Stars and Celebrities: A Network Creation Game., , , , and . CoRR, (2015)Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, ., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 634-643. Springer, (2005)Efficient and reliable high level communication in randomly deployed wireless sensor networks., , , , and . Mobility Management & Wireless Access Protocols, page 106-110. ACM, (2004)Vertex fusion under distance constraints., and . Eur. J. Comb., 30 (7): 1612-1623 (2009)High level communication functionalities for wireless sensor networks., , , , and . Theor. Comput. Sci., 406 (3): 240-247 (2008)(H, C, K)-Coloring: Fast, Easy, and Hard Cases., , and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 304-315. Springer, (2001)Paradigms for fast parallel approximability (Reprint from 1997)., , , and . Cambridge international series on parallel computation Cambridge University Press, (2009)