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 Volume=5555
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning halfspaces with malicious noise
Adam R. Klivans
,
Philip M. Long
,
Rocco A. Servedio
Lecture Notes in Computer Science
5555
, 2009, pp. 609-621
General scheme for perfect quantum network coding with free classical communication
Hirotada Kobayashi
,
François Le Gall
,
Harumichi Nishimura
,
Martin Rötteler
Lecture Notes in Computer Science
5555
, 2009, pp. 622-633
Greedy
\Delta
-approximation algorithm for covering with arbitrary constraints and submodular cost
Christos Koufogiannakis
,
Neal E. Young
Lecture Notes in Computer Science
5555
, 2009, pp. 634-652
Limits and applications of group algebras for parameterized problems
Ioannis Koutis
,
Ryan Williams
Lecture Notes in Computer Science
5555
, 2009, pp. 653-664
Sleep with guilt and work faster to minimize flow plus energy
Tak-Wah Lam
,
Lap-Kei Lee
,
Hing-Fung Ting
,
Isaac K.K. To
,
Prudence W.H. Wong
Lecture Notes in Computer Science
5555
, 2009, pp. 665-676
Improved bounds for flow shop scheduling
Monaldo Mastrolilli
,
Ola Svensson
Lecture Notes in Computer Science
5555
, 2009, pp. 677-688
A 3/2-approximation algorithm for general stable marriage
Eric McDermid
Lecture Notes in Computer Science
5555
, 2009, pp. 689-700
Limiting negations in formulas
Hiroki Morizumi
Lecture Notes in Computer Science
5555
, 2009, pp. 701-712
Fast polynomial-space algorithms using Möbius inversion: Improving on Steiner tree and related problems
Jesper Nederlof
Lecture Notes in Computer Science
5555
, 2009, pp. 713-725
Superhighness and strong jump traceability
André Nies
Lecture Notes in Computer Science
5555
, 2009, pp. 726-737
Amortized communication complexity of distributions
Jérémie Roland
,
Mario Szegedy
Lecture Notes in Computer Science
5555
, 2009, pp. 738-749
The number of symbol comparisons in QuickSort and QuickSelect
Brigitte Vallée
,
Julien Clément
,
James Allen Fill
,
Philippe Flajolet
Lecture Notes in Computer Science
5555
, 2009, pp. 750-763
Computing the girth of a planar graph in
O(n \log n)
time
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
5555
, 2009, pp. 764-773
Elimination graphs
Yuli Ye
,
Allan Borodin
Lecture Notes in Computer Science
5555
, 2009, pp. 774-785
Seiten
<
1
2
3