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 Volume=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Modal logics definable by universal three-variable formulas
Emanuel Kieroński
,
Jakub Michaliszyn
,
Jan Otop
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 264-275
The first-order theory of ground tree rewrite graphs
Stefan Göller
,
Markus Lohrey
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 276-287
Layer systems for proving confluence
Bertram Felgenhauer
,
Harald Zankl
,
Aart Middeldorp
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 288-299
The semi-stochastic ski-rental problem
Aleksander Ma̧dry
,
Debmalya Panigrahi
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 300-311
Streamability of nested word transductions
Emmanuel Filiot
,
Olivier Gauwin
,
Pierre-Alain Reynier
,
Frédéric Servais
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 312-324
The update complexity of selection and related problems
Manoj Gupta
,
Yogish Sabharwal
,
Sandeep Sen
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 325-338
A tight lower bound for Streett complementation
Yang Cai
,
Ting Zhang
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 339-350
Parameterized regular expressions and their languages
Pablo Barceló
,
Leonid Libkin
,
Juan L. Reutter
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 351-362
Definable operations on weakly recognizable sets of trees
Jacques Duparc
,
Alessandro Facchini
,
Filip Murlak
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 363-374
Nash equilibria in concurrent games with Büchi objectives
Patricia Bouyer
,
Romain Brenguier
,
Nicolas Markey
,
Michael Ummels
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 375-386
A perfect-information construction for coordination in games
Dietmar Berwanger
,
Łukasz Kaiser
,
Bernd Puchala
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 387-398
Efficient approximation of optimal control for continuous-time Markov games
John Fearnley
,
Markus Rabe
,
Sven Schewe
,
Lijun Zhang
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 399-410
Minimal disclosure in partially observable Markov decision processes
Nathalie Bertrand
,
Blaise Genest
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 411-422
Optimal packed string matching
Oren Ben-Kiki
,
Philip Bille
,
Dany Breslauer
,
Leszek Ga̧sieniec
,
Roberto Grossi
,
Oren Weimann
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 423-432
Dynamic programming in faulty memory hierarchies (cache-obliviously)
Saverio Caminiti
,
Irene Finocchi
,
Emanuele G. Fusco
,
Francesco Silvestri
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 433-444
Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
Hongfei Fu
,
Joost-Pieter Katoen
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 445-456
Parameterised pushdown systems with non-atomic writes
Matthew Hague
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 457-468
Higher order indexed monadic systems
Didier Caucal
,
Teodor Knapik
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 469-480
Seiten
<
1
2