18 citations · 18 across the 3 of their papers we have counts for
3 papers
cs.CC2022
Randomised Composition and Small-Bias Minimax
Shalev Ben-David, Eric Blais, Mika Göös +1
We prove two results about randomised query complexity . First, we introduce a "linearised" complexity measure and show that it satisfies an inner-opti…
cs.CC2022
Communication Complexity of Collision
Mika Göös, Siddhartha Jain
The Collision problem is to decide whether a given list of numbers is -to- or -to- when promised one of them is the case. We show an $n^{Ω(1)…
cs.ET2014★ 18 cited
Search Methods for Tile Sets in Patterned DNA Self-Assembly
Mika Göös, Tuomo Lempiäinen, Eugen Czeizler +1
The Pattern self-Assembly Tile set Synthesis (PATS) problem, which arises in the theory of structured DNA self-assembly, is to determine a set of coloured tiles that, starting from…