Title/Position
Lecturer

Degree
Ph.D., Université Pierre et Marie Curie, 2012

lumbroso(@cs.princeton.edu) (609) 258-5379 035 Corwin Hall

Research

Interests: Probabilistic algorithms, data streaming, data structures, analysis of algorithms, analytic combinatorics.

Short Bio

Jérémie Lumbroso joined the department in 2014as a lecturer after receiving his Ph.D. in computer science the year earlier from the Université Pierre et Marie Curie, in Paris, where he also earned his bachelor’s and master’s degrees. His research interests center on probabilistic algorithms, data streaming, data structures, analysis of algorithms, and analytic combinatorics. He is especially active in creating software that enables the employment of hundreds of undergraduates who contribute to the department’s goal of providing a boutique education at scale. His codePost tool is designed to streamline the grading/feedback of code assignments and managing hundreds of undergraduate graders. Another software tool, TigerUHR, facilitates the hiring and management of undergraduates.

Selected Publications

D. Leyzberg, J. O. Lumbroso, C. Moretti, “Nailing the TA Interview: Using a Rubric to Hire Teaching Assistants,” in Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE 2017),https://dl.acm.org/citation.cfm?id=3059057.
C. Chauve, é. Fusy, J. O. Lumbroso, “An Exact Enumeration of Distance-Hereditary Graphs,” in Proceedings of the Fourteenth Meeting on Analytic Algorithmics and Combinatorics (ANALCO 2017),https://epubs.siam.org/doi/abs/10.1137/1.9781611974775.3.
J. O. Lumbroso, M. Mishna, Y. Ponty, “Taming reluctant random walks in the positive quadrant,” Electronic Notes in Discrete Mathematics, vol. 59 (GASCom 2016),http://www.sciencedirect.com/~science/article/pii/S1571065317300793.
J. O. Lumbroso, “Optimal Discrete Uniform Generation from Coin Flips, and Applications,”https://arxiv.org/abs/1304.1916.
J. O. Lumbroso, “An optimal cardinality estimation algorithm based on order statistics and its full analysis,” in 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10),https://dmtcs.episciences.org/2780.