2 citations · 2 across the 1 of their papers we have counts for
4 papers
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…
Complexity of Proper Suffix-Convex Regular Languages
Corwin Sinnamon
A language L is suffix-convex if for any words u, v,w, whenever w and uvw are in L, vw is in L as well. Suffix-convex languages include left ideals, suffix-closed languages, and su…
Complexity of Prefix-Convex Regular Languages
Janusz Brzozowski, Corwin Sinnamon
A language over an alphabet is prefix-convex if, for any words , whenever and are in , then so is . Prefix-convex languages include right-idea…