Rastislav Lenhardt

Rastislav Lenhardt

Rasto is a software engineer at Google, currently working on Search. Together with Jyrki Alakuijala they have developed a high-speed compression library Gipfeli, which is aiming at slightly higher compression ratios than other high-speed compression libraries. Rasto has joined Google after his PhD, where he was working on algorithms and complexity of Probabilistic Verification under the supervision of James Worrell and Michael Benedikt at University of Oxford. His interests include also using randomization in designing algorithms, and combinatorial game theory.
Authored Publications
Google Publications
Other Publications
Sort By
  • Title
  • Title, descending
  • Year
  • Year, descending
    Model Checking Markov Chains Against Unambiguous Buchi Automata
    Michael Benedikt
    James Worrell
    University of Oxford(2014)
    Complexity of Two-Variable Logic on Finite Trees
    Saguy Benaim
    Michael Benedikt
    Witold Charatonik
    Emanuel Kieronski
    Filip Mazowiecki
    James Worrell
    ICALP (2)(2013), pp. 74-88
    Controlling the Depth, Size, and Number of Subtrees for Two-variable Logic on Trees
    Saguy Benaim
    Michael Benedikt
    James Worrell
    CoRR, abs/1304.6925(2013)
    Two Variable vs. Linear Temporal Logic in Model Checking and Games
    Michael Benedikt
    James Worrell
    Logical Methods in Computer Science, 9(2013)
    LTL Model Checking of Interval Markov Chains
    Michael Benedikt
    James Worrell
    TACAS(2013), pp. 32-46
    Tulip: Model Checking Probabilistic Systems Using Expectation Maximisation Algorithm
    QEST(2013), pp. 155-159
    Two Variable vs. Linear Temporal Logic in Model Checking and Games.
    Michael Benedikt
    James Worrell
    Logical Methods in Computer Science, 9(2013)
    Verification of Two-Variable Logic Revisited
    Michael Benedikt
    James Worrell
    QEST(2012), pp. 114-123
    Two Variable vs. Linear Temporal Logic in Model Checking and Games
    Michael Benedikt
    James Worrell
    CONCUR(2011), pp. 497-511
    Proof of Concept: Fast Solutions to NP-problems by Using SAT and Integer Programming Solvers
    CoRR, abs/1011.5447(2010)