- Public qubits versus private coins, Abuzer Yakaryilmaz
- Algorithms and complexity aspects in the theory of synchronizing automata, Marina Maslennikova
- On Short Heuristic Proof, Dmitry Sokolov
- Proving Termination and Computational Complexity of Computer Programs, Anton Dergunov
- Solving Multi-index Linear Programs by Reducing to Tree-Like Networks, Alexey Katerov
- Levenshtein Algorithm as a Distance Between Chains, Alexey Raskin
- Straight-line Programs: A Short Overview, Alexey Khvorost
- Weak monotone proofs of the propositional pigeonhole principle, Das Anupam
CSEDays. Theory 2013
Ural Federal University, Ekaterinburg, Russia, June 29 - July 01