Corwin Sinnamon

22 papers A* 4C 3Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Efficiency of Self-Adjusting Heaps.
ACM Trans. Algorithms
Corwin Sinnamon, Robert E. Tarjan
2023 A* conf
A Nearly-Tight Analysis of Multipass Pairing Heaps.
SODA
Corwin Sinnamon, Robert E. Tarjan
2023 A* conf
A Tight Analysis of Slim Heaps and Smooth Heaps.
SODA
Corwin Sinnamon, Robert E. Tarjan
2023 J jnl
Efficiency of Self-Adjusting Heaps.
CoRR
Corwin Sinnamon, Robert E. Tarjan
2022 J jnl
A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion.
CoRR
Corwin Sinnamon, Robert E. Tarjan
2022 — —
Analysis of Self-Adjusting Heaps
Corwin Sinnamon
2021 A* conf
Analysis of Smooth Heaps and Slim Heaps.
ICALP
Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan
2021 J jnl
Analysis of Smooth Heaps and Slim Heaps.
CoRR
Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan
2020 — conf
Space-Efficient Data Structures for Lattices.
SWAT
J. Ian Munro, Bryce Sandlund, Corwin Sinnamon
2019 J jnl
A Randomized Algorithm for Edge-Colouring Graphs in O(m√n) Time.
CoRR
Corwin Sinnamon
2019 J jnl
Complexity of proper prefix-convex regular languages.
Theor. Comput. Sci.
Janusz A. Brzozowski, Corwin Sinnamon
2019 J jnl
Space-Efficient Data Structures for Lattices.
CoRR
J. Ian Munro, Bryce Sandlund, Corwin Sinnamon
2018 C conf
Complexity of Proper Suffix-Convex Regular Languages.
CIAA
Corwin Sinnamon
2018 J jnl
Complexity of Proper Suffix-Convex Regular Languages.
CoRR
Corwin Sinnamon
2018 A* conf
Time and Space Efficient Representations of Distributive Lattices.
SODA
J. Ian Munro, Corwin Sinnamon
2017 C conf
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages.
LATA
Janusz A. Brzozowski, Corwin Sinnamon
2017 C conf
Complexity of Proper Prefix-Convex Regular Languages.
CIAA
Janusz A. Brzozowski, Corwin Sinnamon
2017 J jnl
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages.
Acta Cybern.
Janusz A. Brzozowski, Corwin Sinnamon
2017 J jnl
Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages.
J. Autom. Lang. Comb.
Janusz A. Brzozowski, Corwin Sinnamon
2016 J jnl
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages.
CoRR
Janusz A. Brzozowski, Corwin Sinnamon
2016 J jnl
Complexity of Prefix-Convex Regular Languages.
CoRR
Janusz A. Brzozowski, Corwin Sinnamon
2016 J jnl
Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages.
CoRR
Janusz A. Brzozowski, Corwin Sinnamon