Miguel A. Mosteiro

Refereed Publications (newest first)

• Crowd computing as a cooperation problem: an evolutionary approach.
  (Joint work with E. Christoforou, C. Georgiou, A. Fernández Anta, and A. Sánchez.)
  In Journal of Statistical Physics (JSP), © Springer, 2013.
  [DOI, bibtex, pdf]
• Optimal Memory-aware Sensor Network Gossiping.
  (Joint work with M. Farach-Colton and A. Fernández Anta.)
  In Theoretical Computer Science (TCS), © Elsevier, 2013.
  [DOI, bibtex, pdf]
• An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks.
  (Joint work with A. Fernández Anta and C. Thraves.)
  In Journal of Parallel and Distributed Computing (JPDC), © Elsevier, 2013.
  [DOI, bibtex, pdf]
• Algorithmic Mechanisms for Reliable Master-Worker Internet-based Computing.
  (Joint work with E. Christoforou, A. Fernández Anta, and C. Georgiou.)
  In IEEE Transactions on Computers (TC), © IEEE, to appear, 2013.
  [DOI, bibtex, pdf]
• Achieving Reliability in Master-worker Computing via Evolutionary Dynamics.
  (Joint work with E. Christoforou, A. Fernández-Anta, C. Georgiou, M. A. Mosteiro and A. Sánchez.)
  In Proceedings of the 18th International European Conference on Parallel and Distributed Computing (Euro-Par 2012),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2012.
  [DOI, bibtex, pdf, slides (by E. Christoforou)]
• Brief Announcement: Achieving Reliability in Master-worker Computing via Evolutionary Dynamics.
  (Joint work with E. Christoforou, A. Fernández Anta, C. Georgiou, and A. Sánchez.)
  In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2012), © ACM, 2012.
  [DOI, bibtex, pdf, slides (by C. Georgiou)]
• Probabilistic Lower Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in a d-Ball.
  In Proceedings of the 28th European Workshop on Computational Geometry (EuroCG 2012).
  [DOI, bibtex, pdf, slides]
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony.
  (Joint work with A. Fernández Anta, A. Milani, and S. Zaks.)
  In Distributed Computing (DC), © Springer, 2012.
  [DOI, bibtex, pdf]
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
  (Joint work with M. Farach-Colton, A. Fernández Anta, A. Milani, and S. Zaks.)
  In Proceedings of the 10th Latin American Theoretical Informatics Symposium (LATIN 2012),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2012.
  [DOI, bibtex, pdf, slides]
• Deterministic Recurrent Communication in Restricted Sensor Networks.
  (Joint work with A. Fernández Anta and C. Thraves.)
  In Theoretical Computer Science (TCS), © Elsevier, 2012.
  [DOI, bibtex, pdf]
• Fault-Tolerant Aggregation: Flow Updating Meets Mass Distribution.
  (Joint work with P. S. Almeida, C. Baquero, M. Farach-Colton, and P. Jesus.)
  In Proceedings of the 15th International Conference On Principles Of Distributed Systems (OPODIS 2011),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2011.
  [DOI, bibtex, pdf, slides (by C. Baquero and P. Jesus)]
• Unbounded Contention Resolution in Multiple-Access Channels.
  (Joint work with A. Fernández Anta and J. R. Muñoz.)
  In Proceedings of the 25th International Symposium on Distributed Computing (DISC 2011),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2011.
  [DOI, bibtex, pdf, slides (by A. Fernandez Anta)]
• Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
  (Joint work with M. Farach-Colton, A. Fernández Anta, A. Milani, and S. Zaks.)
  In Proceedings of the 25th International Symposium on Distributed Computing (DISC 2011),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2011.
  [DOI, bibtex, pdf, slides]
• Brief Announcement: Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication
  (Joint work with E. Christoforou, A. Fernández Anta, and C. Georgiou.)
  In Proceedings of the 25th International Symposium on Distributed Computing (DISC 2011),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2011.
  [DOI, bibtex, pdf, slides (by E. Christoforou)]
• Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.
  (Joint work with E. M. Arkin, A. Fernández Anta, and J. S. B. Mitchell)
  In Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011).
  [DOI, bibtex, pdf, slides]
• Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication
  (Joint work with E. Christoforou, A. Fernández Anta, and C. Georgiou.)
  In Proceedings of the 10th IEEE International Symposium on Network Computing and Applications (NCA 2011), © IEEE, 2011.
  [DOI, bibtex, pdf, slides (by E. Christoforou)]
• Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks
  (Joint work with A. Fernández Anta and C. Thraves.)
  In Discrete Mathematics and Theoretical Computer Science (DMTCS), 2011.
  [DOI, bibtex, pdf]
• Brief Announcement: Unbounded Contention Resolution in Multiple-Access Channels.
  (Joint work with A. Fernández Anta and Jorge R. Muñoz.)
  In Proceedings of the 30th ACM - SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2011), © ACM, 2011.
  [DOI, bibtex, pdf, slides]
• The Length of the Longest Edge in Multidimensional Delaunay Graphs (Extended Abstract).
  (Joint work with E. M. Arkin, A. Fernández Anta, and J. S. B. Mitchell)
  In Proceedings of the 20th Annual Fall Workshop on Computational Geometry (FWCG 2010).
  [DOI, bibtex, pdf, slides]
• Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks.
  (Joint work with A. Fernández Anta.)
  In Discrete Mathematics, Algorithms and Applications (DMAA), © World Scientific Publishing Company, 2010.
  [DOI, bibtex, pdf]
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony.
  (Joint work with A. Fernández Anta, A. Milani, and S. Zaks.)
  In Proceedings of the 24th International Symposium on Distributed Computing (DISC 2010),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2010.
  [DOI, bibtex, pdf, slides]
• Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks.
  (Joint work with A. Fernández Anta 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, © Springer-Verlag, 2010.
  [DOI, bibtex, pdf, slides (by C. Thraves)]
• Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks.
  (Joint work with A. Fernández Anta.)
  In Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON 2010),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2010.
  [DOI, bibtex, pdf, slides]
• Algorithmic Mechanisms for Internet-based Master-Worker Computing with Untrusted and Selfish Workers.
  (Joint work with A. Fernández Anta and C. Georgiou.)
  In Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), © IEEE, 2010.
  [DOI, bibtex, pdf, slides]
• An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks.
  (Joint work with A. Fernández Anta and C. Thraves.)
  In Proceedings of the 15th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2009), © IEEE, 2009.
  [DOI, bibtex, pdf, slides]
• Bootstrapping Hop-optimal Networks in the Weak Sensor Model.
  (Joint work with M. Farach-Colton and R. Fernandes.)
  In ACM Transactions on Algorithms (TALG), © ACM, 2009.
  [DOI, bibtex, pdf]
• Brief Announcement: An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks.
  (Joint work with A. Fernández Anta and C. Thraves.}
  In Proceedings of the 22nd EATCS International Symposium on Distributed Computing (DISC 2008),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2008.
  [DOI, bibtex, pdf]
• Designing Mechanisms for Reliable Internet-based Computing.
  (Joint work with A. Fernández Anta and C. Georgiou.)
  In Proceedings of the 7th IEEE International Symposium on Network Computing and Applications (NCA 2008), © IEEE, 2008.
  [DOI, bibtex, pdf, slides (by C. Georgiou)]
• Deterministic Communication in the Weak Sensor Model.
  (Joint work with A. Fernández Anta and C. Thraves.)
  In Proceedings of the 11th International Conference On Principles Of Distributed Systems (OPODIS 2007),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2007.
  [DOI, bibtex, pdf, slides]
• Sensor Network Gossiping or How to Break the Broadcast Lower Bound.
  (Joint work with M. Farach-Colton.)
  In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2007.
  [DOI, bibtex, pdf, slides]
  
• Initialiazing Sensor Networks of Non-uniform Density in The Weak Sensor Model.
  (Joint work with M. Farach-Colton.)
  In Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS 2007),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2007.
  [DOI, bibtex, pdf, slides]
  
• Lower Bounds for Clear Transmissions in Radio Networks.
  (Joint work with M. Farach-Colton and R. Fernandes.)
  In Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN 2006),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2006.
  [DOI, bibtex, pdf, slides (by R. Fernandes)]
  
• Insertion Sort is O(n log n).
  (Joint work with M. A. Bender and M. Farach-Colton.)
  In Theory of Computing Systems (ToCS), © Springer-Verlag, 2006.
  [DOI, bibtex, pdf, slides]
  
• Bootstrapping Hop-optimal Networks in the Weak Sensor Model.
  (Joint work with M. Farach-Colton and R. Fernandes.)
  In Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2005.
  [DOI, bibtex, pdf, slides]
  
• Insertion Sort is O(n log n).
  (Joint work with M. A. Bender and M. Farach-Colton.)
  In Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004), pages 16-23, 2004.
  [pdf, slides (by M. A. Bender)]