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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The
k
-Steiner ratio in the rectilinear plane
Al Borchers
,
Ding-Zhu Du
,
Biao Gao
,
Pengjun Wan
Journal of Algorithms
29
(1), 1998, pp. 1-17
On the comparison complexity of the string prefix-matching problem
Dany Breslauer
,
Livio Colussi
,
Laura Toniolo
Journal of Algorithms
29
(1), 1998, pp. 18-67
Selection on mesh connected computers with fixed and reconfigurable buses
Sanguthevar Rajasekaran
Journal of Algorithms
29
(1), 1998, pp. 68-81
All-pairs min-cut in sparse networks
Srinivasa R. Arikati
,
Shiva Chaudhuri
,
Christos D. Zaroliagis
Journal of Algorithms
29
(1), 1998, pp. 82-110
Tree powers
Paul E. Kearney
,
Derek G. Corneil
Journal of Algorithms
29
(1), 1998, pp. 111-131
Approximating maximum leaf spanning trees in almost linear time
Hsueh-I Lu
,
R. Ravi
Journal of Algorithms
29
(1), 1998, pp. 132-141
Optimal constructions of hybrid algorithms
Ming-Yang Kao
,
Yuan Ma
,
Michael Sipser
,
Yiqun Yin
Journal of Algorithms
29
(1), 1998, pp. 142-164
Generation of well-formed parenthesis strings in constant worst-case time
Timothy R. Walsh
Journal of Algorithms
29
(1), 1998, pp. 165-173
Approximating clique and biclique problems
Dorit S. Hochbaum
Journal of Algorithms
29
(1), 1998, pp. 174-200
Computing a minimum weight
k
-link path in graphs with the concave Monge property
Baruch Schieber
Journal of Algorithms
29
(2), 1998, pp. 204-222
Register allocation in structured programs
Sampath Kannan
,
Todd Proebsting
Journal of Algorithms
29
(2), 1998, pp. 223-237
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
L. Paul Chew
,
Klara Kedem
,
Micha Sharir
,
Boaz Tagansky
,
Emo Welzl
Journal of Algorithms
29
(2), 1998, pp. 238-255
Approximate indexed lists
Arne Andersson
,
Ola Petersson
Journal of Algorithms
29
(2), 1998, pp. 256-276
Average-case analysis of off-line and on-line knapsack problems
George S. Lueker
Journal of Algorithms
29
(2), 1998, pp. 277-305
Fairness in scheduling
Miklos Ajtai
,
James Aspnes
,
Moni Naor
,
Yuval Rabani
,
Leonard J. Schulman
,
Orli Waarts
Journal of Algorithms
29
(2), 1998, pp. 306-357
Design of practical and provably good random number generators
William Aiello
,
S. Raj Rajagopalan
,
Ramarathnam Venkatesan
Journal of Algorithms
29
(2), 1998, pp. 358-389
Greedy dynamic routing on arrays
Nabil Kahale
,
Tom Leighton
Journal of Algorithms
29
(2), 1998, pp. 390-410
The optimal alphabetic tree problem revisited
Lawrence L. Larmore
,
Teresa M. Przytycka
Journal of Algorithms
28
(1), 1998, pp. 1-20
The variance of two game tree algorithms
Yanjun Zhang
Journal of Algorithms
28
(1), 1998, pp. 21-39
Fast distributed construction of small
k
-dominating sets and applications
Shay Kutten
,
David Peleg
Journal of Algorithms
28
(1), 1998, pp. 40-66
Distributed paging for general networks
Baruch Awerbuch
,
Yair Bartal
,
Amos Fiat
Journal of Algorithms
28
(1), 1998, pp. 67-104
A better approximation ratio for the minimum size
k
-edge-connected spanning subgraph problem
Cristina G. Fernandes
Journal of Algorithms
28
(1), 1998, pp. 105-124
Finding real-valued single-source shortest paths in
o(n^3)
expected time
Stavros G. Kolliopoulos
,
Clifford Stein
Journal of Algorithms
28
(1), 1998, pp. 125-141
Bicriteria network design problems
Madhav V. Marathe
,
R. Ravi
,
Ravi Sundaram
,
S.S. Ravi
,
Daniel J. Rosenkrantz
,
Harry B. Hunt III
Journal of Algorithms
28
(1), 1998, pp. 142-171
Transformations on words
Dominique Foata
,
Guo-Niu Han
Journal of Algorithms
28
(1), 1998, pp. 172-191
Seiten 1
2
3
>