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=34
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simple optimal parallel multiple pattern matching
S. Muthukrishnan
Journal of Algorithms
34
(1), 2000, pp. 1-13
Polynomial-time analysis of toroidal periodic graphs
F. Höfting
,
E. Wanke
Journal of Algorithms
34
(1), 2000, pp. 14-39
On crossing sets, disjoint sets, and pagenumber
Farhad Shahrokhi
,
Weiping Shi
Journal of Algorithms
34
(1), 2000, pp. 40-53
Approximation results for the optimum cost chromatic partition problem
Klaus Jansen
Journal of Algorithms
34
(1), 2000, pp. 54-89
Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network
Biing-Feng Wang
Journal of Algorithms
34
(1), 2000, pp. 90-108
Efficient and robust sharing of memory in message-passing systems
Hagit Attiya
Journal of Algorithms
34
(1), 2000, pp. 109-127
Self-simulation for the passive optical star
Pascal Berthomé
,
Torben Hagerup
,
Ilan Newman
,
Assaf Schuster
Journal of Algorithms
34
(1), 2000, pp. 128-147
Average costs of a graph exploration: Upper and lower bounds
Nicola Galli
Journal of Algorithms
34
(1), 2000, pp. 148-176
A faster algorithm for the inverse spanning tree problem
Ravindra K. Ahuja
,
James B. Orlin
Journal of Algorithms
34
(1), 2000, pp. 177-193
Some open problems in computational molecular biology
Tao Jiang
,
Paul Kearney
,
Ming Li
Journal of Algorithms
34
(1), 2000, pp. 194-201
Greedily finding a dense subgraph
Yuichi Asahiro
,
Kazuo Iwama
,
Hisao Tamaki
,
Takeshi Tokuyama
Journal of Algorithms
34
(2), 2000, pp. 203-221
Computing vertex connectivity: New bounds from old techniques
Monika R. Henzinger
,
Satish Rao
,
Harold N. Gabow
Journal of Algorithms
34
(2), 2000, pp. 222-250
Fully dynamic algorithms for maintaining shortest paths trees
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Journal of Algorithms
34
(2), 2000, pp. 251-281
Competitive algorithms for relaxed list update and multilevel caching
Marek Chrobak
,
John Noga
Journal of Algorithms
34
(2), 2000, pp. 282-308
Multiset permutations and loopless generation of ordered trees with specified degree sequence
James F. Korsh
,
Paul LaFollette
Journal of Algorithms
34
(2), 2000, pp. 309-336
Efficient algorithms for finding the maximum number of disjoint paths in grids
Wun-Tat Chan
,
Francis Y.L. Chin
Journal of Algorithms
34
(2), 2000, pp. 337-369
Online scheduling with hard deadlines
Sally A. Goldman
,
Jyoti Parwatikar
,
Subhash Suri
Journal of Algorithms
34
(2), 2000, pp. 370-389
Edge-coloring bipartite graphs
Ajai Kapoor
,
Romeo Rizzi
Journal of Algorithms
34
(2), 2000, pp. 390-396