research
∙
07/14/2023
Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
We define simple variants of zip trees, called zip-zip trees, which prov...
share
research
∙
07/06/2023
Efficiency of Self-Adjusting Heaps
Since the invention of the pairing heap by Fredman et al., it has been a...
research
∙
05/30/2023
Optimal energetic paths for electric cars
A weighted directed graph G=(V,A,c), where A⊆ V× V and c:A→ R, describes...
research
∙
11/20/2022
Optimal resizable arrays
A resizable array is an array that can grow and shrink by the addition o...
research
∙
01/18/2022
Finding Strong Components Using Depth-First Search
We survey three algorithms that use depth-first search to find strong co...
research
∙
08/10/2021
A Tight Analysis of Slim Heaps and Smooth Heaps
The smooth heap and the closely related slim heap are recently invented ...
research
∙
07/10/2021
Analysis of Smooth Heaps and Slim Heaps
The smooth heap is a recently introduced self-adjusting heap [Kozma, Sar...
research
∙
03/02/2020
Concurrent Disjoint Set Union
We develop and analyze concurrent algorithms for the disjoint set union ...
research
∙
03/02/2020
Connected Components on a PRAM in Log Diameter Time
We present an O(log d + loglog_m/n n)-time randomized PRAM algorithm for...
research
∙
07/15/2019
New Paths from Splay to Dynamic Optimality
Consider the task of performing a sequence of searches in a binary searc...
research
∙
07/15/2019
Splaying Preorders and Postorders
Let T be a binary search tree. We prove two results about the behavior o...
research
∙
12/14/2018
Simple Concurrent Labeling Algorithms for Connected Components
We present new concurrent labeling algorithms for finding connected comp...
research
∙
06/18/2018