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=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Keeping a crowd safe: On the complexity of parameterized verification
Javier Esparza
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 1-10
Semi-algebraic geometry in computational game theory - A consumer's perspective
Peter Bro Miltersen
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 11-12
A glimpse on constant delay enumeration
Luc Segoufin
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 13-27
Arithmetic circuit complexity
Neeraj Kayal
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 28-28
Submodular stochastic probing on matroids
Marek Adamczyk
,
Maxim Sviridenko
,
Justin Ward
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 29-40
On symmetric circuits and fixed-point logics
Matthew Anderson
,
Anuj Dawar
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 41-52
Throughput maximization in the speed-scaling setting
Eric Angel
,
Evripidis Bampis
,
Vincent Chau
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 53-62
Efficient computation of optimal energy and fractional weighted flow trade-off schedules
Antonios Antoniadis
,
Neal Barcelo
,
Mario Consuegra
,
Peter Kling
,
Michael Nugent
,
Kirk Pruhs
,
Michele Scquizzato
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 63-74
Weighted coloring in trees
Julio Araujo
,
Nicolas Nisse
,
Stéphane Pérennes
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 75-86
Generalized reordering buffer management
Yossi Azar
,
Matthias Englert
,
Iftah Gamzu
,
Eytan Kidron
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 87-98
Shapley meets Shapley
Haris Aziz
,
Bart de Keijzer
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 99-111
Complexity classes on spatially periodic cellular automata
Nicolas Bacquey
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 112-124
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits
Bruno Bauwens
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 125-136
Two-page book embeddings of 4-planar graphs
Michael A. Bekos
,
Martin Gronemann
,
Chrysanthi N. Raftopoulou
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 137-148
Palindrome recognition in the streaming model
Petra Berenbrink
,
Funda Ergün
,
Frederik Mallmann-Trenn
,
Erfan Sadeqi Azer
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 149-161
New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
Francine Blanchet-Sadri
,
Michelle Bodnar
,
Benjamin De Winkle
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 162-173
Online bin packing with advice
Joan Boyar
,
Shahin Kamali
,
Kim S. Larsen
,
Alejandro López-Ortiz
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 174-186
Balls into bins via local search: Cover time and maximum load
Karl Bringmann
,
Thomas Sauerwald
,
Alexandre Stauffer
,
He Sun
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 187-198
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games
Véronique Bruyère
,
Emmanuel Filiot
,
Mickael Randour
,
Jean-François Raskin
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 199-213
Chordal editing is fixed-parameter tractable
Yixin Cao
,
Dániel Marx
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 214-225
Online dynamic power management with hard real-time guarantees
Jian-Jia Chen
,
Mong-Jen Kao
,
D.T. Lee
,
Ignaz Rutter
,
Dorothea Wagner
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 226-238
Depth-4 lower bounds, determinantal complexity: A unified approach
Suryajith Chillara
,
Partha Mukhopadhyay
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 239-250
Constant factor approximation for capacitated
k
-center with outliers
Marek Cygan
,
Tomasz Kociumaka
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 251-262
Bounds on the cover time of parallel rotor walks
Dariusz Dereniowski
,
Adrian Kosowski
,
Dominik Pajaķ
,
Przemysƚaw Uznański
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 263-275
Packing a knapsack of unknown capacity
Yann Disser
,
Max Klimm
,
Nicole Megow
,
Sebastian Stiller
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 276-287
Seiten 1
2
3
>