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=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for dynamic speed scaling
Susanne Albers
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 1-11
Structural decomposition methods and what they are good for
Markus Aschinger
,
Conrad Drescher
,
Georg Gottlob
,
Peter Jeavons
,
Evgenij Thorstensen
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 12-28
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones
Hubert Comon-Lundh
,
Véronique Cortier
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 29-44
Local dependency dynamic programming in the presence of memory faults
Saverio Caminiti
,
Irene Finocchi
,
Emanuele G. Fusco
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 45-56
Tight bounds for rumor spreading in graphs of a given conductance
George Giakkoupis
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 57-68
Tight bounds for distributed MST verification
Liah Kor
,
Amos Korman
,
David Peleg
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 69-80
Automata based verification over linearly ordered data domains
Luc Segoufin
,
Szymon Toruńczyk
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 81-92
Bottom-up automata on data trees and vertical XPath
Diego Figueira
,
Luc Segoufin
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 93-104
Data monoids
Mikolai Bojańczyk
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 105-116
Minimum
s-t
cut in undirected planar graphs when the source and the sink are close
Haim Kaplan
,
Yahav Nussbaum
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 117-128
Towards duality of multicommodity multiroute cuts and flows: Multilevel ball-growing
Petr Kolman
,
Christian Scheideler
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 129-140
Compact visibility representation of plane graphs
Jiun-Jie Wang
,
Xin He
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 141-152
Telling convex from reflex allows to map a polygon
Jérémie Chalopin
,
Shantanu Das
,
Yann Disser
,
Matús̑ Mihalák
,
Peter Widmayer
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 153-164
Cross-composition: A new technique for kernelization lower bounds
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 165-176
Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter
Bart M.P. Jansen
,
Hans L. Bodlaender
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 177-188
Hitting forbidden minors: Approximation and kernelization
Fedor V. Fomin
,
Daniel Lokshtanov
,
Neeldhara Misra
,
Geevarghese Philip
,
Saket Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 189-200
Self-assembly of arbitrary shapes using RNAse enzymes: Meeting the Kolmogorov bound with small scale factor
Erik D. Demaine
,
Matthew J. Patitz
,
Robert T. Schweller
,
Scott M. Summers
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 201-212
Weakly unambiguous morphisms
Dominik D. Freydenberger
,
Hossein Nevisi
,
Daniel Reidenbach
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 213-224
On minimal Sturmian partial words
Francine Blanchet-Sadri
,
John Lensmire
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 225-236
Improving PPSZ for 3-SAT using critical variables
Timon Hertli
,
Robin A. Moser
,
Dominik Scheder
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 237-248
The complexity of weighted Boolean \#CSP modulo
k
Heng Guo
,
Sangxia Huang
,
Pinyan Lu
,
Mingji Xia
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 249-260
The \#CSP dichotomy is decidable
Martin Dyer
,
David Richerby
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 261-272
A speed-up of oblivious multi-head finite automata by cellular automata
Alex Borelllo
,
Gaétan Richard
,
Véronique Terrier
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 273-283
Stochastic cellular automata solve the density classification problem with an arbitrary precision
Nazim Fatès
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 284-295
Probabilistic cellular automata, invariant measures, and perfect sampling
Ana Bus̑ić
,
Jean Mairesse
,
Irène Marcovici
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 296-307
Seiten 1
2
3
>