6 citations · 10 across the 9 of their papers we have counts for
10 papers
Efficiency of Self-Adjusting Heaps
Corwin Sinnamon, Robert E. Tarjan
Since the invention of the pairing heap by Fredman, Sedgewick, Sleator, and Tarjan, it has been an open question whether this or any other simple "self-adjusting" heap supports dec…
A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion
Corwin Sinnamon, Robert Tarjan
The pairing heap is a simple "self-adjusting" implementation of a heap (priority queue). Inserting an item into a pairing heap or decreasing the key of an item takes O(1) time wors…
A Tight Analysis of Slim Heaps and Smooth Heaps
Corwin Sinnamon, Robert E. Tarjan
The smooth heap and the closely related slim heap are recently invented self-adjusting implementations of the heap (priority queue) data structure. We analyze the efficiency of the…
Analysis of Smooth Heaps and Slim Heaps
Maria Hartmann, László Kozma, Corwin Sinnamon +1
The smooth heap is a recently introduced self-adjusting heap [Kozma, Saranurak, 2018] similar to the pairing heap [Fredman, Sedgewick, Sleator, Tarjan, 1986]. The smooth heap was o…
Fast and Simple Edge-Coloring Algorithms
Corwin Sinnamon
We develop sequential algorithms for constructing edge-colorings of graphs and multigraphs efficiently and using few colors. Our primary focus is edge-coloring arbitrary simple gra…
Space-Efficient Data Structures for Lattices
J. Ian Munro, Bryce Sandlund, Corwin Sinnamon
A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for latti…