Miguel A. Mosteiro

Seidenberg School of Computer Science and Information Systems
Pace University
161 William St. #232
New York, NY 10038, USA
Campus Map
Campus Tour
My page at Pace


I am Associate Professor in the Seidenberg School of Computer Science and Information Systems at Pace University. My research interests are in various aspects of algorithms, from theoretical analysis to experimental algorithms. Specific areas of my research include algorithms for highly dynamic networks, the application of game theory and reinforcement learning to crowd computing, and online and reallocation algorithms for cloud computing and radio networks. This year, I serve as Editorial Board member of The Computer Journal, PC member of ESA 2023. I am the co-Director of the Applied Algorithmic Thinking Club (@club).


Refereed Publications

I coauthored Library Sort.
My Erdős number is 2.

Some slides:
@club presentation(02/01/2023).
Developer Interview info session with guest Dr. Pablo Mosteiro Romero (Trip Advisor, UK) (10/11/2018).
Our guest Dr. Martin Farach-Colton (Rutgers Univ.) talk on File Systems Aging (11/6/2017).
Developer Interview info session (3/27/2017).
Our guest Dr. Fernandez Anta (IMDEA Networks) talk on Adaptive Scheduling in Wireless Channels (2/21/2017).
NSF-REU info session (12/6/2016).
Our guest Dr. Vincenzo Mancuso (IMDEA Networks) talk on D2D communication (10/6/2016).
Google slide deck on technical interviews.


  • Spring 2023:

    Previous Teaching

    Student Fellowships


    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 calendar

    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
    Marcus Du Sautoy documentary The Secret Rules of Modern Living Algorithms
    Othon Michail and Paul Spirakis video on Dynamic Networks

    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."

    More about Erdős: The Man Who Loved Only Numbers .