47 citations · 138 across the 17 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 2 cited
Non-Local Probes Do Not Help with Graph Problems
Mika Göös, Juho Hirvonen, Reut Levi +2
This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computi…
cs.DS2009
Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly
Mika Göös, Pekka Orponen
The Pattern self-Assembly Tile set Synthesis (PATS) problem is to determine a set of coloured tiles that self-assemble to implement a given rectangular colour pattern. We give an e…