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
Hilfe
Suche: Author="Larsen, Kim G."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient controller synthesis for a fragment of TeX
Peter Bulychev
,
Alexandre David
,
Kim G. Larsen
,
Guangyuan Li
Acta Informatica
51
(3-4), 2014, pp. 165-192
Synchronizing words for weighted and timed automata
Laurent Doyen
,
Line Juhl
,
Kim G. Larsen
,
Nicolas Markey
,
Mahsa Shirmohammadi
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 121-132
Robust synthesis for real-time systems
Kim G. Larsen
,
Axel Legay
,
Louis-Marie Traonouez
,
Andrzej Wa̧sowski
Theoretical Computer Science
515
, 2014, pp. 96-122
Complete proof systems for weighted modal logic
Kim G. Larsen
,
Radu Mardare
Theoretical Computer Science
546
, 2014, pp. 164-175
Computing behavioral distances, compositionally
Giorgio Bacci
,
Giovanni Bacci
,
Kim G. Larsen
,
Radu Mardare
Lecture Notes in Computer Science
8087
, 2013, pp. 74-85
Abstract probabilistic automata
Benoît Delahaye
,
Joost-Pieter Katoen
,
Kim G. Larsen
,
Axel Legay
,
Mikkel L. Pedersen
,
Falak Sher
,
Andrzej Wa̧sowski
Information and Computation
232
, 2013, pp. 66-116
EXPTIME-completeness of thorough refinement on modal transition systems
Nikola Benes̑
,
Jan Kȓetínský
,
Kim G. Larsen
,
Jiȓí Srba
Information and Computation
218
, 2012, pp. 54-68
Quantitative refinement for weighted modal transition systems
Sebastian S. Bauer
,
Uli Fahrenberg
,
Line Juhl
,
Kim G. Larsen
,
Axel Legay
,
Claus Thrane
Lecture Notes in Computer Science
6907
, 2011, pp. 60-71
Constraint Markov chains
Benoît Caillaud
,
Benoît Delahaye
,
Kim G. Larsen
,
Axel Legay
,
Mikkel L. Pedersen
,
Andrzej Wa̧sowski
Theoretical Computer Science
412
(34), 2011, pp. 4373-4404
Modular Markovian logic
Luca Cardelli
,
Kim G. Larsen
,
Radu Mardare
Lecture Notes in Computer Science
6756
, 2011, pp. 380-391
Metrics for weighted transition systems: Axiomatization and complexity
Kim G. Larsen
,
Uli Fahrenberg
,
Claus Thrane
Theoretical Computer Science
412
(28), 2011, pp. 3358-3369
Priced timed automata: Theory and tools
Kim G. Larsen
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 417-425
Almost optimal strategies in one clock priced timed games
Patricia Bouyer
,
Kim G. Larsen
,
Nicolas Markey
,
Jacob Illum Rasmussen
Lecture Notes in Computer Science
4337
, 2006, pp. 345-356
Optimal strategies in priced timed game automata
Patricia Bouyer
,
Franck Cassez
,
Emmanuel Fleury
,
Kim G. Larsen
Lecture Notes in Computer Science
3328
, 2004, pp. 148-160
The power of reachability testing for timed automata
Luca Aceto
,
Patricia Bouyer
,
Augusto Burgueño
,
Kim G. Larsen
Theoretical Computer Science
300
(1-3), 2003, pp. 411-475
Protection in programming-language translations
Martín Abadi
Lecture Notes in Computer Science
1443
, 1998, pp. 868-883
The power of reachability testing for timed automata
Luca Aceto
,
Patricia Bouyer
,
Augusto Burgueño
,
Kim G. Larsen
Lecture Notes in Computer Science
1530
, 1998, pp. 245-256
On the complexity of deriving score functions from examples for problems in molecular biology
Tatsuya Akutsu
,
Mutsunori Yagiura
Lecture Notes in Computer Science
1443
, 1998, pp. 832-843
Deciding global partial-order properties
Rajeev Alur
,
Ken McMillan
,
Doron Peled
Lecture Notes in Computer Science
1443
, 1998, pp. 41-52
Metric semantics for true concurrent real time
Christel Baier
,
Joost-Pieter Katoen
,
Diego Latella
Lecture Notes in Computer Science
1443
, 1998, pp. 568-579
Concatenable graph processes: Relating processes and derivation traces
Paolo Baldan
,
Andrea Corradini
,
Ugo Montanari
Lecture Notes in Computer Science
1443
, 1998, pp. 283-295
The relevance of proof-irrelevance
Gilles Barthe
Lecture Notes in Computer Science
1443
, 1998, pp. 755-768
Efficient approximation algorithms for the Subset-Sums Equality problem
Cristina Bazgan
,
Miklos Santha
,
Zsolt Tuza
Lecture Notes in Computer Science
1443
, 1998, pp. 387-396
CONS-free programs with tree input
Amir M. Ben-Amram
,
Holger Petersen
Lecture Notes in Computer Science
1443
, 1998, pp. 271-282
Inversion of circulant matrices over
Z_m
Dario Bini
,
Gianna M. del Corso
,
Giovanni Manzini
,
Luciano Margara
Lecture Notes in Computer Science
1443
, 1998, pp. 719-730
Seiten 1
2
3
4
5
>