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=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An
n \log n
algorithm for online BDD refinement
Nils Klarlund
Journal of Algorithms
32
(2), 1999, pp. 133-154
Twist-rotation transformations of binary trees and arithmetic expressions
Ming Li
,
Louxin Zhang
Journal of Algorithms
32
(2), 1999, pp. 155-166
Graphs with branchwidth at most three
Hans L. Bodlaender
,
Dimitrios M. Thilikos
Journal of Algorithms
32
(2), 1999, pp. 167-194
Bounding the compression loss of the FGK algorithm
Ruy Luiz Milidiú
,
Eduardo Sany Laber
,
Artur Alves Pessoa
Journal of Algorithms
32
(2), 1999, pp. 195-211
Data structures for mobile data
Julien Basch
,
Leonidas J. Guibas
,
John Hershberger
Journal of Algorithms
31
(1), 1999, pp. 1-28
Optimal coarsening of unstructured meshes
Gary L. Miller
,
Dafna Talmor
,
Shang-Hua Teng
Journal of Algorithms
31
(1), 1999, pp. 29-65
The influence of caches on the performance of sorting
Anthony LaMarca
,
Richard E. Ladner
Journal of Algorithms
31
(1), 1999, pp. 66-104
Shortest-path routing in arbitrary networks
Friedhelm Meyer auf der Heide
,
Berthold Vöcking
Journal of Algorithms
31
(1), 1999, pp. 105-131
Sylow subgroups in parallel
William M. Kantor
,
Eugene M. Luks
,
Peter D. Mark
Journal of Algorithms
31
(1), 1999, pp. 132-195
A greedy on-line algorithm for the
k
-track assignment problem
U. Faigle
,
W. Kern
,
W.M. Nawijn
Journal of Algorithms
31
(1), 1999, pp. 196-210
Approximating node-deletion problems for matroidal properties
Toshihiro Fujito
Journal of Algorithms
31
(1), 1999, pp. 211-227
Greedy strikes back: Improved facility location algorithms
Sudipto Guha
,
Samir Khuller
Journal of Algorithms
31
(1), 1999, pp. 228-248
On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs
Cristina Bazgan
,
Miklos Santha
,
Zsolt Tuza
Journal of Algorithms
31
(1), 1999, pp. 249-268
An approximate probabilistic model for structured Gaussian elimination
Edward A. Bender
,
E. Rodney Canfield
Journal of Algorithms
31
(2), 1999, pp. 271-290
Improved dynamic text indexing
Paolo Ferragina
,
Roberto Grossi
Journal of Algorithms
31
(2), 1999, pp. 291-319
Optimal space distributed order-preserving lists
Michael Saks
,
Fotios Zaharoglou
Journal of Algorithms
31
(2), 1999, pp. 320-334
Parameterizing above guaranteed values: MaxSat and MaxCut
Meena Mahajan
,
Venkatesh Raman
Journal of Algorithms
31
(2), 1999, pp. 335-354
General balanced trees
Arne Andersson
Journal of Algorithms
30
(1), 1999, pp. 1-18
Time-work tradeoffs of the single-source shortest paths problem
Hanmao Shi
,
Thomas H. Spencer
Journal of Algorithms
30
(1), 1999, pp. 19-32
Small-rank selection in parallel, with applications to heap construction
Paul F. Dietz
,
Rajeev Raman
Journal of Algorithms
30
(1), 1999, pp. 33-51
Low energy and mutually distant sampling
Shang-Hua Teng
Journal of Algorithms
30
(1), 1999, pp. 52-67
The instancy of snapshots and commuting objects
Yehuda Afek
,
Eytan Weisberger
Journal of Algorithms
30
(1), 1999, pp. 68-105
Convergence complexity of optimistic rate-based flow-control algorithms
Yehuda Afek
,
Yishay Mansour
,
Zvi Ostfeld
Journal of Algorithms
30
(1), 1999, pp. 106-143
Fault-local distributed mending
Shay Kutten
,
David Peleg
Journal of Algorithms
30
(1), 1999, pp. 144-165
Distance approximating trees for chordal and dually chordal graphs
Andreas Brandstädt
,
Victor Chepoi
,
Feodor Dragan
Journal of Algorithms
30
(1), 1999, pp. 166-184
Seiten
<
1
2
3
>