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=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some results on orthogonal factorizations
Haodi Feng
Lecture Notes in Computer Science
2108
, 2001, pp. 414-419
Cluttered orderings for the complete graph
Myra B. Cohen
,
Charles J. Colbourn
,
Dalibor Froncek
Lecture Notes in Computer Science
2108
, 2001, pp. 420-431
Improved on-line stream merging: From a restricted to a general setting
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Wai-Ha Wong
Lecture Notes in Computer Science
2108
, 2001, pp. 432-442
Competitive online scheduling with level of service
Ee-Chien Chang
,
Chee Yap
Lecture Notes in Computer Science
2108
, 2001, pp. 453-462
On-line variable sized covering
Leah Epstein
Lecture Notes in Computer Science
2108
, 2001, pp. 463-472
On testing for zero polynomials by a set of points with bounded precision
Jin-Yi Cai
,
Eric Bach
Lecture Notes in Computer Science
2108
, 2001, pp. 473-482
A randomized algorithm for gossiping in radio networks
Marek Chrobak
,
Leszek Ga̧sieniec
,
Wojciech Rytter
Lecture Notes in Computer Science
2108
, 2001, pp. 483-492
The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points
Dingzhu Du
,
Lusheng Wang
,
Baogang Xu
Lecture Notes in Computer Science
2108
, 2001, pp. 509-518
An FPTAS for weight-constrained Steiner trees in series-parallel graphs
Guangting Chen
,
Guoliang Xue
Lecture Notes in Computer Science
2108
, 2001, pp. 519-528
Decidable approximations on generalized and parameterized discrete timed automata
Zhe Dang
,
Oscar H. Ibarra
,
Richard A. Kemmerer
Lecture Notes in Computer Science
2108
, 2001, pp. 529-539
Multiplicative adaptive algorithms for user preference retrieval
Zhixiang Chen
Lecture Notes in Computer Science
2108
, 2001, pp. 540-549
Efficient experimental string matching by weak factor recognition
Cyril Allauzen
,
Maxime Crochemore
,
Mathieu Raffinot
Lecture Notes in Computer Science
2089
, 2001, pp. 51-72
Better filtering with gapped
q
-grams
Stefan Burkhardt
,
Juha Kärkkäinen
Lecture Notes in Computer Science
2089
, 2001, pp. 73-85
Fuzzy Hamming distance: A new dissimilarity measure
Abraham Bookstein
,
Shmuel Tomi Klein
,
Timo Raita
Lecture Notes in Computer Science
2089
, 2001, pp. 86-97
An extension of the periodicity lemma to longer periods
Aviezri S. Fraenkel
,
Jamie Simpson
Lecture Notes in Computer Science
2089
, 2001, pp. 98-105
A very elementary presentation of the Hannenhalli-Pevzner theory
Anne Bergeron
Lecture Notes in Computer Science
2089
, 2001, pp. 106-117
Tandem cyclic alignment
Gary Benson
Lecture Notes in Computer Science
2089
, 2001, pp. 118-130
Efficient discovery of proximity patterns with suffix arrays
Hiroki Arimura
,
Hiroki Asaka
,
Hiroshi Sakamoto
,
Setsuo Arikawa
Lecture Notes in Computer Science
2089
, 2001, pp. 152-156
Computing the equation automaton of a regular expression in
O(s^2)
space and time
Jean-Marc Champarnaud
,
Djelloul Ziadi
Lecture Notes in Computer Science
2089
, 2001, pp. 157-168
Optimally compact finite sphere packings - Hydrophobic cores in the FCC
Rolf Backofen
,
Sebastian Will
Lecture Notes in Computer Science
2089
, 2001, pp. 257-271
Two
O(\log ^* k)
-approximation algorithms for the asymmetric
k
-center problem
Aaron Archer
Lecture Notes in Computer Science
2081
, 2001, pp. 1-14
Strongly polynomial algorithms for the unsplittable flow problem
Yossi Azar
,
Oded Regev
Lecture Notes in Computer Science
2081
, 2001, pp. 15-29
Edge covers of setpairs and the iterative rounding method
Joseph Cheriyan
,
Santosh Vempala
Lecture Notes in Computer Science
2081
, 2001, pp. 30-44
The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
Cheng-Feng Mabel Chou
,
Maurice Queyranne
,
David Simchi-Levi
Lecture Notes in Computer Science
2081
, 2001, pp. 45-59
Approximate
k
-MSTs and
k
-Steiner trees via the primal-dual method and Lagrangean relaxation
Fabián A. Chudak
,
Tim Roughgarden
,
David P. Williamson
Lecture Notes in Computer Science
2081
, 2001, pp. 60-70
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>