Miguel A. Mosteiro

Lab. of Distrib. Algorithms and Networks (LADyR) 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-4888287 Fax: +34-91-6647490 Directions URJC virtual tour

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

Research

Refereed Publications

• A. Fernández Anta, M. A. Mosteiro and C. Thraves. "An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks". Submitted for acceptance, 2009.
• A. Fernández Anta, C. Georgiou and M. A. Mosteiro. "Algorithmic Mechanisms for Internet-based Master-Worker Computing with Untrusted and Selfish Workers". Submitted for acceptance, 2009.
• A. Fernández Anta, C. Georgiou and M. A. Mosteiro. "Designing Mechanisms for Reliable Internet-based Computing under Collusion". Submitted for acceptance, 2009.
• M. Farach-Colton, A. Fernández Anta and M. A. Mosteiro. "Optimal Memory-aware Sensor Network Gossiping". Submitted for acceptance, 2009.
• A. Fernández Anta, M. A. Mosteiro and C. Thraves. "An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks". In Proceedings of the 15th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC), to appear, © IEEE, 2009.
• A. Fernández Anta and M. A. Mosteiro. "Unbounded Contention Resolution: k-Selection in Radio Networks". Submitted for acceptance, 2009.
• A. Fernández Anta, M. A. Mosteiro and C. Thraves. "Brief Announcement: An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks". In Proceedings of the 22nd EATCS International Symposium on Distributed Computing (DISC), volume 5218 of Lecture Notes in Computer Science, pages 504-506, DOI 10.1007/978-3-540-87779-0_38, © Springer-Verlag, 2008.
• A. Fernández Anta, C. Georgiou and M. A. Mosteiro. "Designing Mechanisms for Reliable Internet-based Computing". In Proceedings of the 7th IEEE International Symposium on Network Computing and Applications (NCA), pages 315-324, DOI 10.1109/NCA.2008.41, © IEEE, 2008.
• M. Farach-Colton, R. Fernandes and M. A. Mosteiro. "Bootstrapping Hop-optimal Networks in the Weak Sensor Model". In ACM Transactions on Algorithms, 2008, to appear.
• A. Fernández Anta, M. A. Mosteiro and C. Thraves. "Deterministic Communication in the Weak Sensor Model". In Proceedings of the 11th International Conference On Principles Of Distributed Systems (OPODIS), volume 4878 of Lecture Notes in Computer Science, pages 119-131, DOI 10.1007/978-3-540-77096-1_9, © Springer-Verlag, 2007.
• M. Farach-Colton and M. A. Mosteiro. "Sensor Network Gossiping or How to Break the Broadcast Lower Bound". In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), volume 4835 of Lecture Notes in Computer Science, pages 232-243, DOI 10.1007/978-3-540-77120-3_22, © Springer-Verlag, 2007.
• M. Farach-Colton and M. A. Mosteiro. "Initialiazing Sensor Networks of Non-uniform Density in The Weak Sensor Model". In Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS), volume 4619 of Lecture Notes in Computer Science, pages 565-576, DOI 10.1007/978-3-540-73951-7_49, © Springer-Verlag, 2007.
• M. Farach-Colton, R. Fernandes and M. A. Mosteiro. "Lower Bounds for Clear Transmissions in Radio Networks". In Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN), volume 3887 of Lecture Notes in Computer Science, pages 447-454, DOI 10.1007/11682462_42, © Springer-Verlag, 2006.
• M. A. Bender, M. Farach-Colton and M. A. Mosteiro. "Insertion Sort is O(n log n)". In Theory of Computing Systems, Volume 39, Number 3, pages 391-397, DOI 10.1007/s00224-005-1237-z, © Springer-Verlag, 2006.
• M. Farach-Colton, R. Fernandes and M. A. Mosteiro. "Bootstrapping Hop-optimal Networks in the Weak Sensor Model". In Proceedings of the 13th Annual European Symposium on Algorithms (ESA), volume 3669 of Lecture Notes in Computer Science, pages 827-838, DOI 10.1007/11561071_73, © Springer-Verlag, 2005.
• M. A. Bender, M. Farach-Colton and M. A. Mosteiro. "Insertion Sort is O(n log n)". In Proceedings of the 3rd International Conference on Fun with Algorithms (FUN), pages 16-23, 2004.

Links

Misc