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 YEAR=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Energy-efficient algorithms
Susanne Albers
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 1-2
Constraints, graphs, algebra, logic, and complexity
Moshe Y. Vardi
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 3-3
Physical limits of communication
Madhu Sudan
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 4-5
A domain-specific language for computing on encrypted data
Alex Bain
,
John Mitchell
,
Rahul Sharma
,
Deian Stefan
,
Joe Zimmerman
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 6-24
Schema mappings and data examples: Deriving syntax from semantics
Phokion G. Kolaitis
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 25-25
Quantum state description complexity
Umesh V. Vazirani
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 26-27
Approximation algorithms for union and intersection covering problems
Marek Cygan
,
Fabrizio Grandoni
,
Stefano Leonardi
,
Marcin Mucha
,
Marcin Pilipczuk
,
Piotr Sankowski
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 28-40
Tight gaps for vertex cover in the Sherali-Adams SDP hierarchy
Siavosh Benabbas
,
Siu On Chan
,
Konstantinos Georgiou
,
Avner Magen
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 41-54
Applications of discrepancy theory in multiobjective approximation
Christian Glaßer
,
Christian Reitwießner
,
Maximilian Witek
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 55-65
Quasi-weak cost automata: A new variant of weakness
Denis Kuperberg
,
Michael Vanden Boom
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 66-77
Using non-convex approximations for efficient analysis of timed automata
Frédéric Herbreteau
,
Dileep Kini
,
B. Srivathsan
,
Igor Walukiewicz
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 78-89
Shrinking timed automata
Ocan Sankur
,
Patricia Bouyer
,
Nicolas Markey
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 90-102
The quantitative linear-time-branching-time spectrum
Uli Fahrenberg
,
Axel Legay
,
Claus Thrane
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 103-114
Isomorphism testing of read-once functions and polynomials
B.V. Raghavendra Rao
,
Jayalal M.N. Sarma
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 115-126
The limited power of powering: Polynomial identity testing and a depth-four lower bound for the permanent
Bruno Grenet
,
Pascal Koiran
,
Natacha Portier
,
Yann Strozecki
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 127-139
Petri net reachability graphs: Decidability status of FO properties
Philippe Darondeau
,
Stéphane Demri
,
Roland Meyer
,
Christophe Morvan
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 140-151
Approximating Petri net reachability along context-free traces
Mohamed Faouzi Atig
,
Pierre Ganty
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 152-163
Minimum fill-in of sparse graphs: Kernelization and approximation
Fedor V. Fomin
,
Geevarghese Philip
,
Yngve Villanger
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 164-175
Cubicity, degeneracy, and crossing number
Abhijin Adiga
,
L. Sunil Chandran
,
Rogers Mathew
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 176-190
Conditional reactive systems
H.J. Sander Bruggink
,
Raphaël Cauderlier
,
Mathias Hülsbusch
,
Barbara König
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 191-203
Transforming password protocols to compose
Céline Chevalier
,
Stéphanie Delaune
,
Steve Kremer
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 204-216
Obtaining a bipartite graph by contracting few edges
Pinar Heggernes
,
Pim van 't Hof
,
Daniel Lokshtanov
,
Christophe Paul
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 217-228
Simultaneously satisfying linear equations over
\mathbb F_2
: MaxLin2 and Max-
r
-lin2 parameterized above average
Robert Crowston
,
Michael Fellows
,
Gregory Gutin
,
Mark Jones
,
Frances Rosamond
,
Stéphan Thomassé
,
Anders Yeo
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 229-240
Rainbow connectivity: Hardness and tractability
Prabhanjan Ananth
,
Meghana Nasre
,
Kanthi K. Sarpatwar
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 241-251
Dependence logic with a majority quantifier
Arnaud Durand
,
Johannes Ebbing
,
Juha Kontinen
,
Heribert Vollmer
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 252-263
Seiten 1
2
3
4
>