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=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Output-sensitive pattern extraction in sequences
Roberto Grossi
,
Giulia Menconi
,
Nadia Pisanti
,
Roberto Trani
,
Sren Vind
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 303-314
Robust proximity search for balls using sublinear space
Sariel Har-Peled
,
Nirman Kumar
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 315-326
The Benes network is
q(q-1)/2n
-almost
q
-set-wise independent
Efraim Gelman
,
Amnon Ta-Shma
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 327-338
Notes on counting with finite machines
Dmitry Chistikov
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 339-350
Mixed Nash equilibria in concurrent terminal-reward games
Patricia Bouyer
,
Nicolas Markey
,
Daniel Stan
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 351-363
Quantitative games with interval objectives
Paul Hunter
,
Jean-François Raskin
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 365-377
Playing safe
Thomas Colcombet
,
Nathanael Fijalkow
,
Florian Horn
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 379-390
Metaconfluence of calculi with explicit substitutions at a distance
Flávio L.C. de Moura
,
Delia Kesner
,
Mauricio Ayala-Rincón
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 391-402
Behavioral metrics via functor lifting
Paolo Baldan
,
Filippo Bonchi
,
Henning Kerstan
,
Barbara König
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 403-415
Foundation of diagnosis and predictability in probabilistic systems
Nathalie Bertrand
,
Serge Haddad
,
Engel Lefaucheux
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 417-429
Lipschitz robustness of finite-state transducers
Thomas A. Henzinger
,
Jan Otop
,
Roopsha Samanta
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 431-443
Separating Cook completeness from Karp-Levin completeness under a worst-case hardness hypothesis
Debasis Mandal
,
A. Pavan
,
Rajeswari Venugopalan
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 445-456
Constructing small tree grammars and small circuits for formulas
Danny Hucke
,
Markus Lohrey
,
Eric Noeth
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 457-468
One time-traveling bit is as good as logarithmically many
Ryan O'Donnell
,
A.C. Cem Say
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 469-480
New bounds for the garden-hose model
Hartmut Klauck
,
Supartha Podder
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 481-492
Homomorphism polynomials complete for VP
Arnaud Durand
,
Meena Mahajan
,
Guillaume Malod
,
Nicolas de Rugy-Altherre
,
Nitin Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 493-504
Computing information flow using symbolic model-checking
Rohit Chadha
,
Umang Mathur
,
Stefan Schwoon
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 505-516
Information leakage of non-terminating processes
Fabrizio Biondi
,
Axel Legay
,
Bo Friis Nielsen
,
Pasquale Malacaria
,
Andrzej Wa̧sowski
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 517-529
Multiple-environment Markov decision processes
Jean-François Raskin
,
Ocan Sankur
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 531-543
Summary-based inter-procedural analysis via modular trace refinement
Franck Cassez
,
Christian Müller
,
Karla Burnett
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 545-556
A two-level logic approach to reasoning about typed specification languages
Mary Southern
,
Kaustuv Chaudhuri
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 557-569
On the complexity of computing maximum entropy for Markovian models
Taolue Chen
,
Tingting Han
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 571-583
New time-space upperbounds for directed reachability in high-genus and
H
-minor-free graphs
Diptarka Chakraborty
,
A. Pavan
,
Raghunath Tewari
,
N.V. Vinodchandran
,
Lin Forrest Yang
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 585-595
Polynomial min/max-weighted reachability is in unambiguous log-space
Anant Dhayal
,
Jayalal Sarma
,
Saurabh Sawlani
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 597-609
On bounded reachability analysis of shared memory systems
Mohamed Faouzi Atig
,
Ahmed Bouajjani
,
K. Narayan Kumar
,
Prakash Saivasan
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 611-623
Seiten
<
1
2
3
>