49 citations · 74 across the 40 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2014★ 1 cited
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis
Aleck Johnsen, Ming-Yang Kao, Shinnosuke Seki
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular (color) pattern. For k >= 1, k-PATS is a variant…
cs.DM2001
Optimal Constructions of Hybrid Algorithms
Ming-Yang Kao, Yuan Ma, Michael Sipser +1
We study on-line strategies for solving problems with hybrid algorithms. There is a problem Q and w basic algorithms for solving Q. For some lambda <= w, we have a computer with la…