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=J. Algorithms AND YEAR=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Augmenting undirected edge connectivity in
{\tilde{O}}(n^2)
time
András A. Benczúr
,
David R. Karger
Journal of Algorithms
37
(1), 2000, pp. 2-36
On local register allocation
Martin Farach-Colton
,
Vincenzo Liberatore
Journal of Algorithms
37
(1), 2000, pp. 37-65
A polylogarithmic approximation algorithm for the group Steiner tree problem
Naveen Garg
,
Goran Konjevod
,
R. Ravi
Journal of Algorithms
37
(1), 2000, pp. 66-84
Fast distributed algorithms for Brooks-Vizing colorings
David A. Grable
,
Alessandro Panconesi
Journal of Algorithms
37
(1), 2000, pp. 85-120
Extended Hilbert irreducibility and its applications
Ming-Deh Huang
,
Yiu-Chung Wong
Journal of Algorithms
37
(1), 2000, pp. 121-145
Analysis of a local search heuristic for facility location problems
Madhukar R. Korupolu
,
C. Greg Plaxton
,
Rajmohan Rajaraman
Journal of Algorithms
37
(1), 2000, pp. 146-188
On the exact worst case query complexity of planar point location
Raimund Seidel
,
Udo Adamy
Journal of Algorithms
37
(1), 2000, pp. 189-217
On-line paging against adversarially biased random inputs
Neal E. Young
Journal of Algorithms
37
(1), 2000, pp. 218-235
The asymptotic worst-case behavior of the FFD heuristic for small items
Kaihong Xu
Journal of Algorithms
37
(2), 2000, pp. 237-246
Pattern matching with swaps
Amihood Amir
,
Yonatan Aumann
,
Gad M. Landau
,
Moshe Lewenstein
,
Noa Lewenstein
Journal of Algorithms
37
(2), 2000, pp. 247-266
Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over
GF(2)
Kevin Cattell
,
Frank Ruskey
,
Joe Sawada
,
Micaela Serra
,
C. Robert Miers
Journal of Algorithms
37
(2), 2000, pp. 267-282
A new multichannel recursive least squares algorithm for very robust and effcient adaptive filtering
Y. Boutalis
,
C. Papaodysseus
,
E. Koukoutsis
Journal of Algorithms
37
(2), 2000, pp. 283-308
Text indexing and dictionary matching with one error
Amihood Amir
,
Dmitry Keselman
,
Gad M. Landau
,
Moshe Lewenstein
,
Noa Lewenstein
,
Michael Rodeh
Journal of Algorithms
37
(2), 2000, pp. 309-325
Splitting off edges within a specified subset preserving the edge-connectivity of the graph
Jrgen Bang-Jensen
,
Tibor Jordán
Journal of Algorithms
37
(2), 2000, pp. 326-343
On assessing the performance of randomized algorithms
Sorana Froda
Journal of Algorithms
37
(2), 2000, pp. 344-362
Box-rectangular drawings of plane graphs
Md. Saidur Rahman
,
Shin-ichi Nakano
,
Takao Nishizeki
Journal of Algorithms
37
(2), 2000, pp. 363-398
A framework for drawing planar graphs with curves and polylines
Michael T. Goodrich
,
Christopher G. Wagner
Journal of Algorithms
37
(2), 2000, pp. 399-421
Sum multicoloring of graphs
Amotz Bar-Noy
,
Magnús M. Halldórsson
,
Guy Kortsarz
,
Ravit Salman
,
Hadas Shachnai
Journal of Algorithms
37
(2), 2000, pp. 422-450
Rectangular tiling in multidimensional arrays
Adam Smith
,
Subhash Suri
Journal of Algorithms
37
(2), 2000, pp. 451-467
The Las-Vegas processor identity problem - (How and when to be unique)
Shay Kutten
,
Rafail Ostrovsky
,
Boaz Patt-Shamir
Journal of Algorithms
37
(2), 2000, pp. 468-494
Complexity of recognizing equal unions in families of sets
David P. Jacobs
,
Robert E. Jamison
Journal of Algorithms
37
(2), 2000, pp. 495-504
Finding skew partitions efficiently
Celina M.H. de Figueiredo
,
Sulamita Klein
,
Yoshiharu Kohayakawa
,
Bruce A. Reed
Journal of Algorithms
37
(2), 2000, pp. 505-521
Algorithmic aspects of tree amalgamation
Sebastian Böcker
,
David Bryant
,
Andreas W.M. Dress
,
Mike A. Steel
Journal of Algorithms
37
(2), 2000, pp. 522-537
Safety zone problem
Subhas C. Nandy
,
Bhargab B. Bhattacharya
,
Antonio Hernández-Barrera
Journal of Algorithms
37
(2), 2000, pp. 538-569
Incremental and decremental maintenance of planar width
David Eppstein
Journal of Algorithms
37
(2), 2000, pp. 570-577
Seiten 1
2
3
>