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 Volume=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Digital access to comparison-based tree data structures and algorithms
Salvador Roura
Journal of Algorithms
40
(1), 2001, pp. 1-23
Improved bandwith approximation for trees and chordal graphs
Anupam Gupta
Journal of Algorithms
40
(1), 2001, pp. 24-36
The complete analysis of a polynomial factorization algorithm over finite fields
P. Flajolet
,
X. Gourdon
,
D. Panario
Journal of Algorithms
40
(1), 2001, pp. 37-81
A simple linear time algorithm for proper box rectangular drawings of plane graphs
Xin He
Journal of Algorithms
40
(1), 2001, pp. 82-101
An almost-greedy search on random binary vectors and random graphs
Avner Dor
,
Eitan Greenshtein
Journal of Algorithms
40
(1), 2001, pp. 102-133
New algorithm for ordered tree-to-tree correction problem
Weimin Chen
Journal of Algorithms
40
(2), 2001, pp. 135-158
Unique maximum matching algorithms
Harold N. Gabow
,
Haim Kaplan
,
Robert E. Tarjan
Journal of Algorithms
40
(2), 2001, pp. 159-183
Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs
Eran Halperin
,
Uri Zwick
Journal of Algorithms
40
(2), 2001, pp. 184-211
An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
Ming-Yang Kao
,
Tak-Wah Lam
,
Wing-Kin Sung
,
Hing-Fung Ting
Journal of Algorithms
40
(2), 2001, pp. 212-233