Portfolio item number 1
Summary
Short description of portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 2 
Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Łącki, Julian Shun, Zhongqi Wang
VLDB '25: Proceedings of the VLDB Endownment, Volume 18, Issue 3
We present the first parallel algorithm for batch-dynamic graph connectivity that is work-efficient, uses linear space, and handles updates in polylogarithmic time. We study the performance of the cluster forest algorithm sequentially.
Quinten De Man, Richard Wen, Laxman Dhulipala
Proceedings of the 1st FastCode Programming Challenge (FCPC '25)
For BFS, we describe several performance engineering techniques for real-world graphs. For SSSP, we introduce a contraction based preprocessing method which significantly speeds up queries on high diameter graphs.
Quinten De Man, Laxman Dhulipala, Kishen N. Gowda
SPAA '25: Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures
This paper is the first to study dynamic single-linkage dendrogram (SLD) maintenance. We introduce novel sequential and batch-parallel algorithms that can update the SLD faster than recomputing it from scratch.
Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Łącki, Julian Shun, Zhongqi Wang
Proceedings of the 3rd Highlights of Parallel Computing Workshop (HOPC '25)
This paper is a workshop version of the conference paper of the same name.
Quinten De Man, Qamber Jafri, Daniel DeLayo, Evan T. West, David Tench, Michael A. Bender
Submitted to VLDB 2027
This paper describes a parallel dynamic graph sketching algorithms for graph connectivity. Our system, CUPCaKE, can rapidly process massive and dense dynamic graphs while using significantly less memory than existing systems.
Quinten De Man, Laxman Dhulipala, Kishen N. Gowda, Atharva Sharma
PPoPP '26: Proceedings of the 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming
Best Paper Award Nominee
We present a new parallel batch-dynamic tree data structure called UFO trees which supports a wide range of query functionality and supports efficient batch-parallel updates. Our results show that in both sequential and parallel settings, UFO trees are the fastest dynamic tree data structure that supports a wide range of queries.
Quinten De Man, Gilvir Gill, Michael A. Bender, Laxman Dhulipala, David Tench
Submitted to SIGMOD 2027
We introduce hybrid sketching for dynamic connectivity: sketch dense graph cores and store sparse peripheries losslessly. Our HybridSCALE system is the first sketch-based dynamic connectivity implementation to save space on sparse real-world graphs.
Quinten De Man, Laxman Dhulipala
SPAA '26: Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures
We introduce MOJOS, a unified framework for theoretically- and practically-efficient parallel batch-dynamic trees. MOJOS yields the first theoretically-efficient batch-parallel link-cut tree, the first batch-dynamic data structure supporting path queries to achieve O(log n) depth for batch updates, and a new batch-parallel Euler tour tree that outperforms prior implementations.
Published:
This is a description of your talk, which is a markdown file that can be all markdown-ified like any other post. Yay markdown!
Published:
Published:
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
Undergraduate course, University 1, Department, 2014
This is a description of a teaching experience. You can use markdown like any other post.
Workshop, University 1, Department, 2015
This is a description of a teaching experience. You can use markdown like any other post.