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=1
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Understanding maximal repetitions in strings
Maxime Crochemore
,
Lucian Ilie
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 11-16
A little bit infinite? On adding data to finitely labelled structures
Thomas Schwentick
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 17-17
Equilibria, fixed points, and complexity classes
Mihalis Yannakakis
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 19-37
Pushdown compression
Pilar Albert
,
Elvira Mayordomo
,
Philippe Moser
,
Sylvain Perifel
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 39-48
Quantum search with variable times
Andris Ambainis
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 49-59
Structural aspects of tilings
Alexis Ballier
,
Bruno Durand
,
Emmanuel Jeandel
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 61-72
Limit complexities revisited
Laurent Bienvenu
,
Andrej Muchnik
,
Alexander Shen
,
Nikolay Vereschagin
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 73-83
Trimmed Moebius inversion and graphs of bounded degree
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Koivisto
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 85-96
On the complexity of the interlace polynomial
Markus Bläser
,
Christian Hoffmann
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 97-108
Minimizing flow time in the wireless gathering problem
Vincenzo Bonifaci
,
Peter Korteweg
,
Alberto Marchetti-Spaccamela
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 109-120
On termination for faulty channel machines
Patricia Bouyer
,
Nicolas Markey
,
Joël Ouaknine
,
P. Schnoebelen
,
James Worrell
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 121-132
Stackelberg network pricing games
Patrick Briest
,
Martin Hoefer
,
Piotr Krysta
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 133-144
Sublinear communication protocols for multi-party pointer jumping and a related lower bound
Joshua Brody
,
Amit Chakrabarti
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 145-156
Finding irrefutable certificates for
S^p_2
via Arthur and Merlin
Venkatesan T. Chakaravarthy
,
Sambuddha Roy
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 157-168
Quantifying homology classes
Chao Chen
,
Daniel Freedman
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 169-180
Shortest vertex-disjoint two-face paths in planar graphs
Éric Colin de Verdière
,
Alexander Schrijver
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 181-192
Geodesic Fréchet distance inside a simple polygon
Atlas F. Cook IV
,
Carola Wenk
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 193-204
Improved algorithms for the range next value problem and applications
Maxime Crochemore
,
Costas S. Iliopoulos
,
Marcin Kubica
,
Mohammad Sohel Rahman
,
Tomasz Waleń
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 205-216
Connecting polygonizations via stretches and twangs
Mirela Damian
,
Robin Flatland
,
Joseph O'Rourke
,
Suneeta Ramaswami
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 217-228
Deterministically isolating a perfect matching in bipartite planar graphs
Samir Datta
,
Raghav Kulkarni
,
Sambuddha Roy
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 229-240
Tight bounds for blind search on the integers
Martin Dietzfelbinger
,
Jonathan E. Rowe
,
Ingo Wegener
,
Philipp Woelfel
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 241-252
Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps
Jean-François Dufourd
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 253-264
Trimming of graphs, with application to point labeling
Thomas Erlebach
,
Torben Hagerup
,
Klaus Jansen
,
Moritz Minzlaff
,
Alexander Wolff
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 265-276
Computing minimum spanning trees with uncertainty
Thomas Erlebach
,
Michael Hoffmann
,
Danny Krizanc
,
Matús Mihal'ák
,
Rajeev Raman
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 277-288
Convergence thresholds of Newton's method for monotone polynomial equations
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 289-300
Seiten 1
2
3
>