Corwin Sinnamon

CoRR, 2023

A Tight Analysis of Slim Heaps and Smooth Heaps.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

A Nearly-Tight Analysis of Multipass Pairing Heaps.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Analysis of Self-Adjusting Heaps

[BibT_eX]

[DOI]

PhD thesis, 2022

A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Analysis of Smooth Heaps and Slim Heaps.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Space-Efficient Data Structures for Lattices.

[BibT_eX]

[DOI]

J. Ian Munro

Bryce Sandlund

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Complexity of proper prefix-convex regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

A Randomized Algorithm for Edge-Colouring Graphs in O(m√n) Time.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Complexity of Proper Suffix-Convex Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

Time and Space Efficient Representations of Distributive Lattices.

[BibT_eX]

[DOI]

J. Ian Munro

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages.

[BibT_eX]

[DOI]

Acta Cybern., 2017

Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2017

2016

Complexity of Prefix-Convex Regular Languages.

[BibT_eX]

[DOI]