Miguel A. Mosteiro

Department of Computer Science
Kean University
1000 Morris Ave.
Union, NJ 07083, USA
Office: Willis Hall, Room W406F
Voice: +1 (908) 737-4259

Campus Map
KU video tour


I am Assistant Professor in the Computer Science Department at Kean University. My research interests are in various aspects of algorithms, from theoretical analysis to experimental algorithms. Specific areas of my research include algorithmic problems in radio networks and sensor networks, the application of game theory and reinforcement learning to crowd computing, online and reallocation algorithms in cloud computing and radio networks, etc.
This year I serve in the Program Committee of ACM PODC 2015 and IEEE ISPA 2015.

Refereed Publications

Library Sort


Fall 2015:
CPS-3440/5440 Analysis of Algorithms
CPS-2232 Data Structures and Algorithms

Previous Teaching


Free-access peer-reviewed journals:
Theory of Computing
Electronic Journal of Combinatorics
Discrete Mathematics and Theoretical Computer Science
Free-access repositories:
CS bibliographies
Peer-reviewed conferences:
Wikipedia list of Computer Science conferences
Erik Demaine's list of events

Area seminars:
IAS seminars
Princeton Discrete Mathematics Seminar
NYU/Courant Theory Seminar
DIMACS workshops
Rutgers Math and Theory of Computing Seminar
Rutgers Math calendar

Princeton Additive Combinatorics mini-course material.
Sanjeev Arora and Boaz Barak book on Computational Complexity.
NIST Dict. of Algorithms and Data Structures
NP optimization problems
P versus NP
Open problem garden
Vašek Chvátal's links


Library Sort
Audibilization of sorting algorithms

Erdős number

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 Erdős:
by Charles Krauthammer, Washington Post Writers Group
A few years ago, Graham tells me, Erdős heard of a promising young mathematician who wanted to go to Harvard but was short the money needed. Erdős arranged to see him and lent him $1,000. (The sum total of the money Erdős 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 Erdős. Erdős said, "Tell him to do with the $1,000 what I did."