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: Series=Leibniz International Proceedings in Informatics (LIPIcs) AND YEAR=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Jumping automata for uniform strategies
Bastien Maubert
,
Sophie Pinchinat
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 287-298
Emptiness of alternating tree automata using games with imperfect information
Nathanaël Fijalkow
,
Sophie Pinchinat
,
Olivier Serre
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 299-311
Saturation of concurrent collapsible pushdown systems
Matthew Hague
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 313-325
Decidability results on the existence of lookahead delegators for NFA
Christof Löding
,
Stefan Repke
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 327-338
Fair matchings and related problems
Chien-Chung Huang
,
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 339-350
Ranking with diverse intents and correlated contents
Jian Li
,
Zeyu Zhang
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 351-362
Separating regular languages by locally testable and locally threshold testable languages
Thomas Place
,
Lorijn van Rooijen
,
Marc Zeitoun
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 363-375
On the structure and complexity of rational sets of regular languages
Andreas Holzer
,
Christian Schallhart
,
Michael Tautschnig
,
Helmut Veith
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 377-388
Geometric Avatar problems
Mario E. Consuegra
,
Giri Narasimhan
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 389-400
Clustering with center constraints
Parinya Chalermsook
,
Suresh Venkatasubramanian
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 401-412
On infinite words determined by stack automata
Tim Smith
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 413-424
The combinatorics of non-determinism
Olivier Bodini
,
Antoine Genitrini
,
Frédéric Peschanski
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 425-436
Renting a cloud
Barna Saha
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 437-448
Energy efficient scheduling and routing via randomized rounding
Evripidis Bampis
,
Alexander Kononov
,
Dimitrios Letsios
,
Giorgio Lucarelli
,
Maxim Sviridenko
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 449-460
PTAS for ordered instances of resource allocation problems
Kamyar Khodamoradi
,
Ramesh Krishnamurti
,
Arash Rafiey
,
Georgios Stamoulis
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 461-473
On the pseudoperiodic extension of
u^{\ell}=v^mw^n
Florin Manea
,
Mike Müller
,
Dirk Nowotka
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 475-486
Solvency Markov decision processes with interest
Tomás Brázdil
,
Taolue Chen
,
Vojtȇch Forejt
,
Petr Novotný
,
Aistis Simaitis
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 487-499
Parameterized verification of many identical probabilistic timed processes
Nathalie Bertrand
,
Paulin Fournier
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 501-513
Simulation over one-counter nets is PSPACE-complete
Piotr Hofman
,
Slawomir Lasota
,
Richard Mayr
,
Patrick Totzke
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 515-526
Optimal constructions for active diagnosis
Stefan Haar
,
Serge Haddad
,
Tarek Melliti
,
Stefan Schwoon
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 527-539
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games
Kousha Etessami
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 1-2
Graph coloring, communication complexity and the stubborn problem
Nicolas Bousquet
,
Aurélie Lagoutte
,
Stéphan Thomassé
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 3-4
Physarum computations
Kurt Mehlhorn
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 5-6
Algorithmic graph structure theory (Tutorial)
Dániel Marx
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 7-7
Searching for better fill-in
Fedor V. Fomin
,
Yngve Villanger
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 8-19
Seiten
<
1
2
3
4
5
>