Miguel A. Mosteiro Home Page

Miguel A. Mosteiro

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

I am a postdoctoral researcher, partially supported by an EU Marie Curie International Reintegration Grant. My research supervisor is Antonio Fernández Anta. I am currently affiliated with GSyC-LADyR @ URJC. Until December 2009, I was co-affiliated with the Computer Science Department at Rutgers University. Previously, I also defended my PhD thesis there. My dissertation advisor and research co-supervisor during my postdoctoral stay was Martín Farach-Colton. My research interests are in various aspects of theoretical computer science, currently leaning towards analysis of algorithms and lower bounds in radio networks and game theory in distributed systems. During the early stage of my doctorate work, I was interested in sorting algorithms and data structures and algorithms for massive data sets.

Manuscripts Currently Under Review

A. Fernández Anta, A. Milani, M. A. Mosteiro and S. Zaks. "Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Proﬁt of Global Synchrony". 2010.
A. Fernández Anta and M. A. Mosteiro. "Unbounded Contention Resolution: k-Selection in Radio Networks". 2009.
A. Fernández Anta, M. A. Mosteiro and C. Thraves. "Deterministic Recurrent Communication in Restricted Sensor Networks". 2009.
A. Fernández Anta, M. A. Mosteiro and C. Thraves. "An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks". 2009.
A. Fernández Anta, C. Georgiou and M. A. Mosteiro. "Designing Mechanisms for Reliable Internet-based Computing under Collusion". 2009.
M. Farach-Colton, A. Fernández Anta and M. A. Mosteiro. "Optimal Memory-aware Sensor Network Gossiping". 2009.

Refereed Publications

A. Fernández Anta, C. Georgiou and M. A. Mosteiro. "Algorithmic Mechanisms for Internet-based Master-Worker Computing with Untrusted and Selﬁsh Workers". In Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS), to appear, © IEEE, 2010.
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), pages 357-364, DOI 10.1109/PRDC.2009.63, © IEEE, 2009. [bibtex, pdf]
M. Farach-Colton, R. Fernandes and M. A. Mosteiro. "Bootstrapping Hop-optimal Networks in the Weak Sensor Model". In ACM Transactions on Algorithms, Volume 5, Number 4, pages 1-30, DOI 10.1145/1597036.1597040, © ACM, accepted February 2008, published October 2009. [bibtex, pdf]
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. [bibtex, pdf]
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. [bibtex, pdf]
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. [bibtex, pdf]
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. [bibtex, pdf]
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. [bibtex, pdf]
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. [bibtex, pdf]
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. [bibtex, pdf]
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. [bibtex, pdf]
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. [pdf]

Links

Princeton August 2007 Additive Combinatorics mini-course material.
Erik Demaine's list of events
Iftah Gamzu's accepted papers at CS Theory conferences
Joseph Wun-Tat Chan's CS Theory conferences
Jérémy Barbay's journals list and conferences list
Yangfan Zhou's references on wireless networks
USC-ANRG A Wireless Sensor Networks Bibliography
Raquel de Freitas Mini's WSN bibliography
arXiv
CS bibliographies
CiteSeer
NIST Dict. of Algorithms and Data Structures
DMANET
NP optimization problems
P versus NP
Open problem garden
Vašek Chvátal's links
TeX
Nicola Talbot's LaTeX Slides
PlanetMath
MathWorld
Rachel Pottinger's Choosing CS Grad. School
NRC top 108 CS programs
Times Higher Education-QS World University Rankings 2009
Muthu's Theory Research @ Rutgers
Rutgers CS Theory Seminar calendar
Rutgers Math calendar
DIMACS workshops
IAS seminars

Misc

Library Sort

Mathematics Genealogy Project: upwards my tree: Martín Farach-Colton (1991), Amihood Amir (1983), Dov Gabbay (1969), [{Michael Rabin (1956), Alonzo Church (1927), Oswald Veblen (1903), E. H. Moore (1885), H. A. Newton (1850), Michel Chasles (1814), Simeon Poisson ()};{Azriel Levy (1958), Adolf Fraenkel (1915), Kurt Hensel (1884), Leopold Kronecker (1845), Gustav Dirichlet (1827), Jean Baptiste Fourier ()}], Joseph Lagrange (), Leonhard Euler (1726), Johann Bernoulli (1694), [{Jacob Bernoulli (1684), Gottfried Leibniz (1666), Erhard Weigel (1650), unknown};{Nikolaus Eglinger (1661), Emmanuel Stupanus (1613), Petrus Ryff (1584), Theodor Zwinger (1559), Petrus Ramus (1536), Johan Sturm (1527), Nicolas Clenard (1521), Jacques Masson (1502), Jan Standonck (1490), unknown}].

A story about Paul Erdos:
by Charles Krauthammer, Washington Post Writers Group
A few years ago, Graham tells me, Erdos heard of a promising young mathematician who wanted to go to Harvard but was short the money needed. Erdos arranged to see him and lent him $1,000. (The sum total of the money Erdos carried around at any one time was about $30.) He told the young man he could pay it back when he was able to. Recently, the young man called Graham to say that he had gone through Harvard and was now teaching at Michigan and could finally pay the money back. What should he do? Graham consulted Erdos. Erdos said, "Tell him to do with the $1,000 what I did."

Galicia en Nova York

Douwe Osinga's Projects: Visited Countries
Airports don't count: