Miguel A. Mosteiro
Refereed Publications (newest first)

Powerefficient Assignment of Virtual Machines to Physical Machines.
(Joint work with J. ArjonaAroca, A. FernándezAnta, C. Thraves, and L. Wang.)
In Future Generation Computer Systems (FGCS),
© Elsevier,
2015.
[DOI,
bibtex,
pdf]

Algorithmic Mechanisms for Reliable Crowdsourcing Computation under
Collusion
(Joint work with A. FernándezAnta, C. Georgiou, and D. Pareja.)
In Public Library of Science One
(PLOS
ONE),
2015.
[DOI,bibtex,pdf]

Initialiazing Sensor Networks of Nonuniform Density in The Weak Sensor Model.
(Joint work with M. FarachColton.)
In Algorithmica
(Algorithmica),
© Springer,
2015.
[DOI,
bibtex,
pdf]

Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in dDimensions
(Joint work with E. M. Arkin, A. FernándezAnta, and J. S. B. Mitchell.)
In Computational Geometry: Theory and Applications (CGTA),
© Elsevier,
2015.
[DOI,
bibtex,
pdf]

Dynamic Multiplemessage Broadcast: Bounding Throughput in the Affectance Model.
(Joint work with D. R. Kowalski and T. Rouse.)
In Proc. of the 10th ACM International Workshop on Foundations of
Mobile Computing (FOMC
2014 @ MobiHoc 2014) ,
© ACM, 2014.
[DOI,
bibtex,
pdf]

Powerefficient Assignment of Virtual Machines to Physical Machines.
(Joint work with J. ArjonaAroca, A. FernándezAnta, C. Thraves, and L. Wang.)
In Proc. of the 1st ACM Workshop on Adaptive Resource Management and
Scheduling for Cloud Computing (ARMSCC 2014 @
PODC 2014),
in Lecture Notes in Computer Science, © SpringerVerlag,
2014.
[DOI,
bibtex,
pdf]

Dynamic Windows Scheduling with Reallocation
(Joint work with M. FarachColton, K. Leal, and C. Thraves.)
In Proc. of the 13th International Symposium on Experimental
Algorithms (SEA 2014),
in Lecture Notes in Computer Science, © SpringerVerlag,
2014.
[DOI,
bibtex,
pdf]

Algorithmic Mechanisms for Reliable MasterWorker Internetbased Computing.
(Joint work with E. Christoforou, A. FernándezAnta, and C. Georgiou.)
In Transactions on Computers
(TC),
© IEEE,
2014.
[DOI,
bibtex,
pdf]

Reputationbased Mechanisms for Evolutionary MasterWorker Computing.
(Joint work with E. Christoforou, A. FernándezAnta, C. Georgiou, and A. Sánchez.)
In Proc. of the 17th International Conference On Principles Of
Distributed Systems (OPODIS 2013),
in Lecture Notes in Computer Science, © SpringerVerlag,
2013.
[DOI,
bibtex,
pdf]

Station Assignment with Applications to Sensing.
(Joint work with A. FernándezAnta, D. R. Kowalski, and P. Wong.)
In Proc. of the 9th Intl. Symp. on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics (ALGOSENSORS 2013),
in Lecture Notes in Computer Science, © SpringerVerlag,
2013.
[DOI,
bibtex,
pdf]

Unbounded Contention Resolution in MultipleAccess Channels.
(Joint work with A. FernándezAnta and J.RamónMuñoz.)
In Algorithmica
(Algorithmica),
© Springer,
2013.
[DOI,
bibtex,
pdf]

Applying the dynamics of evolution to achieve reliability in masterworker computing.
(Joint work with E. Christoforou, A. FernándezAnta, C. Georgiou, and A. Sánchez.)
In Concurrency and Computation: Practice and Experience
(CCPE),
© Wiley,
2013.
[DOI,
bibtex,
pdf]

Crowd computing as a cooperation problem: an evolutionary approach.
(Joint work with E. Christoforou, A. FernándezAnta, C. Georgiou, and A. Sánchez.)
In Journal of Statistical Physics
(JSP),
© Springer,
2013.
[DOI,
bibtex,
pdf]

Optimal Memoryaware Sensor Network Gossiping.
(Joint work with M. FarachColton and A. FernándezAnta.)
In Theoretical Computer Science
(TCS),
© Elsevier,
2013.
[DOI,
bibtex,
pdf]

An Earlystopping Protocol for Computing Aggregate Functions in Sensor Networks.
(Joint work with A. FernándezAnta and C. Thraves.)
In Journal of Parallel and Distributed Computing
(JPDC),
© Elsevier,
2013.
[DOI,
bibtex,
pdf]

Achieving Reliability in Masterworker Computing via Evolutionary Dynamics.
(Joint work with E. Christoforou, A. FernándezAnta, C. Georgiou, M. A. Mosteiro and A. Sánchez.)
In Proceedings of the 18th International European Conference on Parallel and Distributed Computing (EuroPar 2012),
in Lecture Notes in Computer Science, © SpringerVerlag,
2012.
[DOI,
bibtex,
pdf]

Brief Announcement: Achieving Reliability in Masterworker Computing via Evolutionary Dynamics.
(Joint work with E. Christoforou, A. FernándezAnta, C. Georgiou, and A. Sánchez.)
In Proceedings of the 31st Annual ACM SIGACTSIGOPS Symposium on
Principles of Distributed Computing (PODC 2012),
© ACM, 2012.
[DOI,
bibtex,
pdf]

Probabilistic Lower Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in a dBall.
In Proceedings of the 28th European Workshop on Computational Geometry (EuroCG 2012).
[DOI,
bibtex,
pdf]

Opportunistic Information Dissemination in Mobile Adhoc Networks: The Profit of Global Synchrony.
(Joint work with A. FernándezAnta, A. Milani, and S. Zaks.)
In Distributed Computing
(DC),
© Springer,
2012.
[DOI,
bibtex,
pdf]

Opportunistic Information Dissemination in Mobile Adhoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
(Joint work with M. FarachColton, A. FernándezAnta, A. Milani, and S. Zaks.)
In Proceedings of the 10th Latin American Theoretical Informatics Symposium (LATIN 2012),
in Lecture Notes in Computer Science, © SpringerVerlag,
2012.
[DOI,
bibtex,
pdf]

Deterministic Recurrent Communication in Restricted Sensor Networks.
(Joint work with A. FernándezAnta and C. Thraves.)
In Theoretical Computer Science
(TCS),
© Elsevier,
2012.
[DOI,
bibtex,
pdf]

FaultTolerant Aggregation: Flow Updating Meets Mass Distribution.
(Joint work with P. S. Almeida, C. Baquero, M. FarachColton, and P. Jesus.)
In Proceedings of the 15th International Conference On Principles Of Distributed Systems (OPODIS 2011),
in Lecture Notes in Computer Science, © SpringerVerlag,
2011.
[DOI,
bibtex,
pdf]

Unbounded Contention Resolution in MultipleAccess Channels.
(Joint work with A. FernándezAnta and J. RamónMuñoz.)
In Proceedings of the 25th International Symposium on Distributed Computing (DISC 2011),
in Lecture Notes in Computer Science, © SpringerVerlag,
2011.
[DOI,
bibtex,
pdf]

Brief Announcement: Opportunistic Information Dissemination in Mobile Adhoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
(Joint work with M. FarachColton, A. FernándezAnta, A. Milani, and S. Zaks.)
In Proceedings of the 25th International Symposium on Distributed Computing (DISC 2011),
in Lecture Notes in Computer Science, © SpringerVerlag,
2011.
[DOI,
bibtex,
pdf]

Brief Announcement: Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication
(Joint work with E. Christoforou, A. FernándezAnta, and C. Georgiou.)
In Proceedings of the 25th International Symposium on Distributed Computing (DISC 2011),
in Lecture Notes in Computer Science, © SpringerVerlag,
2011.
[DOI,
bibtex,
pdf]

Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in dDimensions.
(Joint work with E. M. Arkin, A. FernándezAnta, and J. S. B. Mitchell)
In Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011).
[DOI,
bibtex,
pdf]

Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication
(Joint work with E. Christoforou, A. FernándezAnta, and C. Georgiou.)
In Proceedings of the 10th IEEE International Symposium on Network Computing and Applications (NCA 2011),
© IEEE, 2011.
[DOI,
bibtex,
pdf]

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks
(Joint work with A. FernándezAnta and C. Thraves.)
In Discrete Mathematics and Theoretical Computer Science (DMTCS), 2011.
[DOI,
bibtex,
pdf]

Brief Announcement: Unbounded Contention Resolution in MultipleAccess Channels.
(Joint work with A. FernándezAnta and J. RamónMuñoz.)
In Proceedings of the 30th ACM  SIGACTSIGOPS Symposium on Principles of Distributed Computing (PODC 2011),
© ACM, 2011.
[DOI,
bibtex,
pdf]

The Length of the Longest Edge in Multidimensional Delaunay Graphs (Extended Abstract).
(Joint work with E. M. Arkin, A. FernándezAnta, and J. S. B. Mitchell)
In Proceedings of the 20th Annual Fall Workshop on Computational Geometry (FWCG 2010).
[DOI,
bibtex,
pdf]

Contention Resolution in MultipleAccess Channels: kSelection in Radio Networks.
(Joint work with A. FernándezAnta.)
In Discrete Mathematics, Algorithms and Applications (DMAA),
© World Scientific Publishing Company,
2010.
[DOI,
bibtex,
pdf]

Opportunistic Information Dissemination in Mobile Adhoc Networks: The Profit of Global Synchrony.
(Joint work with A. FernándezAnta, A. Milani, and S. Zaks.)
In Proceedings of the 24th International Symposium on Distributed Computing (DISC 2010),
in Lecture Notes in Computer Science, © SpringerVerlag,
2010.
[DOI,
bibtex,
pdf]

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks.
(Joint work with A. FernándezAnta and C. Thraves.)
In Proceedings of the 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2010),
in Lecture Notes in Computer Science, © SpringerVerlag,
2010.
[DOI,
bibtex,
pdf]

Contention Resolution in MultipleAccess Channels: kSelection in Radio Networks.
(Joint work with A. FernándezAnta.)
In Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON 2010),
in Lecture Notes in Computer Science, © SpringerVerlag,
2010.
[DOI,
bibtex,
pdf]

Algorithmic Mechanisms for Internetbased MasterWorker Computing with Untrusted and Selfish Workers.
(Joint work with A. FernándezAnta and C. Georgiou.)
In Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010),
© IEEE,
2010.
[DOI,
bibtex,
pdf]

An Earlystopping Protocol for Computing Aggregate Functions in Sensor Networks.
(Joint work with A. FernándezAnta and C. Thraves.)
In Proceedings of the 15th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2009),
© IEEE,
2009.
[DOI,
bibtex,
pdf]

Bootstrapping Hopoptimal Networks in the Weak Sensor Model.
(Joint work with M. FarachColton and R. Fernandes.)
In ACM Transactions on Algorithms (TALG),
© ACM, 2009.
[DOI,
bibtex,
pdf]

Brief Announcement: An Earlystopping Protocol for Computing Aggregate Functions in Sensor Networks.
(Joint work with A. FernándezAnta and C. Thraves.}
In Proceedings of the 22nd EATCS International Symposium on Distributed Computing (DISC 2008),
in Lecture Notes in Computer Science,
© SpringerVerlag,
2008.
[DOI,
bibtex,
pdf]

Designing Mechanisms for Reliable Internetbased Computing.
(Joint work with A. FernándezAnta and C. Georgiou.)
In Proceedings of the 7th IEEE International Symposium on Network Computing and Applications (NCA 2008),
© IEEE,
2008.
[DOI,
bibtex,
pdf]

Deterministic Communication in the Weak Sensor Model.
(Joint work with A. FernándezAnta and C. Thraves.)
In Proceedings of the 11th International Conference On Principles Of Distributed Systems (OPODIS 2007),
in Lecture Notes in Computer Science,
© SpringerVerlag,
2007.
[DOI,
bibtex,
pdf]

Sensor Network Gossiping or How to Break the Broadcast Lower Bound.
(Joint work with M. FarachColton.)
In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007),
in Lecture Notes in Computer Science,
© SpringerVerlag,
2007.
[DOI,
bibtex,
pdf]

Initialiazing Sensor Networks of Nonuniform Density in The Weak Sensor Model.
(Joint work with M. FarachColton.)
In Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS 2007),
in Lecture Notes in Computer Science,
© SpringerVerlag,
2007.
[DOI,
bibtex,
pdf]

Lower Bounds for Clear Transmissions in Radio Networks.
(Joint work with M. FarachColton and R. Fernandes.)
In Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN 2006),
in Lecture Notes in Computer Science,
© SpringerVerlag,
2006.
[DOI,
bibtex,
pdf]

Insertion Sort is O(n log n).
(Joint work with M. A. Bender and M. FarachColton.)
In Theory of Computing Systems (ToCS),
© SpringerVerlag,
2006.
[DOI,
bibtex,
pdf]

Bootstrapping Hopoptimal Networks in the Weak Sensor Model.
(Joint work with M. FarachColton and R. Fernandes.)
In Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005),
in Lecture Notes in Computer Science,
© SpringerVerlag,
2005.
[DOI,
bibtex,
pdf]

Insertion Sort is O(n log n).
(Joint work with M. A. Bender and M. FarachColton.)
In Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004),
pages 1623, 2004.
[pdf]