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: Journal=Algorithmica AND Volume=55
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An improved parameterized algorithm for the Minimum Node Multiway Cut problem
Jianer Chen
,
Yang Liu
,
Songjian Lu
Algorithmica
55
(1), 2009, pp. 1-13
A separation bound for real algebraic expressions
Christoph Burnikel
,
Stefan Funke
,
Kurt Mehlhorn
,
Stefan Schirra
,
Susanne Schmitt
Algorithmica
55
(1), 2009, pp. 14-28
A fast algorithm for adaptive prefix coding
Marek Karpinski
,
Yakov Nekrich
Algorithmica
55
(1), 2009, pp. 29-41
An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
Benjamin Birnbaum
,
Kenneth J. Goldman
Algorithmica
55
(1), 2009, pp. 42-59
Indexing factors with gaps
Costas S. Iliopoulos
,
M. Sohel Rahman
Algorithmica
55
(1), 2009, pp. 60-70
The network as a storage device: Dynamic routing with bounded buffers
Stanislav Angelov
,
Sanjeev Khanna
,
Keshav Kunal
Algorithmica
55
(1), 2009, pp. 71-94
Incremental construction of minimal tree automata
Rafael C. Carrasco
,
Jan Daciuk
,
Mikel L. Forcada
Algorithmica
55
(1), 2009, pp. 95-110
Derandomized constructions of
k
-wise (almost) independent permutations
Eyal Kaplan
,
Moni Naor
,
Omer Reingold
Algorithmica
55
(1), 2009, pp. 113-133
Reconstructive dispersers and hitting set generators
Christopher Umans
Algorithmica
55
(1), 2009, pp. 134-156
What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
Kamalika Chaudhuri
,
Satish Rao
,
Samantha Riesenfeld
,
Kunal Talwar
Algorithmica
55
(1), 2009, pp. 157-189
Approximating the bandwidth of caterpillars
Uriel Feige
,
Kunal Talwar
Algorithmica
55
(1), 2009, pp. 190-204
Scheduling on unrelated machines under tree-like precedence constraints
V.S. Anil Kumar
,
Madhav V. Marathe
,
Srinivasan Parthasarathy
,
Aravind Srinivasan
Algorithmica
55
(1), 2009, pp. 205-226
A primal-dual approximation algorithm for Partial Vertex Cover: Making educated guesses
Julián Mestre
Algorithmica
55
(1), 2009, pp. 227-239
Approximation schemes for node-weighted geometric Steiner tree problems
Jan Remy
,
Angelika Steger
Algorithmica
55
(1), 2009, pp. 240-267
Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons
Jakub Pawlewicz
,
Mihai Pȃtraşcu
Algorithmica
55
(2), 2009, pp. 271-282
Linear data structures for fast ray-shooting amidst convex polyhedra
Haim Kaplan
,
Natan Rubin
,
Micha Sharir
Algorithmica
55
(2), 2009, pp. 283-310
Optimal algorithms for
k
-search with application in option pricing
Julian Lorenz
,
Konstantinos Panagiotou
,
Angelika Steger
Algorithmica
55
(2), 2009, pp. 311-328
Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
Peter Hachenberger
Algorithmica
55
(2), 2009, pp. 329-345
Graph spanners in the streaming model: An experimental study
Giorgio Ausiello
,
Camil Demetrescu
,
Paolo G. Franciosa
,
Giuseppe F. Italiano
,
Andrea Ribichini
Algorithmica
55
(2), 2009, pp. 346-374
Algorithms to separate
\{0,\frac{1}{2}\}
-Chvátal-Gomory cuts
Arie M.C.A. Koster
,
Adrian Zymolka
,
Manuel Kutschka
Algorithmica
55
(2), 2009, pp. 375-391
A polynomial quantum algorithm for approximating the Jones polynomial
Dorit Aharonov
,
Vaughan Jones
,
Zeph Landau
Algorithmica
55
(3), 2009, pp. 395-421
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
Andris Ambainis
,
Robert S̑palek
,
Ronald de Wolf
Algorithmica
55
(3), 2009, pp. 422-461
Quantum information and the PCP theorem
Ran Raz
Algorithmica
55
(3), 2009, pp. 462-489
Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
Jaikumar Radhakrishnan
,
Martin Rötteler
,
Pranab Sen
Algorithmica
55
(3), 2009, pp. 490-516
Error-detection-based quantum fault-tolerance threshold
Ben W. Reichardt
Algorithmica
55
(3), 2009, pp. 517-556
Seiten 1
2
>