Robert Špalek

I am a staff software engineer in the search quality team of Google, working in Mountain View, California.

I am also a freelance scientist in the area of theoretical computer science, in particular complexity theory, quantum computation, algorithms, lower bounds, search engines, and data compression. In my free time, I enjoy salsa dancing, climbing, snowboarding, (wind)surfing, photography, playing guitar, mountain climbing, and travelling.

2013/04/03

Uploaded new paper Adversary Lower Bound for the Orthogonal Array Problem to the arXiv.

2013/01/11

I presented the paper Adversary Lower Bound for the k-sum Problem at the ITCS'13 conferenece in Berkeley, CA, and my co-author will soon present it at QIP'13 in Beijing.

2012/07/07

The paper Span-Program-Based Quantum Algorithm for Evaluating Formulas was published in the journal Theory of Computing.

2012/07/06

Uploaded new corrected versions of the game Dragon History.

2011/07/01

The paper Quantum query complexity of state conversion was accepted at FOCS'11.