Jérémie O. Lumbroso

Orcid: 0000-0002-5563-687X

Affiliations:
  • Princeton University, Department of Computer Science, NJ, USA
  • Pierre and Marie Curie University, LIP6, Paris, France


According to our database1, Jérémie O. Lumbroso authored at least 20 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Bit-Array-Based Alternatives to HyperLogLog.
Proceedings of the 35th International Conference on Probabilistic, 2024

2023
The Future of Conferences Is Unconferences: Exploring a Decentralized Network of Regional Meetups.
Interactions, 2023

2022
Tools and Techniques for Increasing and Measuring Student Engagement With Pre-Recorded Videos.
Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

Affirmative Sampling: Theory and Applications.
Proceedings of the 33rd International Conference on Probabilistic, 2022

2020
Making Manual Code Review Scale.
Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

Mapping the Landscape of Peer Review in Computing Education Research.
Proceedings of the Working Group Reports on Innovation and Technology in Computer Science Education, 2020

Reviewing Computing Education Papers.
Proceedings of the 2020 ACM Conference on Innovation and Technology in Computer Science Education, 2020

2018
How Flajolet Processed Streams with Coin Flips.
CoRR, 2018

Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition.
Electron. J. Comb., 2018

MergeShuffle: a very fast, parallel random permutation algorithm.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Taming reluctant random walks in the positive quadrant.
Electron. Notes Discret. Math., 2017

Nailing the TA Interview: Using a Rubric to Hire Teaching Assistants.
Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education, 2017

An Exact Enumeration of Distance-Hereditary Graphs.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2015
Analytic Samplers and the Combinatorial Rejection Method.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2013
Optimal Discrete Uniform Generation from Coin Flips, and Applications
CoRR, 2013

Analytic Samplers and the Combinatorial Rejection Method
CoRR, 2013

2012
Dirichlet Random Samplers for Multiplicative Combinatorial Structures.
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2009
Optimal Partial Tiling of Manhattan Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 2009


  Loading...