Posts by Collection

portfolio

Portfolio item number 1

Summary

Short description of portfolio item number 1

Portfolio item number 2

Summary

Short description of portfolio item number 2

publications

Towards Scalable and Practical Batch-Dynamic Connectivity

Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Łącki, Julian Shun, Zhongqi Wang

VLDB '25: Proceedings of the VLDB Endownment, Volume 18, Issue 3

Summary

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.

Techniques for Practical Parallel BFS and SSSP

Quinten De Man, Richard Wen, Laxman Dhulipala

Proceedings of the 1st FastCode Programming Challenge (FCPC '25)

Summary

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.

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering

Quinten De Man, Laxman Dhulipala, Kishen N. Gowda

SPAA '25: Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures

Summary

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.

Towards Scalable and Practical Batch-Dynamic Connectivity (Abstract)

Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Łącki, Julian Shun, Zhongqi Wang

Proceedings of the 3rd Highlights of Parallel Computing Workshop (HOPC '25)

Summary

This paper is a workshop version of the conference paper of the same name.

Fast and Compact Sketch-Based Dynamic Connectivity

Quinten De Man, Qamber Jafri, Daniel DeLayo, Evan T. West, David Tench, Michael A. Bender

Submitted to VLDB 2027

Summary

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.

UFO Trees: Practical and Provably-Efficient Parallel Batch-Dynamic Trees

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

Summary

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.

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs

Quinten De Man, Gilvir Gill, Michael A. Bender, Laxman Dhulipala, David Tench

Submitted to SIGMOD 2027

Summary

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.

Fast and Theoretically-Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps

Quinten De Man, Laxman Dhulipala

SPAA '26: Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures

Summary

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.

talks

Talk 1 on Relevant Topic in Your Field

Published:

Summary

This is a description of your talk, which is a markdown file that can be all markdown-ified like any other post. Yay markdown!

Conference Proceeding talk 3 on Relevant Topic in Your Field

Published:

Summary

This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.

teaching

Teaching experience 1

Undergraduate course, University 1, Department, 2014

Summary

This is a description of a teaching experience. You can use markdown like any other post.

Teaching experience 2

Workshop, University 1, Department, 2015

Summary

This is a description of a teaching experience. You can use markdown like any other post.