Forced repetitions over alphabet lists A formal framework for Stringology Fair ranking in competitive bidding procurement: a case analysis An algorithmic view of Computer Science Feasible Combinatorial Matrix Theory - MFCS2013 Circuit Complexity of Shuffle - IWOCA 2013 Feasible Combinatorial Matrix Theory - LICS2013 presentation Unambiguous functions in logarithmic space - CiE 2009
The proof complexity of matrix algebra - Newton Institute, Cambridge 2006
Games on Posets - CiE 2008
The proof theoretic strength of the Steinitz exchange theorem - EACA 2006
