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=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A comparison of techniques for sampling web pages
Eda Baykan
,
Monika Henzinger
,
Stefan F. Keller
,
Sebastian de Castelberg
,
Markus Kinzler
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 13-30
Profinite methods in automata theory
Jean-Éric Pin
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 31-50
Lower bounds for multi-pass processing of multiple data streams
Nicole Schweikardt
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 51-62
Shortest paths avoiding forbidden subpaths
Mustaq Ahmed
,
Anna Lubiw
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 63-74
Generating shorter bases for hard random lattices
Joël Alwen
,
Chris Peikert
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 75-86
Quantum query complexity of multilinear identity testing
Vikraman Arvind
,
Partha Mukhopadhyay
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 87-98
An order on sets of tilings corresponding to an order on languages
Nathalie Aubrun
,
Mathieu Sablik
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 99-110
Compressed representations of permutations, and applications
Jérémy Barbay
,
Gonzalo Navarro
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 111-122
On the average complexity of Moore's state minimization algorithm
Frédérique Bassino
,
Julien David
,
Cyril Nicaud
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 123-134
Testing linear-invariant non-linear properties
Arnab Bhattacharyya
,
Victor Chen
,
Madhu Sudan
,
Ning Xie
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 135-146
Kolmogorov complexity and Solovay functions
Laurent Bienvenu
,
Rod Downey
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 147-158
Weak MSO with the unbounding quantifier
Mikoƚaj Bojańczyk
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 159-170
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
Glencora Borradaile
,
Erik D. Demaine
,
Siamak Tazari
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 171-182
A polynomial kernel for multicut in trees
Nicolas Bousquet
,
Jean Daligault
,
Stéphan Thomassé
,
Anders Yeo
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 183-194
On local symmetries and universality in cellular automata
Laurent Boyer
,
Guillaume Theyssier
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 195-206
Qualitative reachability in stochastic BPA games
Tomás̑ Brázdil
,
Václav Broz̑ek
,
Antonín Kuc̑era
,
Jan Obdrz̑álek
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 207-218
Locally decodable quantum codes
Jop Briët
,
Ronald de Wolf
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 219-230
Enumerating homomorphisms
Andrei A. Bulatov
,
Víctor Dalmau
,
Martin Grohe
,
Dániel Marx
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 231-242
Hardness and algorithms for rainbow connectivity
Sourav Chakraborty
,
Eldar Fischer
,
Arie Matsliah
,
Raphael Yuster
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 243-254
Nonclairvoyant speed scaling for flow and energy
Ho-Leung Chan
,
Jeff Edmonds
,
Tak-Wah Lam
,
Lap-Kei Lee
,
Alberto Marchetti-Spaccamela
,
Kirk Pruhs
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 255-264
An approximation algorithm for
l_\infty
fitting Robinson structures to distances
Victor Chepoi
,
Morgan Seston
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 265-276
Almost-uniform sampling of points on high-dimensional algebraic varieties
Mahdi Cheraghchi
,
Amin Shokrollahi
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 277-288
Reverse engineering prefix tables
Julien Clément
,
Maxime Crochemore
,
Giuseppina Rindone
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 289-300
The price of anarchy in cooperative network creation games
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Hamid Mahini
,
Morteza Zadimoghaddam
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 301-312
Error-correcting data structures
Ronald de Wolf
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 313-324
Seiten 1
2
3
>