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=LNCS AND YEAR=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation schemes for capacitated geometric network design
Anna Adamaszek
,
Artur Czumaj
,
Andrzej Lingas
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
6755
, 2011, pp. 25-36
Advice coins for classical and quantum computation
Scott Aaronson
,
Andrew Drucker
Lecture Notes in Computer Science
6755
, 2011, pp. 61-72
Quantum commitments from complexity assumptions
André Chailloux
,
Iordanis Kerenidis
,
Bill Rosgen
Lecture Notes in Computer Science
6755
, 2011, pp. 73-85
On tree-constrained matchings and generalizations
Stefan Canzar
,
Khaled Elbassioni
,
Gunnar W. Klau
,
Julián Mestre
Lecture Notes in Computer Science
6755
, 2011, pp. 98-109
Tight bounds for linkages in planar graphs
Isolde Adler
,
Stavros G. Kolliopoulos
,
Philipp Klaus Krause
,
Daniel Lokshtanov
,
Saket Saurabh
,
Dimitrios Thilikkos
Lecture Notes in Computer Science
6755
, 2011, pp. 110-121
A tighter insertion-based approximation of the crossing number
Markus Chimani
,
Petr Hlinȇný
Lecture Notes in Computer Science
6755
, 2011, pp. 122-134
Stochastic mean payoff games: Smoothed analysis and approximation schemes
Endre Boros
,
Khaled Elbassioni
,
Mahmoud Fouz
,
Vladimir Gurvich
,
Kazuhisa Makino
,
Bodo Manthey
Lecture Notes in Computer Science
6755
, 2011, pp. 147-158
Pairwise-interaction games
Martin Dyer
,
Velumailum Mohanaraj
Lecture Notes in Computer Science
6755
, 2011, pp. 159-170
Settling the complexity of local max-cut (almost) completely
Robert Elsässer
,
Tobias Tscheuschner
Lecture Notes in Computer Science
6755
, 2011, pp. 171-182
On variants of file caching
Leah Epstein
,
Csanád Imreh
,
Asaf Levin
,
Judit Nagy-György
Lecture Notes in Computer Science
6755
, 2011, pp. 195-206
On the advice complexity of the
k
-server problem
Hans-Joachim Böckenhauer
,
Dennis Komm
,
Rastislav Královic̑
,
Richard Královic̑
Lecture Notes in Computer Science
6755
, 2011, pp. 207-218
Sleep management on multiple machines for energy and flow time
Sze-Hang Chan
,
Tak-Wah Lam
,
Lap-Kei Lee
,
Chi-Man Liu
,
Hing-Fung Ting
Lecture Notes in Computer Science
6755
, 2011, pp. 219-231
Meeting deadlines: How much speed suffices?
S. Anand
,
Naveen Garg
,
Nicole Megow
Lecture Notes in Computer Science
6755
, 2011, pp. 232-243
Range majority in constant time and linear space
Stephane Durocher
,
Meng He
,
J. Ian Munro
,
Patrick K. Nicholson
,
Matthew Skala
Lecture Notes in Computer Science
6755
, 2011, pp. 244-255
Dynamic planar range maxima queries
Gerth Stlting Brodal
,
Konstantinos Tsakalidis
Lecture Notes in Computer Science
6755
, 2011, pp. 256-267
Compact navigation and distance oracles for graphs with small treewidth
Arash Farzan
,
Shahin Kamali
Lecture Notes in Computer Science
6755
, 2011, pp. 268-280
Limits on the computational power of random strings
Eric Allender
,
Luke Friedman
,
William Gasarch
Lecture Notes in Computer Science
6755
, 2011, pp. 293-304
The decimation process in random
k
-SAT
Amin Coja-Oghlan
,
Angelica Y. Pachon-Pinzon
Lecture Notes in Computer Science
6755
, 2011, pp. 305-316
Nonmonotone submodular maximization via a structural continuous greedy algorithm
Moran Feldman
,
Joseph (Seffi) Naor
,
Roy Schwartz
Lecture Notes in Computer Science
6755
, 2011, pp. 342-353
Submodular cost allocation problem and applications
Chandra Chekuri
,
Alina Ene
Lecture Notes in Computer Science
6755
, 2011, pp. 354-366
Tamper-proof circuits: How to trade leakage for tamper-resilience
Sebastian Faust
,
Krzysztof Pietrzak
,
Daniele Venturi
Lecture Notes in Computer Science
6755
, 2011, pp. 391-402
New algorithms for learning in presence of errors
Sanjeev Arora
,
Rong Ge
Lecture Notes in Computer Science
6755
, 2011, pp. 403-415
Constraint satisfaction parameterized by solution size
Andrei A. Bulatov
,
Dániel Marx
Lecture Notes in Computer Science
6755
, 2011, pp. 424-436
Preprocessing for treewidth: A combinatorial analysis through kernelization
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
Lecture Notes in Computer Science
6755
, 2011, pp. 437-448
Subset feedback vertex set is fixed-parameter tractable
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
6755
, 2011, pp. 449-461
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>