Sitemap

This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Short description of portfolio item number 1

Short description of portfolio item number 2

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.

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.

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.

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

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.

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.

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.

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.

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

More information here

More information here

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

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

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