Ranko Lazic - RankMe

111 papers A* 16B 10C 3Misc 1Journal 61Unranked 18

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Benignity of loss landscape with weight decay requires both large overparametrization and initialization. CoRR Etienne Boursier, Matthew Bowditch, Matthias Englert, Ranko Lazic
2025	J	`jnl`	Text to Stealthy Adversarial Face Masks. Trans. Mach. Learn. Res. Ben Lewis, Thomas Moyse, James Parkinson, Elizabeth Telford, Callum Whitfield, Ranko Lazic
2025	J	`jnl`	Variance Dichotomy in Feature Spaces of Facial Recognition Systems is a Weak Defense against Simple Weight Manipulation Attacks. Trans. Mach. Learn. Res. Matthew Bowditch, Mike Paterson, Matthias Englert, Ranko Lazic
2024	J	`jnl`	Implicit Regularization of AdaDelta. Trans. Mach. Learn. Res. Matthias Englert, Ranko Lazic, Avi Semler
2023	A*	`conf`	Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. NeurIPS Dmitry Chistikov, Matthias Englert, Ranko Lazic
2023	J	`jnl`	Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. CoRR Dmitry Chistikov, Matthias Englert, Ranko Lazic
2023	J	`jnl`	Verification Column. ACM SIGLOG News Ranko Lazic
2022	A*	`conf`	Adversarial Reprogramming Revisited. NeurIPS Matthias Englert, Ranko Lazic
2022	J	`jnl`	Adversarial Reprogramming Revisited. CoRR Matthias Englert, Ranko Lazic
2022	J	`jnl`	Verification Column. ACM SIGLOG News Ranko Lazic
2022	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2021	J	`jnl`	A lower bound for the coverability problem in acyclic pushdown VAS. Inf. Process. Lett. Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski
2021	J	`jnl`	Leafy Automata for Higher-Order Concurrency. CoRR Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
2021	B	`conf`	Leafy automata for higher-order concurrency. FoSSaCS Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
2021	J	`jnl`	The Reachability Problem for Petri Nets Is Not Elementary. J. ACM Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2021	J	`jnl`	The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
2021	J	`jnl`	The ideal view on Rackoff's coverability technique. Inf. Comput. Ranko Lazic, Sylvain Schmitz
2021	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2021	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2021	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2021	A*	`conf`	Verifying higher-order concurrency with data automata. LICS Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
2021	J	`jnl`	When are emptiness and containment decidable for probabilistic automata? J. Comput. Syst. Sci. Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
2020	—	`conf`	KReach: A Tool for Reachability in Petri Nets. TACAS (1) Alex Dixon, Ranko Lazic
2020	B	`conf`	Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020	J	`jnl`	Reachability in fixed dimension vector addition systems with states. CoRR Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2020	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2020	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2020	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2019	J	`jnl`	Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. ACM Trans. Comput. Log. Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
2019	—	`conf`	Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems (Invited Talk). FSTTCS Ranko Lazic
2019	A*	`conf`	The reachability problem for Petri nets is not elementary. STOC Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2019	A*	`conf`	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2019	J	`jnl`	Verification Column. ACM SIGLOG News Ranko Lazic
2019	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2019	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2018	A*	`conf`	A pseudo-quasi-polynomial algorithm for mean-payoff parity games. LICS Laure Daviaud, Marcin Jurdzinski, Ranko Lazic
2018	J	`jnl`	A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. CoRR Laure Daviaud, Marcin Jurdzinski, Ranko Lazic
2018	J	`jnl`	The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2018	J	`jnl`	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. CoRR Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2018	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2018	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2018	J	`jnl`	Verification column. ACM SIGLOG News Ranko Lazic
2018	J	`jnl`	When is Containment Decidable for Probabilistic Automata? CoRR Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
2018	A*	`conf`	When is Containment Decidable for Probabilistic Automata?. ICALP Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
2017	—	`ed.`	Concurrency, Security, and Puzzles - Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday Concurrency, Security, and Puzzles Thomas Gibson-Robinson, Philippa J. Hopcroft, Ranko Lazic
2017	J	`jnl`	Perfect Half Space Games. CoRR Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
2017	A*	`conf`	Perfect half space games. LICS Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
2017	A*	`conf`	Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. ICALP Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre
2017	A*	`conf`	Succinct progress measures for solving parity games. LICS Marcin Jurdzinski, Ranko Lazic
2017	J	`jnl`	Succinct progress measures for solving parity games. CoRR Marcin Jurdzinski, Ranko Lazic
2017	A*	`conf`	Timed pushdown automata and branching vector addition systems. LICS Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
2017	—	`conf`	What Makes Petri Nets Harder to Verify: Stack or Data? Concurrency, Security, and Puzzles Ranko Lazic, Patrick Totzke
2016	A*	`conf`	A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. ICALP Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
2016	J	`jnl`	A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. CoRR Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
2016	B	`conf`	Contextual Approximation and Higher-Order Procedures. FoSSaCS Ranko Lazic, Andrzej S. Murawski
2016	B	`conf`	Coverability Trees for Petri Nets with Unordered Data. FoSSaCS Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke
2016	A*	`conf`	Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. LICS Matthias Englert, Ranko Lazic, Patrick Totzke
2016	J	`jnl`	Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. CoRR Matthias Englert, Ranko Lazic, Patrick Totzke
2016	A*	`conf`	The Complexity of Coverability in ν-Petri Nets. LICS Ranko Lazic, Sylvain Schmitz
2016	J	`jnl`	Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete. ACM Trans. Comput. Log. Ranko Lazic, Joël Ouaknine, James Worrell
2015	—	`conf`	Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. ICALP (2) Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
2015	J	`jnl`	Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. CoRR Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
2015	J	`jnl`	Nonelementary Complexities for Branching VASS, MELL, and Extensions. ACM Trans. Comput. Log. Ranko Lazic, Sylvain Schmitz
2015	—	`conf`	The Ideal View on Rackoff's Coverability Technique. RP Ranko Lazic, Sylvain Schmitz
2014	J	`jnl`	Non-Elementary Complexities for Branching VASS, MELL, and Extensions. CoRR Ranko Lazic, Sylvain Schmitz
2014	—	`conf`	Non-elementary complexities for branching VASS, MELL, and extensions. CSL-LICS Ranko Lazic, Sylvain Schmitz
2013	J	`jnl`	The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic
2013	J	`jnl`	The reachability problem for vector addition systems with a stack is not elementary. CoRR Ranko Lazic
2013	B	`conf`	Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian. MFCS Ranko Lazic, Joël Ouaknine, James Worrell
2011	J	`jnl`	Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Log. Marcin Jurdzinski, Ranko Lazic
2011	J	`jnl`	Average-price-per-reward games on hybrid automata with strong resets. Int. J. Softw. Tools Technol. Transf. Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski
2011	J	`jnl`	Safety alternating automata on data words. ACM Trans. Comput. Log. Ranko Lazic
2010	J	`jnl`	Data-abstraction refinement: a game semantic approach. Int. J. Softw. Tools Technol. Transf. Adam Bakewell, Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic
2010	J	`jnl`	Model checking memoryful linear-time logics over one-counter automata. Theor. Comput. Sci. Stéphane Demri, Ranko Lazic, Arnaud Sangnier
2010	J	`jnl`	The reachability problem for branching vector addition systems requires doubly-exponential space. Inf. Process. Lett. Ranko Lazic
2009	B	`conf`	Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. VMCAI Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
2009	J	`jnl`	LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. Stéphane Demri, Ranko Lazic
2009	—	`conf`	The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic
2008	J	`jnl`	Alternating Automata on Data Trees and XPath Satisfiability CoRR Marcin Jurdzinski, Ranko Lazic
2008	—	`conf`	Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. FORMATS Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
2008	B	`conf`	Model Checking Freeze LTL over One-Counter Automata. FoSSaCS Stéphane Demri, Ranko Lazic, Arnaud Sangnier
2008	J	`jnl`	Model checking memoryful linear-time logics over one-counter automata CoRR Stéphane Demri, Ranko Lazic, Arnaud Sangnier
2008	J	`jnl`	Nets with Tokens which Carry Data. Fundam. Informaticae Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell
2008	J	`jnl`	Safety alternating automata on data words CoRR Ranko Lazic
2007	A*	`conf`	Alternation-free modal mu-calculus for data trees. LICS Marcin Jurdzinski, Ranko Lazic
2007	J	`jnl`	Compositional software verification based on game semantics and process algebra. Int. J. Softw. Tools Technol. Transf. Aleksandar S. Dimovski, Ranko Lazic
2007	J	`jnl`	Guest Editorial. Formal Aspects Comput. Ranko Lazic, Rajagopal Nagarajan
2007	—	`conf`	Nets with Tokens Which Carry Data. ICATPN Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell
2007	J	`jnl`	On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput. Stéphane Demri, Ranko Lazic, David Nowak
2006	—	`conf`	A Counterexample-Guided Refinement Tool for Open Procedural Programs. SPIN Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic
2006	C	`conf`	Assume-Guarantee Software Verification Based on Game Semantics. ICFEM Aleksandar S. Dimovski, Ranko Lazic
2006	J	`jnl`	LTL with the Freeze Quantifier and Register Automata CoRR Stéphane Demri, Ranko Lazic
2006	A*	`conf`	LTL with the Freeze Quantifier and Register Automata. LICS Stéphane Demri, Ranko Lazic
2006	J	`jnl`	On the freeze quantifier in Constraint LTL: decidability and complexity CoRR Stéphane Demri, Ranko Lazic, David Nowak
2006	—	`ed.`	Proceedings of the 5th International Workshop on Automated Verification of Critical Systems, AVoCS 2005, University of Warwick, UK, September 12-13, 2005 AVoCS Ranko Lazic, Rajagopal Nagarajan
2006	—	`conf`	Safely Freezing LTL. FSTTCS Ranko Lazic
2005	—	`conf`	Abstraction-refinement for game-based model checking. GALOP@ETAPS Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic
2005	B	`conf`	Data-Abstraction Refinement: A Game Semantic Approach. SAS Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic
2005	C	`conf`	On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. TIME Stéphane Demri, Ranko Lazic, David Nowak
2005	—	`conf`	Preface. AVoCS Ranko Lazic, Rajagopal Nagarajan
2004	C	`conf`	CSP Representation of Game Semantics for Second-Order Idealized Algol. ICFEM Aleksandar S. Dimovski, Ranko Lazic
2004	—	`conf`	Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification. INFINITY Ranko Lazic
2004	—	`conf`	On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations. 25 Years Communicating Sequential Processes Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe
2004	J	`jnl`	On model checking data-independent systems with arrays without reset. Theory Pract. Log. Program. Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe
2004	—	`conf`	Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting. INFINITY Ranko Lazic, Thomas Christopher Newcomb, Bill Roscoe
2004	B	`conf`	Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption. IFM Xu Wang, A. W. Roscoe, Ranko Lazic
2004	—	`conf`	Software Model Checking Based on Game Semantics and CSP. AVoCS Aleksandar S. Dimovski, Ranko Lazic
2003	—	`conf`	On a Semantic Definition of Data Independence . TLCA Ranko Lazic, David Nowak
2000	B	`conf`	A Unifying Approach to Data-Independence. CONCUR Ranko Lazic, David Nowak
1999	Misc	`conf`	Data Independence with Generalised Predicate Symbols. PDPTA Ranko Lazic, Bill Roscoe