Publications
Previous publications
Publications with IMDEA Networks
Books [4]

Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, Yanyong Zhang (December 2017)
Algorithms for Sensor Systems  13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 78, 2017, Revised Selected Papers
Springer International Publishing.
ISBN 9783319727509

Antonio Puliafito, Antonio Fernández Anta, Symeon Papavassiliou (August 2013)
Proceedings of the 12th IEEE International Symposium on Network Computing and Applications (IEEE NCA 2013)
IEEE Computer Society.

Marco Ajmone Marsan, Suresh Goyal, Shugong Xu, Antonio Fernández Anta, Milan Prodanovic, Ken Christensen (May 2012)
Proceedings of the 3rd International Conference on EnergyEfficient Computing and Networking, eEnergy'12, Madrid, Spain, May 911, 2012
ACM.

Antonio Fernández Anta, Giuseppe Lipari, Matthieu Roy (December 2011)
Principles of Distributed Systems  15th International Conference, OPODIS 2011, Toulouse, France, December 1316, 2011. Proceedings
Springer Berlin Heidelberg.
ISBN 9783642258725
Book Chapters [1]

Dariusz R. Kowalski, Pierre Sens, Antonio Fernández Anta, Guillaume Pierre (August 2011)
Introduction [PDF ]
Springer, 554.
ISBN 9783642233999
Journal Articles [46]

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou (January 2018)
Competitive Analysis of Fundamental Scheduling Algorithms on a FaultProne Machine and the Impact of Resource Augmentation [PDF ]
Future Generation Computer Systems,
78. pp. 245256. ISSN 0167739X

Alberto Mozo, José Luis LopézPresa, Antonio Fernández Anta (January 2018)
A distributed and quiescent maxmin fair algorithm for network congestion control [PDF ]
Expert Systems With Applications,
91. pp. 492512. ISSN 09574174

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou (September 2017)
Adaptive Packet Scheduling over a Wireless Channel under Constrained Jamming [PDF ]
Theoretical Computer Science,
692 (5). pp. 7289. ISSN 03043975

Kshitiz Verma, Gianluca Rizzo, Antonio Fernández Anta, Rubén Cuevas, Arturo Azcorra, Shmuel Zaks, Alberto GarcíaMartínez (July 2017)
Energyoptimal collaborative file distribution in wired networks [PDF ]
PeertoPeer Networking and Applications,
10 (4). pp. 925944. ISSN 19366442

Jordi Arjona Aroca, Antonio Fernández Anta (December 2016)
Empirical Comparison of Powerefficient Virtual Machine Assignment Algorithms [PDF ]
Computer Communications,
96. pp. 8698. ISSN 01403664

Agustín Santos, Antonio Fernández Anta, José A. Cuesta, Luis López Fernández (August 2016)
Fair Linking Mechanisms for Resource Allocation with Correlated Player Types [PDF ]
Computing,
98 (8). pp. 777801. ISSN 0010485X

Víctor M. López Millán, Vicent Cholvi, Antonio Fernández Anta, Luis López Fernández (July 2016)
Resource location based on precomputed partial random walks in dynamic networks [PDF ]
Computer Networks,
103. pp. 165180. ISSN 13891286

Evgenia Christoforou, Antonio Fernández Anta, Agustín Santos (May 2016)
A Mechanism for Fair Distribution of Resources without Payments
[PDF ]
PLOS ONE,
11 (5). pp. 120. ISSN 19326203

Antonio Fernández Anta, Vincent Gramoli, Ernesto Jiménez, AnneMarie Kermarrec, Michel Raynal (April 2016)
Distributed Slicing in Dynamic Systems [PDF ]
IEEE Transactions on Parallel and Distributed Systems,
27 (4). pp. 10301043. ISSN 10459219

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Joerg Widmer, Elli Zavou (April 2016)
Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies [PDF ]
Journal of Scheduling,
19 (2). pp. 135152. ISSN 10946136

Biyu Zhou, Fa Zhang, Lin Wang, Chenying Hou, Antonio Fernández Anta, Athanasios V. Vasilakos, Youshi Wang, Jie Wu, Zhiyong Liu (March 2016)
HDEER: A Distributed Routing Scheme for EnergyEfficient Networking [PDF ]
IEEE Journal on Selected Areas in Communications,
34 (5). pp. 1713 1727. ISSN 07338716

Jordi Arjona Aroca, Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves, Lin Wang (January 2016)
Powerefficient Assignment of Virtual Machines to Physical Machines [PDF ]
Future Generation Computer Systems,
54. pp. 8294. ISSN 0167739X

Jordi Arjona Aroca, Angelos Chatzipapas, Antonio Fernández Anta, Vincenzo Mancuso (December 2015)
A Measurementbased Characterization of the Energy Consumption in Data Center Servers [PDF ]
IEEE Journal on Selected Areas in Communications,
33 (12). pp. 115. ISSN 07338716

Andrés Sevilla, Alberto Mozo, Antonio Fernández Anta (November 2015)
Node Sampling using Random Centrifugal Walks [PDF ]
Journal of Computational Science,
11. pp. 3445. ISSN 18777503

Sergio Arévalo, Antonio Fernández Anta, Damien Imbs, Ernesto Jiménez, Michel Raynal (September 2015)
Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus) [PDF ]
Journal of Parallel and Distributed Computing,
83. pp. 8395. ISSN 07437315

Víctor M. López Millán, Vicent Cholvi, Luis López Fernández, Antonio Fernández Anta (September 2015)
Improving resource location with locally precomputed partial random walks [PDF ]
Computing,
97 (9). pp. 871891. ISSN 0010485X

Joerg Widmer, Andrea Capalbo, Antonio Fernández Anta, Albert Banchs (August 2015)
Efficient Interlayer Network Codes for Fair Layered
Multicast Streaming [PDF ]
IEEE/ACM Transactions on Networking,
23 (4). pp. 11071120. ISSN 10636692

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou (July 2015)
Online Parallel Scheduling of Nonuniform Tasks: Trading Failures for Energy [PDF ]
Theoretical Computer Science,
590. pp. 129146. ISSN 03043975

Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Daniel Pareja (March 2015)
Algorithmic Mechanisms for Reliable Crowdsourcing Computation under Collusion [PDF ]
PLOS ONE,
10 (3). pp. 122. ISSN 19326203

Héctor Cordobés de la Calle, Luis F. Chiroque, Antonio Fernández Anta, Rafael García, Philippe Morere, Lorenzo Ornella, Fernando Pérez, Agustín Santos (March 2015)
Empirical Comparison of Graphbased Recommendation Engines for an Apps Ecosystem [PDF ]
International Journal of Interactive Multimedia and Artificial Intelligence,
3 (2). pp. 3339. ISSN 19891660

Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro (February 2015)
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in ddimensions [PDF ]
Computational Geometry: Theory and Applications,
48 (2). pp. 134146. ISSN 09257721

José Luis LopézPresa, Luis F. Chiroque, Antonio Fernández Anta (July 2014)
Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph [PDF ]
Journal of Applied Mathematics,
2014. pp. 115. ISSN 16870042

Jordi Arjona Aroca, Antonio Fernández Anta (March 2014)
Bisection (Band)Width of Product Networks with Application to Data Centers [PDF ]
IEEE Transactions on Parallel and Distributed Systems,
25 (3). pp. 570580. ISSN 10459219

Héctor Cordobés de la Calle, Antonio Fernández Anta, Luis F. Chiroque, Fernando Pérez, Teófilo Redondo, Agustín Santos (March 2014)
Graphbased Techniques for Topic Classification of Tweets in Spanish [PDF ]
IJIMAI International Journal of Interactive Multimedia and Artificial Intelligence (Special issue: AI Techniques to Evaluate Economics and Happiness),
2 (5). pp. 3137. ISSN ISSN 1989  1660

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro (January 2014)
Algorithmic Mechanisms for Reliable MasterWorker InternetBased Computing [PDF ]
IEEE Transactions on Computers,
63 (1). pp. 179195. ISSN 00189340

Chenying Hou, Fa Zhang, Antonio Fernández Anta, Lin Wang, Zhiyong Liu (December 2013)
A Hopbyhop Energy Efficient Distributed Routing Scheme [PDF ]
ACM SIGMETRICS Performance Evaluation Review,
41 (3). pp. 101106. ISSN 01635999

Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz (November 2013)
Unbounded Contention Resolution in MultipleAccess Channels [PDF ]
Algorithmica,
67 (3). pp. 295314. ISSN 01784617

Agustín Santos, Antonio Fernández Anta, Luis López Fernández (September 2013)
Quid Pro Quo: A Mechanism for Fair Collaboration in Networked Systems [PDF ]
PLOS ONE,
8 (9). pp. 115. ISSN 19326203

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez (August 2013)
Applying the dynamics of evolution to achieve reliability in master–worker computing [PDF ]
Concurrency and Computation: Practice and Experience,
ISSN 15320634

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez (May 2013)
Crowd computing as a cooperation problem: an evolutionary approach [PDF ]
Journal of Statistical Physics,
151 (3). pp. 654672. ISSN 00224715

Matthew Andrews, Antonio Fernández Anta, Lisa Zhang, Wenbo Zhao (May 2013)
Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model [PDF ]
Networks: An International Journal,
61 (3). pp. 226237. ISSN 00283045

Martin FarachColton, Antonio Fernández Anta, Miguel A. Mosteiro (February 2013)
Optimal Memoryaware Sensor Network Gossiping (or How to Break the Broadcast Lower Bound) [PDF ]
Theoretical Computer Science,
472. pp. 6080. ISSN 03043975

Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves (February 2013)
An earlystopping protocol for computing aggregate functions in Sensor Networks [PDF ]
Journal of Parallel and Distributed Computing,
73 (2). pp. 111121. ISSN 07437315

Mikel Larrea, Antonio Fernández Anta, Sergio Arévalo (January 2013)
Implementing the weakest failure detector for solving the consensus problem [PDF ]
International Journal of Parallel, Emergent and Distributed Systems,
ISSN 17445760 (Print), 17445779 (Online)

Antonio Fernández Anta, Luis F. Chiroque, Philippe Morere, Agustín Santos (January 2013)
Sentiment Analysis and Topic Detection of Spanish Tweets: A Comparative Study of NLP Techniques (Análisis de sentimientos y detección de asunto de tweets en español: un estudio comparativo de técnicas de PLN) [PDF ]
Procesamiento del Lenguaje Natural,
50. pp. 4552. ISSN 11355948

Víctor M. López Millán, Vicent Cholvi, Luis López, Antonio Fernández Anta (September 2012)
A Model of SelfAvoiding Random Walks for Searching Complex
Networks
[PDF ]
Networks: An International Journal,
60 (2). pp. 7185. ISSN 00283045

Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks (August 2012)
Opportunistic Information Dissemination in Mobile Adhoc Networks: The Profit of Global Synchrony [PDF ]
Distributed Computing,
25 (4). pp. 279296. ISSN 01782770

Fa Zhang, Antonio Fernández Anta, Lin Wang, Chenying Hou, Zhiyong Liu (March 2012)
Network energy consumption models and energy efficient algorithms [PDF ]
Jisuanji Xuebao (Chinese Journal of Computers),
35 (3). pp. 603615. ISSN 2544164

Matthew Andrews, Antonio Fernández Anta, Lisa Zhang, Wenbo Zhao (February 2012)
Routing for Power Minimization in the Speed Scaling Model [PDF ]
IEEE/ACM Transactions on Networking,
20 (1). pp. 285294. ISSN 10636692

Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves (February 2012)
Deterministic recurrent communication in restricted Sensor Networks [PDF ]
Theoretical Computer Science,
418. pp. 37  47. ISSN 03043975

Antonio Fernández Anta, Chryssis Georgiou, Luis López, Agustín Santos (January 2012)
Reliable Internetbased MasterWorker Computing in the Presence of Malicious Workers [PDF ]
Parallel Processing Letters,
22 (1). ISSN 01296264

Marco Ajmone Marsan, Antonio Fernández Anta, Vincenzo Mancuso, Balaji Rengarajan, Pedro Reviriego Vasallo, Gianluca Rizzo (July 2011)
A Simple Analytical Model for Energy Efficient Ethernet [PDF ]
IEEE Communications Letters,
15 (7). pp. 773775. ISSN 10897798

Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves (April 2011)
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks [PDF ]
Discrete Mathematics and Theoretical Computer Science (DMTCS),
13 (1). pp. 95112. ISSN 13658050

Roberto Baldoni, Antonio Fernández Anta, Kleoni Ioannidou, Alessia Milani (March 2011)
The impact of mobility on the geocasting problem in mobile adhoc networks: Solvability and cost [PDF ]
Theoretical Computer Science,
412 (1214). pp. 10661080. ISSN 03043975

Antonio Fernández Anta, Miguel A. Mosteiro (December 2010)
Contention Resolution in MultipleAccess Channels: kSelection in Radio Networks [PDF ]
Discrete Mathematics, Algorithms and Applications (DMAA),
2 (4). pp. 445456. ISSN 17938309

Antonio Fernández Anta, Ernesto Jiménez, Michel Raynal (November 2010)
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony [PDF ]
Journal of Computer Science and Technology,
25 (6). pp. 12671281. ISSN 16666038
Conference and Workshop Papers [50]

Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou (November 2017)
Formalizing Distributed Ledger Objects [PDF ]
In: The 1st Workshop on Storage, Control, Networking in Dynamic Systems (SCNDS 2017), in conjunction with the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2017), 5 November 2017 , Boston, MA, USA

PerOlov Östberg, James Byrne, Paolo Casari, Philip Eardley, Antonio Fernández Anta, Johan Forsman, John Kennedy, Thang Le Duc, Manuel Noya Mariño, Loomba Radhika, Miguel Ángel López Peña, José López Veiga, Theo Lynn, Vincenzo Mancuso, Sergej Svorobej, Anders Torneus, Stefan Wesner, Peter Willis, Jörg Domaschka (June 2017)
Reliable Capacity Provisioning for Distributed Cloud/Edge/Fog Computing Applications [PDF ]
In: The 26th European Conference on Networks and Communications (EuCNC 2017), 1215 June 2017, Oulu, Finland

Sergey Nikolenko, Kirill Kogan, Antonio Fernández Anta (May 2017)
Network Simplification Preserving Bandwidth and Routing Capabilities [PDF ]
In: The 36th IEEE International Conference on Computer Communications (IEEE INFOCOM 2017), 14 May 2017, Atlanta, GA, USA

Antonio Fernández Anta, Theophanis Hadjistasi, Nicolas Nicolaou (December 2016)
Computationally Light “MultiSpeed” Atomic Memory [PDF ]
In: The 20th International Conference on Principles of Distributed Systems (OPODIS 2016), 1316 December 2016, Madrid, Spain

Nicolas Nicolaou, Antonio Fernández Anta, Chryssis Georgiou (October 2016)
CoVerability: Consistent Versioning in Asynchronous, FailProne, MessagePassing Environments [PDF ]
In: The 15th IEEE International Symposium on Network Computing and Applications (NCA 2016), 31 October  2 November 2016, Boston, Cambridge, Massachusetts, USA

Evgenia Christoforou, Antonio Fernández Anta, Kishori Konwar, Nicolas Nicolaou (October 2016)
Evaluating Reliability Techniques in the MasterWorker Paradigm [PDF ]
In: The 15th IEEE International Symposium on Network Computing and Applications (NCA 2016), 31 October  2 November 2016, Boston, Cambridge, Massachusetts, USA

Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Daniel Pareja (September 2016)
Multiround MasterWorker Computing: a Repeated Game Approach [PDF ]
In: The 35th Symposium on Reliable Distributed Systems (SRDS 2016), 2629 September 2016, Budapest, Hungary

Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila (August 2016)
The effect of range and bandwidth on the round complexity in the congested clique model [PDF ]
In: The 22nd International Computing and Combinatorics Conference (COCOON 2016), 24 August 2016, Ho Chi Minh City, Vietnam

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro (May 2016)
Internet Computing: Using Reputation to Select Workers from a Pool
[PDF ]
In: The 4th International Conference on NETworked sYStems (NETYS 2016), 1820 May 2016, Marrakesh, Morocco

Antonio Fernández Anta, Chryssis Georgiou, Elli Zavou (December 2015)
Adaptive Scheduling over a Wireless Channel under Constrained Jamming [PDF ]
In: The 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2015), 18  20 December, 2015, Houston, Texas

Antonio Fernández Anta, Nicolas Nicolaou, Alexandru Popa (December 2015)
Making "Fast" Atomic Operations Computationally Tractable [PDF ]
In: The 19th International Conference On Principles of Distributed Systems (OPODIS 2015), 1417 December 2015, Rennes, France

Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila (July 2015)
Brief Announcement: A Hierarchy of Congested Clique Models: From Broadcast to Unicast [PDF ]
In: The 34th Annual ACM Symposium on Principles of Distributed Computing (ACM PODC 2015), 2123 July 2015, DonostiaSan Sebastián, Spain

Lin Wang, Antonio Fernández Anta, Fa Zhang, Jie Wu, Zhiyong Liu (July 2015)
Multiresource energyefficient routing in cloud data centers with networkasaservice [PDF ]
In: The 20th IEEE Symposium on Computers and Communications (ISCC 2015), 69 July 2015, Larnaca, Cyprus

Antonio Fernández Anta, Chryssis Georgiou, Elli Zavou (June 2015)
Adaptive Scheduling over a Wireless Channel under Constrained Jamming [PDF ]
In: XXIII Jornadas de Concurrencia y Sistemas Distribuidos  Doctoral Consortium en Tecnologías Informáticas (JCSD 2015), 1012 June 2015, Málaga, Spain

Antonio Fernández Anta, Chryssis Georgiou, Elli Zavou (May 2015)
Packet Scheduling over a Wireless Channel: AQTbased Constrained Jamming [PDF ]
In: The International Conference on NETworked sYStems (NETYS 2015), 1315 May 2015, Agadir, Morocco

Jordi Arjona Aroca, Antonio Fernández Anta (April 2015)
Empirical comparison of powerefficient virtual machine assignment algorithms
[PDF ]
In: The 4th IFIP Conference on Sustainable Internet and ICT for Sustainability (SustainIT 2015), 1415 April 2015, Madrid, Spain

Jordi Arjona Aroca, Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves, Lin Wang (July 2014)
Powerefficient Assignment of Virtual Machines to Physical Machines [PDF ]
In: Workshop on Adaptive Resource Management and Scheduling for Cloud Computing (ARMSCC 2014), The 33rd Annual ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing (PODC 2014), 15 July 2014, Paris, France

Jordi Arjona Aroca, Antonio Fernández Anta (June 2014)
JAM: A Tabubased TwoStage Simulated Annealing Algorithm for the Multidimensional Arrangement Problem [PDF ]
In: The 9th International Workshop on Hybrid Metaheuristics (HM 2014), 1113 June 2014, Hamburg, Germany

Jordi Arjona Aroca, Angelos Chatzipapas, Antonio Fernández Anta, Vincenzo Mancuso (May 2014)
A Measurementbased Analysis of the Energy Consumption of Data Center Servers [PDF ]
In: The 5th ACM International Conference on EnergyEfficient Computing and Networking (ACM eEnergy 2014), 1113 June 2014, Cambridge, United Kingdom

Agustín Santos, Antonio Fernández Anta, José A. Cuesta, Luis López Fernández (May 2014)
Fair Linking Mechanisms for Resource Allocation with Correlated Player Types [PDF ]
In: The 2nd International Conference on NETworked sYStems (NETYS 2014), 1517 May 2014, Marrakech, Morocco

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez (December 2013)
Reputationbased Mechanisms for Evolutionary MasterWorker Computing [PDF ]
In: The 17th International Conference On Principles Of DIstributed Systems (OPODIS 2013), 1618 Dec 2013, Nice, France

Antonio Fernández Anta, Dariusz R. Kowalski, Miguel A. Mosteiro, Prudence W. H. Wong (September 2013)
Station Assignment with Applications to Sensing [PDF ]
In: The 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2013), 5  6 September 2013, Sophia Antipolis, France

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou (August 2013)
Online Parallel Scheduling of Nonuniform Tasks: Trading Failures for Energy [PDF ]
In: The 19th International Symposium on Fundamentals of Computation Theory (FCT 2013), 19  21 August 2013, Liverpool, England, UK

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Joerg Widmer, Elli Zavou (July 2013)
Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies [PDF ]
In: The 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2013), 1  3 July 2013, Ischia, Italy

Jordi Arjona Aroca, Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves (June 2013)
Powerefficient Assignment of Virtual Machines to Physical Machines [PDF ]
In: The 21st Jornadas de Concurrencia y Sistemas Distribuidos (JCSD 2013), 19  21 June 2013, San Sebastián, Spain

José Luis LopézPresa, Luis F. Chiroque, Antonio Fernández Anta (June 2013)
Novel Techniques for Automorphism Group Computation [PDF ]
In: The 12th International Symposium on Experimental Algorithms (SEA 2013), 5  7 June 2013, Rome, Italy

Víctor M. López Millán, Vicent Cholvi, Luis López, Antonio Fernández Anta (May 2013)
Improving Resource Location with Locally Precomputed Partial Random Walks [PDF ]
In: The 1st International Conference on Networked Systems (NETYS 2013), 2  4 May 2013, Marrakech, Morocco

Andrés Sevilla, Alberto Mozo, Antonio Fernández Anta (December 2012)
Node Sampling Using Centrifugal Random Walks [PDF ]
In: The 16th International Conference On Principles Of DIstributed Systems (OPODIS 2012), 1720 December 2012, Roma, Italy

Víctor M. López Millán, Vicent Cholvi, Luis López, Antonio Fernández Anta (December 2012)
Resource location based on partial random walks in networks with resource dynamics [PDF ]
In: The 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS 2012) , 17 December 2012, Rome, Italy

Andrés Sevilla, Alberto Mozo, Antonio Fernández Anta (October 2012)
Brief Announcement: Node Sampling Using Centrifugal Random Walks [PDF ]
In: The 26th International Symposium on DIStributed Computing (DISC 2012), 1618 October 2012, Salvador, Bahia, Brazil

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez (August 2012)
Achieving Reliability in MasterWorker Computing via Evolutionary Dynamics [PDF ]
In: The 18th International Conference on Parallel Processing (EuroPar 2012), 2731 August 2012, Rhodes Island, Greece

Alberto Mozo, José Luis LopézPresa, Antonio Fernández Anta (August 2012)
SLBN: A Scalable Maxmin Fair Algorithm for RateBased Explicit Congestion Control [PDF ]
In: The 11th IEEE International Symposium on Network Computing and Applications (IEEE NCA 2012), 2325 August 2012, Cambridge, MA, USA

Kshitiz Verma, Gianluca Rizzo, Antonio Fernández Anta, Rubén Cuevas, Arturo Azcorra (August 2012)
Greening the Internet: EnergyOptimal File Distribution [PDF ]
In: The 11th IEEE International Symposium on Network Computing and Applications (IEEE NCA 2012), August 2325, 2012, Cambridge, MA, USA

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez (July 2012)
Brief Announcement: Achieving Reliability in MasterWorker Computing via Evolutionary Dynamics [PDF ]
In: The 31st Annual ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing (ACM PODC 2012), 1618 July 2012, Funchal, Madeira, Portugal

Sergio Arévalo, Antonio Fernández Anta, Damien Imbs, Ernesto Jiménez, Michel Raynal (June 2012)
Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus) [PDF ]
In: The 32nd International Conference on Distributed Computing Systems (ICDCS 2012), 1821 June 2012, Macau, China

Jordi Arjona Aroca, Antonio Fernández Anta (May 2012)
Bisection (Band)Width of Product Networks with Application to Data Centers [PDF ]
In: The 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), The Turing Year 2012 in China, May 1621, 2012, Beijing, China

Lin Wang, Antonio Fernández Anta, Fa Zhang, Chenying Hou, Zhiyong Liu (May 2012)
EnergyEfficient Network Routing with Discrete Cost Functions [PDF ]
In: The 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), The Turing Year 2012 in China, 1621 May 2012, Beijing, China

Martin FarachColton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks (April 2012)
Opportunistic Information Dissemination in Mobile AdHoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism [PDF ]
In: The 10th Latin American Symposium onTheoretical Informatics (LATIN 2012), April 1620, 2012, Arequipa, Peru

Joerg Widmer, Andrea Capalbo, Antonio Fernández Anta, Albert Banchs (March 2012)
Rate allocation for layered multicast streaming with interlayer network coding [PDF ]
In: The 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), 2530 March, 2012, Orlando, Florida, USA

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro (September 2011)
Brief Announcement: Algorithmic Mechanisms for InternetBased Computing under Unreliable Communication [PDF ]
In: The 25th International Symposium on DIStributed Computing (DISC 2011), 2022 September, 2011, Rome, Italy

Martin FarachColton, Antonio Fernández Anta, Alessia Milani, Shmuel Zaks (September 2011)
Brief Announcement: Opportunistic Information Dissemination in Mobile AdHoc Networks:  Adaptiveness vs. Obliviousness and Randomization vs. Determinism [PDF ]
In: The 25th International Symposium on DIStributed Computing (DISC 2011), 2022 September, 2011, Rome, Italy

Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz (September 2011)
Unbounded Contention Resolution in MultipleAccess Channels [PDF ]
In: The 25th Distributed Computing  International Symposium (DISC 2011), 2022 September 2011, Rome, Italy

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro (August 2011)
Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication [PDF ]
In: The 10th IEEE International Symposium on Network Computing and Applications (IEEE NCA11), 25  27 August, 2011, Cambridge, Massachusetts, USA

Alberto Mozo, José Luis LopézPresa, Antonio Fernández Anta (August 2011)
BNeck: A Distributed and Quiescent Maxmin Fair Algorithm [PDF ]
In: The 10th IEEE International Symposium on Network Computing and Applications (IEEE NCA11), 25  27 Agosto, 2011, Cambridge, Massachusetts, USA

Jordi Arjona Aroca, Antonio Fernández Anta (August 2011)
Bisection Width of Multidimensional Product
Graphs [PDF ]
In: Young Researchers Forum (YRF 2011), The 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), 22 26 August 2011, Warsaw, Poland

Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro (August 2011)
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in dDimensions [PDF ]
In: The 23rd Canadian Conference on Computational Geometry (CCCG 2011), 1012 August, 2011, Toronto, Canada

Alberto Mozo, José Luis LopézPresa, Antonio Fernández Anta (June 2011)
BNeck – A Distributed and Quiescent Maxmin Fair Algorithm [PDF ]
In: The 30th Annual ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing (ACM / SIGACTSIGOPS PODC 2011), 68 June, 2011, San Jose, California, USA

Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz (June 2011)
Brief Announcement: Unbounded Contention Resolution in MultipleAccess Channels [PDF ]
In: The 30th Annual ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing (ACM / SIGACTSIGOPS PODC 2011), 68 June, 2011, San Jose, California, USA

Andrés Sevilla, Alberto Mozo, M. Araceli Lorenzo, José Luis LopézPresa, Pilar Manzano, Antonio Fernández Anta (December 2010)
Biased Selection for Building SmallWorld Networks [PDF ]
In: The 14th International Conference on Principles of Distributed Systems (OPODIS 2010), 1417 December 2010, Tozeur, Tunisia

Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro (October 2010)
The Length of the Longest Edge in Multidimensional Delaunay Graphs [PDF ]
In: The 20th Annual Fall Workshop on Computational Geometry, 2930 October 2010, Stony Brook, New York, USA
Conference and Workshop Posters & Demos [4]

Andrés Abeliuk, Antonio Fernández Anta, Nick Obradovich, Iyad Rahwan (July 2017)
Modeling the Evolution of Political Ideologies
(Poster, peerreviewed)
[PDF ]
In: The 3rd Annual International Conference on Computational Social Science (IC2S2 2017), 1013 July 2017, Cologne, Germany

Evgenia Christoforou, Antonio Fernández Anta, Agustín Santos (December 2014)
A Mechanism for Fair Distribution of Resources with Application to Sponsored Search
(Poster, peerreviewed)
[PDF ]
In: The 10th Conference on Web and Internet Economics (WINE 2014), The 11th Workshop on Algorithms and the Models of Web Graph (WAW 2014), 1417 December 2014, Beijing, China

Agustín Santos, Antonio Fernández Anta, Luis López Fernández (June 2013)
Quid Pro Quo: A Fair Linking Mechanism
(Poster, peerreviewed)
[PDF ]
In: The 14th ACM Conference on Electronic Commerce (ACM EC 2013), 16  20 June 2013, Philadelphia, PA, USA

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Joerg Widmer, Elli Zavou (June 2013)
Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies
(Poster, peerreviewed)
[PDF ]
In: The 5th IMDEA Networks Annual International Workshop: Networked Reliable Systems, 5 June 2013, Madrid, Spain
Invited Papers, Keynotes, Invited Talks, Tutorials, Lectures, etc. [20]

Antonio Fernández Anta (June 2017)
Adaptive Scheduling over a Wireless Channel under Constrained Jamming (Invited Talk)
In: Seminar at Notheastern University, 21 June 21 2017, College of Computer and Information Science, Northeastern University, Boston, USA

Antonio Fernández Anta (February 2017)
Adaptive Scheduling over a Wireless Channel under Jamming (Invited Talk)
In: Seindenberg School Seminars, 21 February 2017, Pace University, New York, USA

Antonio Fernández Anta (May 2016)
Saving Energy by Powering Down Links (Keynote) [PDF ]
In: The 7th International Conference on Ambient Systems, Networks and Technologies (ANT 2016), The 6th International Conference on Sustainable Energy Information Technology (SEIT 2016), 2326 May 2016, Madrid, Spain

Antonio Fernández Anta, Luis F. Chiroque (September 2015)
Research on Social Networks and Complex Systems on IMDEA Networks (Invited Talk) [PDF ]
In: COMSOTEC 2015, 911 September 2015, Santander, Spain

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou (July 2015)
Competitive Analysis of Task Scheduling Algorithms on a FaultProne Machine and the Impact of Resource Augmentation (Invited Paper) [PDF ]
In: Workshop on Adaptive Resource Management and Scheduling for Cloud Computing (ARMSCC 2015), 20 July 2015, San Sebastian, Spain

Evgenia Christoforou, Antonio Fernández Anta, Agustín Santos (June 2015)
A Mechanism for Fair Distribution of Resources with Application to Sponsored Search
(Other) [PDF ]
In: XXIII Jornadas de Concurrencia y Sistemas Distribuidos, 1012 Jun 2015, Malaga, Spain

Luis F. Chiroque, Héctor Cordobés de la Calle, Antonio Fernández Anta, Rafael García, Philippe Morere, Lorenzo Ornella, Fernando Pérez, Agustín Santos (September 2014)
Combining Graphs and Big Data to Recommend Apps (Keynote) [PDF ]
In: The 1st International Workshop on Big Data Applications and Principles (BIGDAP 2014), 1112 September 2014, Madrid, Spain

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou (July 2014)
Asymptotic Competitive Analysis of Task Scheduling Algorithms
on a FaultProne Machine (Invited Talk) [PDF ]
In: The 1st Young Researcher Workshop on Automata, Languages and Programming (YRICALP 2014), 7 July 2014, Copenhagen, Denmark

Antonio Fernández Anta (June 2014)
Saving Energy by Powering Down Links (Invited Talk)
In: Network Sciences and Technologies (NeST) Workshop 2014, 2627 June 2014, Liverpool, UK

Antonio Fernández Anta (June 2014)
Wireless Algorithmics at IMDEA Networks (Invited Talk)
In: Workshop on Wireless Communication 2014, Network Sciences and Technologies (NeST Workshop 2014), 25 June 2014, Liverpool, UK

Antonio Fernández Anta (December 2013)
Energy related research at IMDEA Networks (Invited Talk)
In: University of Liverpool, 4 December 2013, Liverpool, UK

Héctor Cordobés de la Calle, Antonio Fernández Anta, Luis F. Chiroque, Fernando Pérez, Teófilo Redondo, Agustín Santos (September 2013)
Graphbased Techniques for Topic Classification of Tweets (Técnicas basadas en grafos para la categorización de tweets por tema)
(Invited Paper) [PDF ]
In: Spanish Society for Natural Language Processing Conference (SEPLN 2013), 1820 September 2013, Madrid, Spain

Antonio Fernández Anta (March 2013)
Greening the Internet: EnergyOptimal File Distribution (Invited Talk)
In: Complutense University of Madrid, 13 May 2013, Madrid, Spain

Antonio Fernández Anta, Philippe Morere, Luis F. Chiroque, Agustín Santos (September 2012)
Techniques for Sentiment Analysis and Topic Detection of Spanish Tweets: Preliminary Report (Invited Paper) [PDF ]
In: Spanish Society for Natural Language Processing Conference (SEPLN 2012), 57 September 2012, Castellón de la Plana, Spain

Antonio Fernández Anta (July 2012)
Opportunistic Information Dissemination in Mobile Adhoc Networks. Adaptiveness vs. Obliviousness and Randomization vs. Determinism (Invited Paper)
In: Network Science Workshop by the Institute for Interdisciplinary Information Sciences (IIIS), 2527 July 2012, nstitute of Theoetical Computer Science and Communications, Hong Kong, China

Antonio Fernández Anta (May 2012)
Greening the Internet: Energyoptimal File Distribution (Invited Paper)
In: Tshinghua University, 28 May 2012, Beijing, China

Antonio Fernández Anta (May 2012)
Biased Sampling of Networks (Invited Paper)
In: The 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), The Turing Year 2012 in China, 1621 May 2012, Beijing, China

Antonio Fernández Anta (November 2011)
Saving Energy by Powering Down Links (Invited Paper)
In: Meeting of COST Action: IC0804, 78 November 2011, University of Thessaloniki, Thessaloniki, Greece

Antonio Fernández Anta (July 2011)
Distancebiased Sampling of Networks (Invited Paper)
In: Laboratoire d’informatique de Paris 6 (LIP6), 18 July 2011, Université Pierre & Marie Curie, Paris, France

Antonio Fernández Anta (May 2011)
Energy Efficiency in Networks (Invited Paper)
In: Institute of Computing Technology (ICT), 4 May 2011, Chinese Academy of Sciences, Beijing, China
Technical Reports [3]

Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez (August 2014)
ReputationBased Mechanisms for Reliable Crowdsourcing Computation
( TRIMDEANetworks20142 ) [PDF ]
We consider an Internetbased MasterWorker framework, for machineoriented computing tasks (i.e.
SETI@home) or human intelligence tasks (i.e. Amazon’s Mechanical Turk). In this framework a master sends
tasks to unreliable workers, and the workers execute and report back the result. We model such computations using
evolutionary dynamics and consider three type of workers: altruistic, malicious and rational. Altruistic workers
always return the correct result, malicious workers always return an incorrect result, and rational (selfish) workers
decide whether to be truthful depending on what increases their benefit. The goal of the master is reaching eventual
correctness, that is, a stable state of the system in which it always obtains the correct results. To this respect, we
propose a mechanism that uses reinforcement learning to induce a correct behavior to rational workers; coping with
malice leveraging reputation schemes. We analyze our system as a Markov chain and we give provable guarantees
under which truthful behavior can be ensured. Simulation results, obtained using parameter values similar to the
values observed in real systems, reveal interesting tradeoffs between various metrics and parameters, such as cost,
time of convergence to a truthful behavior, tolerance to cheaters and the type of reputation metric employed.

Alberto Mozo, José Luis LopézPresa, Antonio Fernández Anta (April 2011)
BNeck: a distributed and quiescent maxmin fair algorithm ( TRIMDEA Networks20112 ) [PDF ]
The problem of fairly distributing a network capacity among a set of sessions has been widely studied. In this problem, each session connects via a single path a source and a destination, and its objective is to maximize its as signed transmission rate (i.e., its throughput). Since the links of the network have limited bandwidth, some form of criterion has to be defined to fairly distribute them among the sessions. A popular criterion is maxmin fairness that, in short, guarantees that each session i gets a rate λi such that no session s can increase λs without causing another session s′ to end up with a rate λs′< λs. Many maxmin fair algorithms have been proposed, both centralized and distributed. However, to our knowledge, all proposed distributed algorithms require control packets being continuously transmitted to recompute the maxmin fair rates when needed.
In this paper we propose BNeck, a maxmin fair distributed algorithm that is also quiescent. This means that, in absence of changes (i.e., session arrivals or departures), once the maxmin rates have been computed BNeck stops generating network traffic. As far as we know, BNeck is the first maxmin fair distributed algorithm that does not require a continuous injection of control traffic to compute the rates. When changes occur, affected sessions are asynchronously informed of their new rate (i.e., sessions do not need to poll the network for changes). The correctness of BNeck is formally proved, and extensive simulations are conducted. In them it is shown that BNeck converges relatively fast and behaves nicely in presence of sessions arriving and departing.

Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz (March 2011)
Unbounded Contention Resolution in MultipleAccess Channels ( TRIMDEA Networks20111 ) [PDF ]
A frequent problem in settings where a unique resource must be shared among users is how to resolve the contention that arises when all of them must use it, but the resource allows only for one user each time. The application of efficient solutions for this problem spans a myriad of settings such as radio communication networks or databases. For the case where the number of users is unknown but fixed, recent work has yielded fruitful results for local area networks and radio networks, although either the solution is suboptimal or a (possibly loose) upper bound on the number of users needs to be known.
In this paper, we present the first (two) protocols for contention resolution in radio networks that are asymptotically optimal (with high probability), work without collision detection, and do not require information about the number of contenders. The protocols are evaluated and contrasted with the previous work by extensive simulations. These show that the complexity bounds obtained by the analysis are rather tight, and that the two protocols proposed have small and predictable complexity for all system sizes (unlike previous proposals).
Previous Publications
Journal Articles

Antonio Fernández, José Luis LópezPresa, M. Araceli Lorenzo, Pilar Manzano, Juan MartínezRomo, Alberto Mozo, Christopher Thraves.
``Performance of scheduling policies in adversarial networks with nonsynchronized clocks,"
Theory of Computing Systems, vol. 48, no. 1, pp. 122, 2011.
DOI: 10.1007/s0022400992235.

Vicent Cholvi, Antonio Fernández, Ernesto Jiménez, Pilar Manzano, and Michel Raynal.
``A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory,"
The Computer Journal, vol. 53, no. 9, pp. 15231534, 2010.
DOI: 10.1093/comjnl/bxp090.

Luis RoderoMerino, Antonio Fernández Anta, Luis López, Vicent Cholvi. ``Performance of Random Walks in OneHop Replication Networks," Computer Networks, vol. 54, pp. 781796, 2010.
DOI: 10.1016/j.comnet.2009.10.006.

Antonio Fernández Anta, Michel Raynal. ``From an asynchronous intermittent rotating
star to an eventual leader," IEEE Transactions on Parallel and Distributed Systems,
Volume 21, Issue 9, pp. 12901303, Sept. 2010.
DOI: 10.1109/TPDS.2009.163.

Antonio Fernández, Ernesto Jiménez, Michel Raynal, Gilles Trédan.
``A timing assumption and two tresilient protocols for implementing an eventual leader service in asynchronous shared memory systems,"
Algorithmica, vol. 56, no. 4, pp. 550576, 2010.
DOI: 10.1007/s0045300891902.

Vicent Cholvi, Ernesto Jiménez, Antonio Fernández Anta.
``Interconnection of Distributed Memory Models,"
Journal of Parallel and Distributed Computing,
vol. 69, pp. 295306, 2009.

Luis RoderoMerino, Antonio Fernández Anta, Luis López, Vicent Cholvi.
``SelfManaged Topologies in P2P Networks,"
Computer Networks,
vol. 53, pp. 17221736, 2009.
DOI: 10.1016/j.comnet.2008.09.006.

María J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés
L. Martínez, Agustín Santos, María J. Serna, Christopher Thraves.
"Adversarial Queueing Model for Continuous Network Dynamics,"
Theory of Computing Systems, vol. 44, no. 3, pp. 304331, 2009.
DOI: 10.1007/s0022400790461.

Sancho SalcedoSanz, Jose A. PortillaFigueras,
Emilio G. OrtizGarcía, Angel M. PérezBellido,
Christopher Thraves, Antonio Fernández Anta, Xin Yao.
``Optimal switch location in mobile
communication networks using hybrid genetic
algorithms,"
Applied Soft Computing, vol. 8, no. 4, pp. 14861497, Sep. 2008.

Ángel Álvarez, Sergio Arévalo, Vicent Cholvi, Antonio Fernández, Ernesto
Jiménez.
``On the Interconnection of Message Passing Systems," Information
Processing Letters, vol. 105, no. 6, pp. 249254, 2008.

Ernesto Jiménez, Antonio Fernández, Vicent Cholvi.
"A Parametrized Algorithm that Implements Sequential, Causal, and Cache Memory
Consistencies," The Journal of Systems and Software, vol. 81, no. 1, pp. 120131, 2008.

Yaacov Fernandess, Antonio Fernández, Maxime Monod.
"A Generic Theoretical Framework for Modeling GossipBased Algorithms,"
ACM SIGOPS Operating Systems Review,
Volume 41, Issue 5, pp. 1927, October 2007.

Luis López, Antonio Fernández, Vicent Cholvi.
"A Game Theoretic Comparison of TCP and Digital Fountain Based Protocols,"
Computer Networks, vol. 51, no. 12, pp. 34133426, 2007.

Antonio Fernández, Tom Leighton, José Luis LópezPresa.
"Containment Properties of Product and Power Graphs,"
Discrete Applied Mathematics, vol. 155, no. 3, pp. 300311, 2007.

Simon Dobson, Spyros Denazis, Antonio Fernández, Dominique Gaïti, Erol
Gelenbe, Fabio Massacci, Paddy Nixon, Fabrice Saffre, Nikita Schmidt, and Franco
Zambonelli. "A survey of autonomic communications,"
ACM Transactions on Autonomous and Adaptive Systems, vol. 1, no. 2,
pp. 223259, December 2006.

Ernesto Jiménez, Sergio Arévalo, Antonio Fernández.
"Implementing Unreliable Failure Detectors with Unknown Membership,"
Information Processing Letters, vol. 100, no. 2, pp. 6063, October
2006.

Matthew Andrews, Antonio Fernández, Ashish Goel, and Lisa Zhang.
"Source Routing and Scheduling in Packet Networks,"
Journal of the ACM,, vol. 52, no. 4, pp. 582601, July 2005.

Luis LópezFernández, Gemma del Rey Almansa, Stephane Paquelet, and
Antonio Fernández. "A Mathematical Model for the TCP Tragedy of the
Commons," Theoretical Computer Science, vol. 343, no. 1, pp. 426,
2005.

Vicent Cholvi, Victor Laderas, Luis Lopez, and Antonio Fernandez. "Selfadapting
network topologies in congested scenarios," Physical Review E, vol. 71,
no. 3, 2005.

C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, and M. Serna.
"Adversarial models for prioritybased networks,"
Networks, vol. 45, no. 1, pp. 135, 2005.

Antonio Fernández, Chryssis Georgiou, Alexander Russell,
and Alex A. Shvartsman. "The DoAll Problem with Byzantine
Processor Failures," Theoretical Computer Science, vol. 333, no. 3,
pp. 433454, 2005.

Mikel Larrea, Antonio Fernández, and Sergio Arévalo. "Eventually
Consistent Failure Detectors,'' Journal of Parallel and
Distributed Computing, vol. 65, pp. 361373, 2005.

Antonio Fernández, Ernesto Jiménez, and Vicent Cholvi. "On the
Interconnection of Causal Memory Systems,'' Journal of Parallel
and Distributed Computing, vol. 64, no. 4, pp. 498506, 2004.

Mikel Larrea, Antonio Fernández, and Sergio Arévalo. "On the
Implementation of Unreliable Failure Detectors in Partially
Synchronous Systems,'' IEEE Transactions on Computers, vol.53, no. 7,
pp. 815828, 2004.

C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, and M. Serna.
"The complexity of deciding stability under FFS in the Adversarial
Queueing model," Information Processing Letters, vol. 90, no. 5,
pp. 261266, 2004.

E. Anceaume, A. Fernández, A. Mostefaoui, G. Neiger, and M. Raynal.
"A Necessary and Sufficient Condition for Transforming Limited
Accuracy Failure Detectors,'' Journal of Computer and System
Sciences, vol. 68, pp. 123133, 2004.

Juan Echagüe, Vicent Cholvi, and Antonio Fernández. "Universal
Stability Results for Low Rate Adversaries in Packet Switched
Networks,'' IEEE Communications Letters, vol. 7, no. 12, December 2003.

Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, and Salil
Vadhan. "The Power of a Pebble: Exploring and Mapping Directed
Graphs," Information and Computation, vol. 176, no. 1, pp. 121,
July 2002.

Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Jon
Kleinberg, Tom Leighton, and Zhiyong Liu. "Universal Stability
Results and Performance Bounds for Greedy ContentionResolution
Protocols," Journal of the ACM, vol. 48, no. 1, pp. 3969,
2001.

Matthew Andrews, Antonio Fernández, Mor HarcholBalter, Tom
Leighton, and Lisa Zhang. "General dynamic routing with perpacket
delay guarantees of O(distance + 1/session rate)," SIAM Journal
on Computing, vol. 30, no. 5, pp. 15941623, 2000.

Kemal Efe, Adrienne Broadwater, and Antonio Fernández. "Embedding
Complete Binary Trees in Product Graphs," Telecommunication Systems,
vol. 13, no. 1, pp. 99109, 2000.

Antonio Fernández and Kemal Efe. "Generalized Algorithm for
Parallel Sorting on Product Networks," IEEE Transactions on
Parallel and Distributed Systems, vol. 8, no. 12,
pp. 12111225, dec 1997.

Antonio Fernández and Kemal Efe. "Efficient VLSI Layouts for
Homogeneous Product Networks," IEEE Transactions on Computers,
vol. 46, no. 10, pp. 10701082, oct 1997.

Kemal Efe and Antonio Fernández. "Mesh Connected Trees: A Bridge
between Grids and Meshes of Trees," IEEE Transactions on
Parallel and Distributed Systems, vol. 7, no. 12,
pp. 12831293, dec 1996.

Kemal Efe and Antonio Fernández. "Products of Networks with
Logarithmic Diameter and Fixed Degree," IEEE Transactions on
Parallel and Distributed Systems, vol. 6, no. 9, pp. 963975,
sep 1995.
Conference and Workshop Papers

Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves.
"Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks,"
6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks
and Autonomous Mobile Entities, ALGOSENSORS 2010,
Bordeaux, France,
July 5, 2010.
Lecture Notes in Computer Science, 2010, Volume 6451/2010, pp. 6273, 2010.
DOI: 10.1007/9783642169885_6

Antonio Fernández Anta, Miguel A. Mosteiro.
"Contention Resolution in MultipleAccess Channels: kSelection in Radio Networks,"
The 16th Annual International Computing and Combinatorics Conference, COCOON 2010,
Nha Trang, Vietnam,
July 1921.
Lecture Notes in Computer Science, 2010, Volume 6196/2010, pp. 378388,
DOI: 10.1007/9783642140310_41.

Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro.
"Algorithmic Mechanisms for Internetbased MasterWorker Computing with Untrusted and Selfish Workers,"
Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2010,
Atlanta, GA,
April 1922, 2010.
DOI: 10.1109/IPDPS.2010.5470409

Matthew Andrews, Antonio Fernández Anta, Lisa Zhang, Wenbo Zhao.
"Routing for Energy Minimization in the Speed Scaling Model,"
Proceedings of the 29th IEEE Conference on Computer Communications, INFOCOM 2010,
San Diego, CA, USA,
March 1519, 2010.
DOI: 10.1109/INFCOM.2010.5462071

Matthew Andrews, Antonio Fernández Anta, Lisa Zhang, Wenbo Zhao.
"Routing and Scheduling for Energy and Delay Minimization in the
Powerdown Model,"
Proceedings of the 29th IEEE Conference on Computer Communications, INFOCOM 2010,
San Diego, CA, USA,
March 1519, 2010.
DOI: 10.1109/INFCOM.2010.5462279

Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves.
``An Earlystopping Protocol for Computing Aggregate Functions in Sensor Networks,"
Proceedings of the 15th IEEE International Symposium
Pacific Rim Dependable Computing, PRDC 2009, Shanghai, China, 2009.

Antonio Fernández Anta, Sergio Rajsbaum, Corentin Travers. ``Brief Announcement: Weakest failure detectors via an egglaying simulation," The 28th Annual ACM SIGACTSIGOPS Symposium on the Principles of Distributed Computing, PODC 2009, Calgary, Canada, August 2009.

José Luis LópezPresa, Antonio Fernández Anta.
``Fast Algorithm for Graph Isomorphism Testing,"
The 8th International Symposium on Experimental Algorithms, SEA 2009,
Dortmund, Germany,
June 2009.
Lecture Notes in Computer Science, 2009, Volume 5526/2009, 221232, DOI: 10.1007/9783642020117_21.

Antonio Fernández Anta, Alessia Milani.
``Bounds for Deterministic Reliable Geocast in Mobile AdHoc Networks,"
The 12th International Conference on Principles of Distributed Systems, OPODIS 2008,
pp. 164183, Luxor, Egypt, December 2008.
Lecture Notes in Computer Science, 2008, Volume 5401/2008, 164183, DOI: 10.1007/9783540922216_12.

Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves.
``Brief Announcement: An Earlystopping Protocol for Computing Aggregate Functions in Sensor Networks,"
in
The 22nd International Symposium on Distributed Computing, DISC 2008,
Arcachon, France,
Sep. 2008.
Lecture Notes in Computer Science, 2008, Volume 5218/2008, 504506, DOI: 10.1007/9783540877790_38.

Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro.
``Designing Mechanisms for Reliable Internetbased Computing,"
in
The 7th IEEE International Symposium on Network Computing and Applications, IEEE NCA08,
Cambridge, MA, USA,
Jul. 2008.

Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves. ``Deterministic
Communication in the Weak Sensor Model," in 11th International Conference On Principles Of Distributed
Systems, OPODIS'07, Guadeloupe, French West Indies, December 1720th, 2007.
Lecture Notes in Computer Science, 2007, Volume 4878/2007, 119131, DOI: 10.1007/9783540770961_9.

Antonio Fernández Anta, Michel Raynal. ``From an intermittent rotating star to a
leader," in 11th International Conference On Principles Of Distributed
Systems, OPODIS'07, Guadeloupe, French West Indies, December 1720th, 2007.
Lecture Notes in Computer Science, 2007, Volume 4878/2007, 119131, DOI: 10.1007/9783540770961_9.

Antonio Fernández, Michel Raynal.
"Brief Announcement: From an Intermittent Rotating Star to a Leader," in
TwentySixth Annual ACM SIGACTSIGOPS Symposium on
Principles of Distributed Computing, PODC 2007,
Portland, OR, USA, August 2007.

Juan Céspedes, Antonio Fernández, José Luis LópezPresa, M. Araceli
Lorenzo, Pilar Manzano, Juan MartínezRomo, Alberto Mozo, Anna Puig, Agustín
Santos, Christopher Thraves.
"Performace of scheduling policies in adversarial networks with non
synchronized clocks," in
Proceedings of the IEEE Symposium on Computers and Communications,
ISCC'07, Aveiro, Portugal, July 2007.

Antonio Fernández,
Vincent Gramoli,
Ernesto Jiménez,
AnneMarie Kermarrec,
Michel Raynal.
"Distributed Slicing in Dynamic Systems," in
The 27th International Conference on Distributed Computing Systems, ICDCS
2007,
Toronto, Canada, June 2007.

Vicent Cholvi, Antonio Fernández, Luis López, Luis RoderoMerino.
"Using Random Walks to Find Resources in Unstructured SelfOrganized P2P
Networks," in
Workshop on Dependable Application Support in SelfOrganising Networks
(DASSON), DSN 2007, Edinburgh, UK, June 2007.

Antonio Fernández, Ernesto Jiménez, Michel Raynal.
"Electing an Eventual Leader in an Asynchronous Shared Memory System," in
The 37th Annual IEEE/IFIP International Conference on Dependable Systems
and Networks, DSN 2007,
Edinburgh, UK, june 2007.

Antonio Fernández, Ernesto Jiménez, Michel Raynal, Gilles Trédan.
"A Timing Assumption and a tResilient Protocol for Implementing an
Eventual Leader Service in Asynchronous Shared Memory Systems," in
The 10th IEEE International Symposium on Object/component/serviceoriented
Real Time Distributed Computing, ISORC 2007, Santorini, Greece, May 2007.

Luis Rodero, Luis López, Antonio Fernández, Vicent Cholvi.
"A Topology SelfAdaptation Mechanism for Efficient Resource
Location," in
The 2006 International Symposium on Parallel and Distributed Processing
and Applications, ISPA06,
Sorrento, Italy, Dec. 2006. Lecture Notes in Computer
Science, vol. 4330, Springer Verlag, 2006.

Antonio Fernández, Ernesto Jiménez and Sergio Arévalo.
"Minimal System Conditions to Implement
Unreliable Failure Detectors,"
in
Proceedings of the 12th IEEE International Symposium
Pacific Rim Dependable Computing, PRDC'06,
Riverside, USA, Dec 2006.

Antonio Fernández, Chryssis Georgiou, Luis López, Agustín Santos.
"Reliably Executing Tasks in the Presence of Untrusted Entities,"
in Proceedings of the IEEE Symposium on Reliable Distributed Systems, SRDS
2006, Leeds, UK, Oct 2006.

Antonio Fernández, Ernesto Jiménez, Michel Raynal.
"Eventual Leader Election with Weak Assumptions on
Initial Knowledge, Communication Reliability, and Synchrony,"
in Proceedings of the 2006 International Conference on Dependable Systems and
Networks, DSN 2006, pp. 166175, Philadelphia, PA, USA, Jun 2006. IEEE
Computer Society, 2006.

Luis Rodero, Luis López, Antonio Fernández, Vicent Cholvi.
"DANTE: A SelfAdapting PeertoPeer System,"
in Proceedings of the Fifth International Workshop on
Agents and PeertoPeer Computing, AP2PC 2006,
Hakodate, Japan, May 2006.

Antonio Fernández, Chryssis Georgiou, Luis López, Agustín Santos.
"Reliably Executing Tasks in the Presence of Malicious Processors,"
in Proceedings of the 19th International Conference on Distributed Computing,
DISC 2005, pp. 490492, Cracow, Poland, Sep 2005. Lecture Notes in Computer
Science, vol. 3724, Springer Verlag, 2005.

María J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L.
Martínez, Agustín Santos, María Serna. "Adversarial queueing model for
continuous network dynamics," in Proceedings of the 30th International Symposium on
Mathematical Foundations of Computer Science, MFCS 2005, pp. 145155, Gdansk,
Poland, AugSep
2005. Lecture Notes in Computer Science, vol. 3618, Springer Verlag, 2005.

Antonio Fernández, Ernesto Jiménez and Sergio Arévalo.
"Brief Announcement: Minimal System Conditions to Implement
Unreliable Failure Detectors,"
in
Proceedings of the 24th Annual ACM Symposium on Principles of
Distributed Computing, PODC 2005, Las Vegas, USA,
Jul 2005.

L. López, A. Fernández, and V. Cholvi.
"A Game Theoretic Analysis of Protocols Based on Fountain Codes"
in
Proceedings of the 10th IEEE Symposium on Computers and Communications, ISCC
2005, La Manga del Mar Menor, Cartagena, Spain, June 2005.

Vicent Cholvi, Antonio Fernández, Ernesto Jiménez, Michel Raynal.
"A Methodological Construction of an Efficient Sequential
Consistency Protocol," in Proceedings of the 3rd IEEE International Symposium on Network
Computing and Applications, NCA2004, Cambridge, Massachusetts, AugSep 2004.

Ernesto Jiménez, Antonio Fernández, and Vicente Cholvi. "Decoupled
Interconnection of Distributed Memory Models,'' in Proceedings of the 7th
International Conference on Principles of Distributed Systems, OPODIS 2003,
pp. 235246, La
Martinique, France, December 2003.
Lecture Notes in Computer Science, vol. 3144, Springer Verlag, 2004.

C. Álvarez, M. Blesa, J. Díaz, A. Fernández, and
M. Serna. "Adversarial models for prioritybased networks,'' in 28th International Symposium on Mathematical Foundations of Computer
Science, MFCS 2003, pp.142151, Bratislava, Slovak Republic, August 2003.
Lecture Notes in Computer Science, vol. 2747, Springer Verlag, 2003.

Antonio Fernández and Chryssis Georgiou. "The DoAll Problem with
Byzantine Processor Failures,'' in Proceedings of the 10th
Colloquium on Structural Information and Communication Complexity,
SIROCCO 2003, Umea, Sweden, June 2003.

Antonio Fernández, Mikel Larrea, and Sergio Arévalo. "A Sufficient
Condition to Transform <>S into <>P in Asynchronous Systems," in
Brief Announcements of the 16th International Symposium on
Distributed Computing, DISC 2002, Toulouse, France, Oct 2002.

Mikel Larrea, Antonio Fernández, and Sergio Arévalo. "Eventually
Consistent Failure Detectors," in 10th Euromicro Workshop on Parallel,
Distributed and Networkbased Processing, PDP2002, Gran Canaria
Island, Spain, Jan 2002.

Mikel Larrea, Antonio Fernández, and Sergio Arévalo. "On the
Impossibility of Implementing Perpetual Failure Detectors in Partially
Synchronous Systems," in 10th Euromicro Workshop on Parallel,
Distributed and Networkbased Processing, PDP2002, Gran Canaria
Island, Spain, Jan 2002.

Ernesto Jimenez, Antonio Fernández, and Vicente Cholvi. "A
Parametrized Algorithm that Implements Sequential, Causal, and Cache
Memory Consistency," in 10th Euromicro Workshop on Parallel,
Distributed and Networkbased Processing, PDP2002, Gran Canaria
Island, Spain, Jan 2002.

Matthew Andrews, Antonio Fernández, Ashish Goel, and Lisa Zhang,
"Source Routing and Scheduling in Packet Networks," in Proceedings of the 42th IEEE Annual Symposium on Foundations of
Computer Science, FOCS 2001, Las Vegas, Nevada, Oct 2001.

Ernesto Jimenez, Antonio Fernández, and Vicente Cholvi. "A Parametrized
Algorithm that Implements Sequential, Causal, and Cache Memory
Consistency," in Brief Announcements of the 15th International
Symposium on Distributed Computing, DISC 2001, Lisbon, Portugal, Oct
2001.

Mikel Larrea, Antonio Fernández, and Sergio Arévalo. "On the
Impossibility of Implementing Perpetual Failure Detectors in Partially
Synchronous Systems," in Brief Announcements of the 15th
International Symposium on Distributed Computing, DISC 2001, Lisbon,
Portugal, Oct 2001.

Mikel Larrea, Antonio Fernández, and Sergio Arévalo. "Eventually
Consistent Failure Detectors," SPAA review, in Proceedings of the
13th Symposium on Parallel Algorithms and Architectures, SPAA 2001,
pp. 326327, Crete Island, Greece, Jul 2001.

Antonio Fernández, Tom Leighton, and José Luis LópezPresa. "Containment
Properties of Product and Power Graphs,'' in Proceedings of the
Brazilian Symposium on Graphs, Algorithms and Combinatorics, GRACO
2001,
Fortaleza, Brasil, Mar 2001.
Electronic Notes in Discrete Mathematics, vol. 7,
2001.

Mikel Larrea, Antonio Fernández, and Sergio Arévalo. "Eventually
Consistent Failure Detectors," in Brief Announcements of the 14th
International Symposium on Distributed Computing, DISC 2000, pp. 14,
Toledo, Spain, Oct 2000.

Mikel Larrea, Antonio Fernández, and Sergio Arévalo. "Optimal
Implementation of the Weakest Failure Detector for Solving Consensus,"
in Proceedings of the 19th IEEE Symposium on Reliable Distributed
Systems, SRDS 2000, pp. 5259, Nürnberg, Germany, Oct 2000.

Antonio Fernández, Ernesto Jiménez and Vicente Cholvi. "On the
Interconnection of Causal Memory Systems," in Proceedings of
the 19th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2000, pp. 163170, Portland, OR, Jul 2000.

Mikel Larrea, Antonio Fernández, and Sergio Arévalo. "Brief
Announcement: Optimal Implementation of the Weakest Failure Detector
for Solving Consensus," in 19th Annual ACM Symposium on
Principles of Distributed Computing, PODC 2000, pp. 334, Portland,
OR, Jul 2000.

Mikel Larrea, Sergio Arévalo, and Antonio Fernández. "Efficient
Algorithms to Implement Unreliable Failure Detectors in Partially
Synchonous Systems," in Proceedings of the 13th International
Symposium on Distributed Computing, DISC'99, pp. 3448,
Bratislava, Slovak Rep., Lecture Notes in Computer Science,
vol. 1693, Springer Verlag, sep 1999.

Antonio Fernández. "On the Isolation of Several WorkConserving
Scheduling Policies," in Proceedings of the Eight
International Conference on Computer Communications and Networks,
ICCCN'99, pp. 188192, Boston, EE.UU., oct 1999.

Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, and Salil
Vadhan. "The Power of a Pebble: Exploring and Mapping Directed
Graphs," in Proceedings of the 30th Annual ACM Symposium on
Theory of Computing, STOC'98, Dallas, Texas, pp. 269278, may 1998.

Matthew Andrews, Antonio Fernández, Mor HarcholBalter, Tom
Leighton, and Lisa Zhang, "General dynamic routing
with perpacket delay guarantees of O(distance + 1/session
rate)," in Proceedings of the 38th IEEE Annual Symposium on
Foundations of Computer Science, FOCS'97, Miami Beach, Florida,
pp. 294302, oct 1997.

Antonio Fernández, Kemal Efe, Adrienne L. Broadwater, M. Araceli
Lorenzo, and Daniel Calzada. "A Unified Approach to Algorithm
Development for Product Networks," in Book of Abstracts of the
11th International Conference on Mathematical and Computer
Modelling and Scientific Computing, Washington, DC, pp. 102, mar
1997.

Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Jon
Kleinberg, Tom Leighton, and Zhiyong Liu. "Universal
Stability Results for Greedy ContentionResolution Protocols," in
Proceedings of the 37th IEEE Annual Symposium on Foundations of
Computer Science, FOCS'96, Burlington, Vermont,
pp. 380389, oct 1996.

Adrienne Broadwater, Kemal Efe, and Antonio Fernández. "Embedding
Complete Binary Trees in Product Graphs," in Proceedings of the
22nd International Workshop on GraphTheoretic Concepts in
Computer Science, WG'96, Como, Italy, pp. 5666, jun 1996.
Lecture Notes in Computer Science, vol. 1197, Springer Verlag, 1997.

Antonio Fernández, Nancy Eleser, and Kemal Efe. "Generalized
Algorithm for Parallel Sorting on Product Networks," in Proceedings of the 1995 International Conference on Parallel
Processing, ICPP'95, vol. III, Oconomowoc, Wisconsin,
pp. 155159, aug 1995.

Antonio Fernández and Kemal Efe. "Bounds on the VLSI Layout
Complexity of Homogeneous Product Networks," in Proceedings of
the 1994 International Symposium on Parallel Architectures,
Algorithms, and Networks, ISPAN'94, Kanazawa, Japan, pp. 4148,
dec 1994.

Kemal Efe and Antonio Fernández. "Computational Properties of
Mesh Connected Trees: Versatile Architectures for Parallel
Computing," in Proceedings of the 1994 International Conference
on Parallel Processing, ICPP'94, vol. I, St. Charles, Illinois,
pp. 7276, aug 1994.

Rubén Ceacero González and Antonio Fernández Anta.
"Autentificación y comunicación segura en Internet entre servidores
y clientes FTP," in Actas de la V Reunión Española sobre
Criptología y Seguridad de la Información, Málaga, sep
1998.
Patents

Daniel Matthew Andrews, Yihao Zhang, Antonio Fernandez.
"Network Scheduling for Energy Efficiency",
12/723,116 (application number), USA, March 2010.
Theses

Homogeneous Product Networks for Processor Interconnection, PhD
Thesis, CACS, U. of Louisiana at Lafayette, 1994.
Technical Reports

Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks.
"Opportunistic Information Dissemination in Mobile Adhoc Networks: The Profit of Global Synchrony",
Reports on Systems and Communications,
vol. 10, no. 1
(RoSaC20101), 2010.

Esther M. Arkin, Antonio Fernandez Anta, Joseph S.B. Mitchell, Miguel A. Mosteiro
The Length of the Longest Edge in Multidimensional Delaunay Graphs
Reports on Systems and Communications,
vol. 10, no. 2
(RoSaC20102), 2010.
Go Top