Corwin Sinnamon

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 21

Top Topics

Regular Languages

Top Venues

J. Autom. Lang. Comb.

Publications

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