Daniel Bundala

Daniel Bundala is a computer scientist and software engineer at Google in Switzerland. He represented Slovakia at the International Olympiad in Informatics in 2006, winning a silver medal (rank 41), and went on to take a silver medal at the 2009 ICPC World Finals (rank 5). He completed a DPhil (PhD) in Computer Science at the University of Oxford with a thesis on algorithmic verification problems in automata-theoretic settings (2014), then was a postdoctoral researcher at UC Berkeley. His most cited research, optimal sorting networks (with Jakub Zavodny), settled the optimality of sorting networks listed in Knuth's The Art of Computer Programming.

Notes8

• 'Optimal Sorting Networks' (with Jakub Zavodny, 2013) settles the optimality of sorting networks given in Knuth's TAOCP vol. 3, open for over 40 years.Oct 23, 2013
• Represented Slovakia at IOI 2006 and won a silver medal, ranked 41st.Aug 1, 2006
• Now a Software Engineer at Google in Switzerland, per LinkedIn headline and location.Sep 11, 2026
• DPhil thesis 'Algorithmic verification problems in automata-theoretic settings' (Oxford, 2014) develops completeness thresholds in bounded model checking, settling a problem of Kroening et al.Jan 1, 2014
• Continued competitive programming collegiately, taking a silver medal (5th place) at the ICPC World Finals 2009.Apr 1, 2009
• Google Scholar shows 1,424 citations and h-index 17 (1,076 since 2021), indicating sustained research impact.Sep 11, 2026
• Postdoctoral researcher at UC Berkeley in Sanjit Seshia's group, working on temporal-specification learning and verification.Jan 1, 2016