Research
I am Computer Science Professor
and Chair of the
Computer Science Department
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 evaluation.
Specific areas of my research include
algorithms for highly constrained networks,
the application of game theory and reinforcement learning to crowd computing,
and online and reallocation algorithms for cloud computing and radio networks.
I serve as
Editorial Board member of
Oxford The Computer Journal.
This year, I serve in the Technical Program Committee of
ISAAC 2025
and
SIROCCO 2026.
Refereed Publications
Honors:
Invited speaker at
Fun with Algorithms 2022.
ICALP 2018 Best Paper Award.
2016 Faculty Research Mentor of the Year, and my student Maitri Chakraborty is the
2016 Undergraduate Researcher of the Year.
I co-authored
Library Sort.
My
Erdős number is 2.
Some slides:
Recursion (by Kara Cho).
Solving Coin Change with Dynamic Programming (by Kara Cho).
@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.
Teaching
Google's Gemini:
What's the Algorithms and Data Structures knowledge that students need in the generative AI age?
Links
Free-access peer-reviewed journals:
Theory of Computing
Electronic Journal of Combinatorics
Discrete Mathematics and Theoretical Computer Science
Free-access repositories:
arXiv
Bibliographies:
CS bibliographies
CiteSeer
DBLP
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
Other:
NIST Dict. of Algorithms and Data Structures
DMANET
NP optimization problems
P versus NP
Open problem garden
Vašek Chvátal's
links
TeX
PlanetMath
MathWorld
Misc
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
.