Miguel A. Mosteiro

Department of Computer Science Rutgers, The State University of New Jersey Hill Center for the Mathematical Sciences 110 Frelinghuysen Road Piscataway, NJ 08854, USA Fax: +1-732-445-0537 Directions Rutgers Virtual Tour Rutgers Campus Maps

Dept. of Telematic Systems and Computer Science Universidad Rey Juan Carlos Campus de Móstoles Calle Tulipán s/n Edificio Departamental II, Despacho 131 28933 Móstoles, Madrid, Spain Voice: +34-91-488-8287 Fax: +34-91-664-7490 Directions URJC virtual tour

Research

Refereed Publications

• Unbounded Contention Resolution: k-Selection in Radio Networks.
  (Joint work with A. Fernández Anta.)
  In Discrete Mathematics, Algorithms and Applications (DMAA), © World Scientific Publishing Company, 2010.
  [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.
  [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.
  [bibtex, pdf, slides (by C. Thraves)]
• Unbounded Contention Resolution: 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 10.1007/978-3-642-14031-0)
  [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 10.1109/IPDPS.2010.5470409)
  [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 10.1109/PRDC.2009.63)
  [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, accepted February 2008, published October 2009. (DOI 10.1145/1597036.1597040)
  [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 10.1007/978-3-540-87779-0_38)
  [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 10.1109/NCA.2008.41)
  [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 10.1007/978-3-540-77096-1_9)
  [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 10.1007/978-3-540-77120-3_22)
  [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 10.1007/978-3-540-73951-7_49)
  [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 10.1007/11682462_42)
  [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 10.1007/s00224-005-1237-z)
  [bibtex, pdf]
  
• 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 10.1007/11561071_73)
  [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)]
  

Links

Misc