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
[2]
Hilfe
Suche: Series=Leibniz International Proceedings in Informatics (LIPIcs) AND YEAR=2009
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal cache-aware suffix selection
Gianni Franceschini
,
Roberto Grossi
,
S. Muthukrishnan
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 457-468
Randomness on computable probability spaces - A dynamical point of view
Peter Gács
,
Mathieu Hoyrup
,
Cristóbal Rojas
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 469-480
The dynamic complexity of formal languages
Wouter Gelade
,
Marcel Marquardt
,
Thomas Schwentick
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 481-492
A complexity dichotomy for partition functions with mixed signs
Leslie Ann Goldberg
,
Martin Grohe
,
Mark Jerrum
,
Marc Thurley
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 493-504
Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness
André Gronemeier
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 505-516
More haste, less waste: Lowering the redundancy in fully indexable dictionaries
Roberto Grossi
,
Alessio Orlandi
,
Rajeev Raman
,
S. Srinivasa Rao
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 517-528
A unified algorithm for accelerating edit-distance computation via text-compression
Danny Hermelin
,
Gad M. Landau
,
Shir Landau
,
Oren Weimann
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 529-540
Random fruits on the Zielonka tree
Florian Horn
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 541-552
Ambiguity and communication
Juraj Hromković
,
Georg Schnitger
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 553-564
On the Borel inseparability of game tree languages
Szczepan Hummel
,
Henryk Michalewski
,
Damian Niwiński
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 565-576
Equations over sets of natural numbers with addition only
Artur Jeż
,
Alexander Okhotin
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 577-588
Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
Daniel Kirsten
,
Sylvain Lombardy
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 589-600
Polynomial kernelizations for MIN F
^+
II
_1
and MAX
NP
Stefan Kratsch
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 601-612
Local multicoloring algorithms: Computing a nearly-optimal TDMA schedule in constant time
Fabian Kuhn
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 613-624
Efficient isomorphism testing for a class of group extensions
François Le Gall
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 625-636
On approximating multi-criteria TSP
Bodo Manthey
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 637-648
Tractable structures for constraint satisfaction with truth tables
Dániel Marx
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 649-660
Büchi complementation made tight
Sven Schewe
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 661-672
Strong completeness of coalgebraic modal logics
Lutz Schröder
,
Dirk Pattinson
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 673-684
A stronger
LP
bound for formula size lower bounds via clique constraints
Kenya Ueno
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 685-696
Extracting the Kolmogorov complexity of strings and sequences from sources with limited independence
Marius Zimand
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 697-708
Seiten
<
1
2
3
4