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 25 of 60  
    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
    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
    Conference paper
    Ranko Lazic, Andrzej S. Murawski.
    Contextual Approximation and Higher-Order Procedures.
    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
    Conference paper
    Ranko Lazic, Joël Ouaknine, James Worrell.
    Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete.
    ACM Trans. Comput. Log. 2015, Volume 17 (0) 2016
    Conference paper
    Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke.
    A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Ranko Lazic, Sylvain Schmitz.
    The Complexity of Coverability in ν-Petri Nets.
    Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016 2016 (0) 2016
    Conference paper
    Matthias Englert, Ranko Lazic, Patrick Totzke.
    Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.
    Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016 2016 (0) 2016
    Journal article
    Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz.
    Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz.
    Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II 2015 (0) 2015
    Conference paper
    Ranko Lazic, Sylvain Schmitz.
    Nonelementary Complexities for Branching VASS, MELL, and Extensions.
    ACM Trans. Comput. Log. 2014, Volume 16 (0) 2015
    Conference paper
    Ranko Lazic, Sylvain Schmitz.
    The Ideal View on Rackoff's Coverability Technique.
    Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings 2015 (0) 2015
    Journal article
    Ranko Lazic, Sylvain Schmitz.
    Non-Elementary Complexities for Branching VASS, MELL, and Extensions.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Ranko Lazic, Sylvain Schmitz.
    Non-elementary complexities for branching VASS, MELL, and extensions.
    Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 2014 (0) 2014
    Journal article
    Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic.
    The covering and boundedness problems for branching vector addition systems.
    J. Comput. Syst. Sci. 2013, Volume 79 (0) 2013
    Conference paper
    Ranko Lazic, Joël Ouaknine, James Worrell.
    Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian.
    Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings 2013 (0) 2013
    Journal article
    Ranko Lazic.
    The reachability problem for vector addition systems with a stack is not elementary.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Ranko Lazic.
    Safety alternating automata on data words.
    ACM Trans. Comput. Log. 2010, Volume 12 (0) 2011
    Conference paper
    Marcin Jurdzinski, Ranko Lazic.
    Alternating automata on data trees and XPath satisfiability.
    ACM Trans. Comput. Log. 2010, Volume 12 (0) 2011
    Conference paper
    Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski.
    Average-price-per-reward games on hybrid automata with strong resets.
    STTT 2011, Volume 13 (0) 2011
    Conference paper
    Ranko Lazic.
    The reachability problem for branching vector addition systems requires doubly-exponential space.
    Inf. Process. Lett. 2009, Volume 110 (0) 2010
    Journal article
    Adam Bakewell, Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic.
    Data-abstraction refinement: a game semantic approach.
    STTT 2010, Volume 12 (0) 2010
    Show item 1 to 25 of 60  

    Your query returned 60 matches in the database.