Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Lazi{\'c}, Ranko"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The covering and boundedness problems for branching vector addition systems
Stéphane Demri
,
Marcin Jurdziński
,
Oded Lachish
,
Ranko Lazić
Journal of Computer and System Sciences
79
(1), 2013, pp. 23-38
Zeno, Hercules and the Hydra: Downward rational termination is Ackermannian
Ranko Lazić
,
Joël Ouaknine
,
James Worrell
Lecture Notes in Computer Science
8087
, 2013, pp. 643-654
Model checking memoryful linear-time logics over one-counter automata
Stéphane Demri
,
Ranko Lazić
,
Arnaud Sangnier
Theoretical Computer Science
411
(22-24), 2010, pp. 2298-2316
The reachability problem for branching vector addition systems requires doubly-exponential space
Ranko Lazić
Information Processing Letters
110
(17), 2010, pp. 740-745
The covering and boundedness problems for branching vector addition systems
Stéphane Demri
,
Marcin Jurdziński
,
Oded Lachish
,
Ranko Lazić
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 181-192
On the freeze quantifier in constraint LTL: Decidability and complexity
Stéphane Demri
,
Ranko Lazić
,
David Nowak
Information and Computation
205
(1), 2007, pp. 2-24
Nets with tokens which carry data
Ranko Lazić
,
Tom Newcomb
,
Joël Ouaknine
,
A.W. Roscoe
,
James Worrell
Lecture Notes in Computer Science
4546
, 2007, pp. 301-320
Safely freezing LTL
Ranko Lazić
Lecture Notes in Computer Science
4337
, 2006, pp. 381-392
Verifying determinism of concurrent systems which use unbounded arrays
Ranko Lazić
,
Bill Roscoe
Proceedings of the 3rd International Workshop on Verification of Infinite State Systems, INFINITY'98 (Aalborg, Denmark, July 18, 1998)
, 1998, pp. 3-9