26 citations · 151 across the 34 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016★ 18 cited
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie
Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring.…
cs.CC2015
Hardness of RNA Folding Problem with Four Symbols
Yi-Jun Chang
An RNA sequence is a string composed of four types of nucleotides, , and . The goal of the RNA folding problem is to find a maximum cardinality set of crossing-free pai…