Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Ranko
    Last name: Lazic
    DBLP: l/RankoLazic
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 64  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Ranko Lazic, Patrick Totzke.
    What Makes Petri Nets Harder to Verify: Stack or Data?
    Concurrency, Security, and Puzzles - Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday 2017 (0) 2017
    Conference paper
    Marcin Jurdzinski, Ranko Lazic.
    Succinct progress measures for solving parity games.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz.
    Perfect Half Space Games.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre.
    Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One.
    44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland 2017 (0) 2017
    Conference paper
    Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki.
    Timed pushdown automata and branching vector addition systems.
    32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017 2017 (0) 2017
    Conference paper
    Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz.
    Perfect half space games.
    32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017 2017 (0) 2017
    Conference paper
    Marcin Jurdzinski, Ranko Lazic.
    Succinct progress measures for solving parity games.
    32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017 2017 (0) 2017
    Conference paper
    Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke.
    A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Matthias Englert, Ranko Lazic, Patrick Totzke.
    Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke.
    Coverability Trees for Petri Nets with Unordered Data.
    Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedin 2016 (0) 2016
    Show item 1 to 10 of 64  

    Your query returned 64 matches in the database.