Miguel A. Mosteiro

Orcid: 0000-0001-5842-6256

According to our database1, Miguel A. Mosteiro authored at least 65 papers between 2006 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Verifiable Crowd Computing: Coping with bounded rationality.
Theor. Comput. Sci., 2024

Algebraic Computations in Anonymous VANET.
Proceedings of the Networked Systems - 12th International Conference, 2024

Distributed Station Assignment Through Learning.
Proceedings of the Networked Systems - 12th International Conference, 2024

2023
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model.
Theory Comput. Syst., October, 2023

Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model.
Theory Comput. Syst., August, 2023

Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks.
ACM Trans. Parallel Comput., June, 2023

Graph Ranking and the Cost of Sybil Defense.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary Interference.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework.
Theor. Comput. Sci., 2022

Polynomial anonymous dynamic distributed computing without a unique leader.
J. Comput. Syst. Sci., 2022

Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity.
CoRR, 2022

2021
Dynamic Windows Scheduling with Reallocation.
ACM J. Exp. Algorithmics, 2021

Supervised Average Consensus in Anonymous Dynamic Networks.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Time and Communication Complexity of Leader Election in Anonymous Networks.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

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

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.
J. ACM, 2020

Generic Framework for Optimization of Local Dissemination in Wireless Networks.
Proceedings of the Networked Systems - 8th International Conference, 2020

Heuristically Speeding up Anonymous Dynamic Network Computations.
Proceedings of the IEEE International Conference on Parallel & Distributed Processing with Applications, 2020

2019
Station Assignment with Reallocation.
Algorithmica, 2019

mmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

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

Closure Operators and Spam Resistance for PageRank.
CoRR, 2018

A Faster Exact-Counting Protocol for Anonymous Dynamic Networks.
Algorithmica, 2018

2017
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution.
Distributed Comput., 2017

Ad-hoc Affectance-selective Families for Layer Dissemination.
CoRR, 2017

Ad-Hoc Affectance-Selective Families for Layer Dissemination.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem.
Proceedings of the 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC), 2017

Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets: Poster Abstract.
Proceedings of the Second International Conference on Internet-of-Things Design and Implementation, 2017

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

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

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

Counting in Practical Anonymous Dynamic Networks is Polynomial.
Proceedings of the Networked Systems - 4th International Conference, 2016

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

Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model.
Algorithmica, 2015

Station Assignment with Reallocation.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

A Faster Counting Protocol for Anonymous Dynamic Networks.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

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

Dynamic multiple-message broadcast: bounding throughput in the affectance model.
Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, 2014

2013
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound).
Theor. Comput. Sci., 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

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

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
Deterministic recurrent communication in restricted Sensor Networks.
Theor. Comput. Sci., 2012

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

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

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

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

2011
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks.
Discret. Math. Theor. Comput. Sci., 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

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

2010
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks.
Discret. Math. Algorithms Appl., 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

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
Bootstrapping a hop-optimal network in the weak sensor model.
ACM Trans. Algorithms, 2009

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

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

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

Sensor Network Gossiping or How to Break the Broadcast Lower Bound.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
Insertion Sort is O(n log n).
Theory Comput. Syst., 2006

Lower Bounds for Clear Transmissions in Radio Networks.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006


  Loading...