Antonio Fernández

Affiliations:
  • Institute IMDEA Networks, Madrid, Spain
  • Universidad Rey Juan Carlos, Madrid, Spain
  • Escuela Universitaria de Informatica, Madid, Spain


According to our database1, Antonio Fernández authored at least 190 papers between 1994 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Situational Collective Perception: Adaptive and Efficient Collective Perception in Future Vehicular Systems.
Proceedings of the 8th International Conference on Vehicle Technology and Intelligent Transport Systems, 2022

2021
Principles of Blockchain Systems
Synthesis Lectures on Computer Science, Morgan & Claypool Publishers, 2021

How resilient is the open web to the COVID-19 pandemic?
Telematics Informatics, 2021

Superintelligence Cannot be Contained: Lessons from Computability Theory.
J. Artif. Intell. Res., 2021

The CoronaSurveys System for COVID-19 Incidence Data Collection and Processing.
Frontiers Comput. Sci., 2021

Tractable low-delay atomic memory.
Distributed Comput., 2021

Maria Serna's contributions to adversarial queuing theory.
Comput. Sci. Rev., 2021

MonTrees: Automated Detection and Classification of Networking Anomalies in Cellular Networks.
CoRR, 2021

Estimating Active Cases of COVID-19.
CoRR, 2021

Fragmented Objects: Boosting Concurrency of SharedLarge Objects.
CoRR, 2021

A Fair and Scalable Mechanism for Resource Allocation: The Multilevel QPQ Approach.
IEEE Access, 2021

System Stability Under Adversarial Injection of Dependent Tasks.
IEEE Access, 2021

TTrees: Automated Classification of Causes of Network Anomalies with Little Data.
Proceedings of the 22nd IEEE International Symposium on a World of Wireless, 2021

Fragmented Objects: Boosting Concurrency of Shared Large Objects.
Proceedings of the Structural Information and Communication Complexity, 2021

Abstracting Networks with Measurable Guarantees.
Proceedings of the IFIP Networking Conference, 2021

Byzantine-Tolerant Distributed Grow-Only Sets: Specification and Applications.
Proceedings of the 4th International Symposium on Foundations and Applications of Blockchain 2021, 2021

Chirotonia: A Scalable and Secure e-Voting Framework based on Blockchains and Linkable Ring Signatures.
Proceedings of the 2021 IEEE International Conference on Blockchain, 2021

2020
Optimizing mmWave Wireless Backhaul Scheduling.
IEEE Trans. Mob. Comput., 2020

CoronaSurveys: Using Surveys with Indirect Reporting to Estimate the Incidence and Evolution of Epidemics.
CoRR, 2020

Appending Atomically in Byzantine Distributed Ledgers.
CoRR, 2020

Routing in Generalized Geometric Inhomogeneous Random Graphs - (Extended Abstract).
Proceedings of the Networked Systems - 8th International Conference, 2020

Hide Me: Enabling Location Privacy in Heterogeneous Vehicular Networks.
Proceedings of the Networked Systems - 8th International Conference, 2020

Stability Under Adversarial Injection of Dependent Tasks (Extended Abstract).
Proceedings of the Networked Systems - 8th International Conference, 2020

A Novel Methodology for the Automated Detection and Classification of Networking Anomalies.
Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Atomic Appends in Asynchronous Byzantine Distributed Ledgers.
Proceedings of the 16th European Dependable Computing Conference, 2020

2019
A Novel Hyperparameter-Free Approach to Decision Tree Construction That Avoids Overfitting by Design.
IEEE Access, 2019

Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Atomic Appends: Selling Cars and Coordinating Armies with Multiple Distributed Ledgers.
Proceedings of the International Conference on Blockchain Economics, 2019

Dynamic Vehicle Path-Planning in the Presence of Traffic Events.
Proceedings of the 44th IEEE Conference on Local Computer Networks, 2019

Tales from the Porn: A Comprehensive Privacy Analysis of the Web Porn Ecosystem.
Proceedings of the Internet Measurement Conference, 2019

2018
Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees.
ACM Trans. Parallel Comput., 2018

Formalizing and Implementing Distributed Ledger Objects.
SIGACT News, 2018

Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentation.
Future Gener. Comput. Syst., 2018

A distributed and quiescent max-min fair algorithm for network congestion control.
Expert Syst. Appl., 2018

ATMoN: Adapting the "Temporality" in Large-Scale Dynamic Networks.
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

2017
Adaptive packet scheduling over a wireless channel under constrained jamming.
Theor. Comput. Sci., 2017

Energy-optimal collaborative file distribution in wired networks.
Peer-to-Peer Netw. Appl., 2017

Network simplification preserving bandwidth and routing capabilities.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Reliable capacity provisioning for distributed cloud/edge/fog computing applications.
Proceedings of the 2017 European Conference on Networks and Communications, 2017

2016
Distributed Slicing in Dynamic Systems.
IEEE Trans. Parallel Distributed Syst., 2016

Measuring the impact of adversarial errors on packet scheduling strategies.
J. Sched., 2016

HDEER: A Distributed Routing Scheme for Energy-Efficient Networking.
IEEE J. Sel. Areas Commun., 2016

Power-efficient assignment of virtual machines to physical machines.
Future Gener. Comput. Syst., 2016

Online Distributed Scheduling on a Fault-prone Parallel System.
CoRR, 2016

Traceable Objects: Consistent Versioning for Concurrent Objects.
CoRR, 2016

Fair linking mechanisms for resource allocation with correlated player types.
Computing, 2016

Empirical comparison of power-efficient virtual machine assignment algorithms.
Comput. Commun., 2016

Resource location based on precomputed partial random walks in dynamic networks.
Comput. Networks, 2016

Multi-round Master-Worker Computing: A Repeated Game Approach.
Proceedings of the 35th IEEE Symposium on Reliable Distributed Systems, 2016

Computationally Light "Multi-Speed" Atomic Memory.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Internet Computing: Using Reputation to Select Workers from a Pool.
Proceedings of the Networked Systems - 4th International Conference, 2016

Cover-ability: Consistent versioning in asynchronous, fail-prone, message-passing environments.
Proceedings of the 15th IEEE International Symposium on Network Computing and Applications, 2016

Evaluating reliability techniques in the master-worker paradigm.
Proceedings of the 15th IEEE International Symposium on Network Computing and Applications, 2016

The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Keynote I.
Proceedings of the 7th International Conference on Ambient Systems, 2016

2015
Efficient Interlayer Network Codes for Fair Layered Multicast Streaming.
IEEE/ACM Trans. Netw., 2015

Online parallel scheduling of non-uniform tasks: Trading failures for energy.
Theor. Comput. Sci., 2015

A Measurement-Based Characterization of the Energy Consumption in Data Center Servers.
IEEE J. Sel. Areas Commun., 2015

Failure detectors in homonymous distributed systems (with an application to consensus).
J. Parallel Distributed Comput., 2015

Node sampling using Random Centrifugal Walks.
J. Comput. Sci., 2015

Empirical Comparison of Graph-based Recommendation Engines for an Apps Ecosystem.
Int. J. Interact. Multim. Artif. Intell., 2015

Multi-resource Energy-efficient Routing in Cloud Data Centers with Networks-as-a-Service.
CoRR, 2015

A Mechanism for Fair Distribution of Resources with Application to Sponsored Search.
CoRR, 2015

Improving resource location with locally precomputed partial random walks.
Computing, 2015

Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions.
Comput. Geom., 2015

Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation.
Proceedings of the Adaptive Resource Management and Scheduling for Cloud Computing, 2015

Making "Fast" Atomic Operations Computationally Tractable.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Packet Scheduling over a Wireless Channel: AQT-Based Constrained Jamming.
Proceedings of the Networked Systems - Third International Conference, 2015

Multi-resource energy-efficient routing in cloud data centers with network-as-a-service.
Proceedings of the 2015 IEEE Symposium on Computers and Communication, 2015

Adaptive Scheduling Over a Wireless Channel Under Constrained Jamming.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Bisection (Band)Width of Product Networks with Application to Data Centers.
IEEE Trans. Parallel Distributed Syst., 2014

Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing.
IEEE Trans. Computers, 2014

Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph.
J. Appl. Math., 2014

Graph-based Techniques for Topic Classification of Tweets in Spanish.
Int. J. Interact. Multim. Artif. Intell., 2014

JAM: A Tabu-Based Two-Stage Simulated Annealing Algorithm for the Multidimensional Arrangement Problem.
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014

A measurement-based analysis of the energy consumption of data center servers.
Proceedings of the Fifth International Conference on Future Energy Systems, 2014

2013
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound).
Theor. Comput. Sci., 2013

A hop-by-hop energy efficient distributed routing scheme.
SIGMETRICS Perform. Evaluation Rev., 2013

Sentiment Analysis and Topic Detection of Spanish Tweets: A Comparative Study of of NLP Techniques.
Proces. del Leng. Natural, 2013

Implementing the weakest failure detector for solving the consensus problem.
Int. J. Parallel Emergent Distributed Syst., 2013

Routing and scheduling for energy and delay minimization in the powerdown model.
Networks, 2013

An early-stopping protocol for computing aggregate functions in Sensor Networks.
J. Parallel Distributed Comput., 2013

Power-efficient Assignment of Virtual Machines to Physical Machines
CoRR, 2013

Routing for Energy Minimization with Discrete Cost Functions
CoRR, 2013

Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion.
CoRR, 2013

Applying the dynamics of evolution to achieve reliability in master-worker computing.
Concurr. Comput. Pract. Exp., 2013

Unbounded Contention Resolution in Multiple-Access Channels.
Algorithmica, 2013

Novel Techniques for Automorphism Group Computation.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Reputation-Based Mechanisms for Evolutionary Master-Worker Computing.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

Station Assignment with Applications to Sensing.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Routing for Power Minimization in the Speed Scaling Model.
IEEE/ACM Trans. Netw., 2012

Deterministic recurrent communication in restricted Sensor Networks.
Theor. Comput. Sci., 2012

Reliable Internet-Based Master-Worker Computing in the Presence of Malicious Workers.
Parallel Process. Lett., 2012

A model of self-avoiding random walks for searching complex networks.
Networks, 2012

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony.
Distributed Comput., 2012

Quid Pro Quo: A Mechanism for Fair Collaboration in Networked Systems
CoRR, 2012

Brief Announcement: Node Sampling Using Centrifugal Random Walks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Energy-Efficient Network Routing with Discrete Cost Functions.
Proceedings of the Theory and Applications of Models of Computation, 2012

Resource location based on partial random walks in networks with resource dynamics.
Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Greening the Internet: Energy-Optimal File Distribution.
Proceedings of the 11th IEEE International Symposium on Network Computing and Applications, 2012

SLBN: A Scalable Max-min Fair Algorithm for Rate-Based Explicit Congestion Control.
Proceedings of the 11th IEEE International Symposium on Network Computing and Applications, 2012

Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Rate allocation for layered multicast streaming with inter-layer network coding.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011
The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost.
Theor. Comput. Sci., 2011

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks.
Theory Comput. Syst., 2011

A Simple Analytical Model for Energy Efficient Ethernet.
IEEE Commun. Lett., 2011

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks.
Discret. Math. Theor. Comput. Sci., 2011

Greening File Distribution: Centralized or Distributed?
CoRR, 2011

Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation
CoRR, 2011

Distance-based Node Sampling using Drifting Random Walks
CoRR, 2011

Fast Isomorphism Testing of Graphs with Regularly-Connected Components
CoRR, 2011

Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm.
Proceedings of The Tenth IEEE International Symposium on Networking Computing and Applications, 2011

Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication.
Proceedings of The Tenth IEEE International Symposium on Networking Computing and Applications, 2011

Introduction.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010
From an Asynchronous Intermittent Rotating Star to an Eventual Leader.
IEEE Trans. Parallel Distributed Syst., 2010

Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony.
J. Comput. Sci. Technol., 2010

Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks.
Discret. Math. Algorithms Appl., 2010

Performance of random walks in one-hop replication networks.
Comput. Networks, 2010

A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory.
Comput. J., 2010

A Timing Assumption and Two <i>t</i>-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems.
Algorithmica, 2010

Biased Selection for Building Small-World Networks.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Routing for Energy Minimization in the Speed Scaling Model.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Contention Resolution in Multiple-Access Channels: <i>k</i>-Selection in Radio Networks.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
Adversarial Queueing Model for Continuous Network Dynamics.
Theory Comput. Syst., 2009

Interconnection of distributed memory models.
J. Parallel Distributed Comput., 2009

Self-managed topologies in P2P networks.
Comput. Networks, 2009

Fast Algorithm for Graph Isomorphism Testing.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Brief announcement: weakest failure detectors via an egg-laying simulation.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
A parametrized algorithm that implements sequential, causal, and cache memory consistencies.
J. Syst. Softw., 2008

On the interconnection of message passing systems.
Inf. Process. Lett., 2008

Optimal switch location in mobile communication networks using hybrid genetic algorithms.
Appl. Soft Comput., 2008

Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Designing Mechanisms for Reliable Internet-based Computing.
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

2007
A generic theoretical framework for modeling gossip-based algorithms.
ACM SIGOPS Oper. Syst. Rev., 2007

A game theoretic comparison of TCP and digital fountain based protocols.
Comput. Networks, 2007

From an intermittent rotating star to a leader.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Deterministic Communication in the Weak Sensor Model.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

A Timing Assumption and a t-Resilient Protocol for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems.
Proceedings of the Tenth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2007), 2007

Performance of scheduling policies in adversarial networks with non synchronized clocks.
Proceedings of the 12th IEEE Symposium on Computers and Communications (ISCC 2007), 2007

Electing an Eventual Leader in an Asynchronous Shared Memory System.
Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2007

2006
A survey of autonomic communications.
ACM Trans. Auton. Adapt. Syst., 2006

Implementing unreliable failure detectors with unknown membership.
Inf. Process. Lett., 2006

Reliably Executing Tasks in the Presence of Untrusted Entities.
Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems (SRDS 2006), 2006

Minimal System Conditions to Implement Unreliable Failure Detectors.
Proceedings of the 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2006), 2006

A Topology Self-adaptation Mechanism for Efficient Resource Location.
Proceedings of the Parallel and Distributed Processing and Applications, 2006

DANTE: A Self-adapting Peer-to-Peer System.
Proceedings of the Agents and Peer-to-Peer Computing - 5th International Workshop, 2006

2005
A mathematical model for the TCP Tragedy of the Commons.
Theor. Comput. Sci., 2005

The Do-All problem with Byzantine processor failures.
Theor. Comput. Sci., 2005

Adversarial models for priority-based networks.
Networks, 2005

Eventually consistent failure detectors.
J. Parallel Distributed Comput., 2005

Source routing and scheduling in packet networks.
J. ACM, 2005

Reliably Executing Tasks in the Presence of Malicious Processors.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Brief announcement: minimal system conditions to implement unreliable failure detectors.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Adversarial Queueing Model for Continuous Network Dynamics.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

A Game Theoretic Analysis of Protocols Based on Fountain Codes.
Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), 2005

2004
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems.
IEEE Trans. Computers, 2004

On the interconnection of causal memory systems.
J. Parallel Distributed Comput., 2004

A necessary and sufficient condition for transforming limited accuracy failure detectors.
J. Comput. Syst. Sci., 2004

The complexity of deciding stability under FFS in the Adversarial Queueing model.
Inf. Process. Lett., 2004

A Methodological Construction of an Efficient Sequential Consistency Protocol.
Proceedings of the 3rd IEEE International Symposium on Network Computing and Applications (NCA 2004), 30 August, 2004

2003
Universal stability results for low rate adversaries in packet switched networks.
IEEE Commun. Lett., 2003

The Do-All Problem with Byzantine Processor Failures.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Decoupled Interconnection of Distributed Memory Models.
Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

2002
The Power of a Pebble: Exploring and Mapping Directed Graphs.
Inf. Comput., 2002

On the Impossibility of Implementing Perpetual Failure Detectors in Partially Synchronous Systems.
Proceedings of the 10th Euromicro Workshop on Parallel, 2002

A Parametrized Algorithm that Implements Sequential, Causal, and Cache Memory Consistency.
Proceedings of the 10th Euromicro Workshop on Parallel, 2002

2001
Universal-stability results and performance bounds for greedy contention-resolution protocols.
J. ACM, 2001

Containment Properties of Product and Power Graphs.
Electron. Notes Discret. Math., 2001

2000
Embedding complete binary trees in product graphs.
Telecommun. Syst., 2000

General Dynamic Routing with Per-Packet Delay Guarantees of <i>O</i>(Distance + 1/Session Rate).
SIAM J. Comput., 2000

Optimal Implementation of the Weakest Failure Detector for Solving Consensus.
Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems, 2000

Optimal implementation of the weakest failure detector for solving consensus (brief announcement).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems.
Proceedings of the Distributed Computing, 1999

On the isolation of several work-conserving scheduling policies.
Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1999), 1999

1997
Generalized Algorithm for Parallel Sorting on Product Networks.
IEEE Trans. Parallel Distributed Syst., 1997

Efficient VLSI Layouts for Homogeneous Product Networks.
IEEE Trans. Computers, 1997

General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate).
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees.
IEEE Trans. Parallel Distributed Syst., 1996

Universal Stability Results for Greedy Contention-Resolution Protocols.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
Products of Networks with Logarithmic Diameter and Fixed Degree.
IEEE Trans. Parallel Distributed Syst., 1995

Generalized Algorithm for Parallel Sorting on Product Networks.
Proceedings of the 1995 International Conference on Parallel Processing, 1995

1994
Bounds on the VLSI layout complexity of homogeneous product networks.
Proceedings of the International Symposium on Parallel Architectures, 1994

Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation.
Proceedings of the 1994 International Conference on Parallel Processing, 1994


  Loading...