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=Inf.~Process.~Lett. AND Volume=84
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A Kolmogorov complexity characterization of constructive Hausdorff dimension
Elvira Mayordomo
Information Processing Letters
84
(1), 2002, pp. 1-3
A framework to visualize equivalences between computational models of regular languages
Mauricio Ayala-Rincón
,
Alexsandro F. da Fonseca
,
Haydée Werneck Poubel
,
José Siqueira
Information Processing Letters
84
(1), 2002, pp. 5-16
Comparison of various trees for nearest-point search with/without the Voronoi diagram
Takeshi Kanda
,
Kokichi Sugihara
Information Processing Letters
84
(1), 2002, pp. 17-22
Near optmal Cholesky factorization on orthogonal multiprocessors
S.S. Bansal
,
B. Vishal
,
P. Gupta
Information Processing Letters
84
(1), 2002, pp. 23-30
Algorithms for multicast connection under multi-path routing model
Jun Gu
,
Xiao-Dong Hu
,
Mu-Hong Zhang
Information Processing Letters
84
(1), 2002, pp. 31-39
On the area of hypercube layouts
Ronald I. Greenberg
,
Lee Guan
Information Processing Letters
84
(1), 2002, pp. 41-46
A space- and time-efficient local-spin spin lock
Yong-Jik Kim
,
James H. Anderson
Information Processing Letters
84
(1), 2002, pp. 47-55
The equality problem for Parikh simple algebraic power series
Juha Honkala
Information Processing Letters
84
(2), 2002, pp. 57-60
Accelerated diffusion algorithms for dynamic load balancing
Gregory Karagiorgos
,
Nikolaos M. Missirlis
Information Processing Letters
84
(2), 2002, pp. 61-67
On the existence and construction of non-extreme
(a, b)
-trees
Lars Jacobsen
,
Kim S. Larsen
,
Morten N. Nielsen
Information Processing Letters
84
(2), 2002, pp. 69-73
A logical characterization of data languages
Patricia Bouyer
Information Processing Letters
84
(2), 2002, pp. 75-85
Optimal 1-edge fault-tolerant designs for ladders
Yen-Chu Chuang
,
Lih-Hsing Hsu
,
Chung-Haw Chang
Information Processing Letters
84
(2), 2002, pp. 87-92
Deadline-based scheduling of periodic task systems on multiprocessors
Anand Srinivasan
,
Sanjoy Baruah
Information Processing Letters
84
(2), 2002, pp. 93-98
A note on the minimum label spanning tree
Yingyu Wan
,
Guoliang Chen
,
Yinlong Xu
Information Processing Letters
84
(2), 2002, pp. 99-101
On the terminal Steiner tree problem
Guohui Lin
,
Guoliang Xue
Information Processing Letters
84
(2), 2002, pp. 103-107
Scheduling time-constrained multicast messages in circuit-switched tree networks
Oh-Heum Kwon
Information Processing Letters
84
(2), 2002, pp. 109-116
How to decrypt or even substitute DES-encrypted messages in
2^{28}
steps
Eli Biham
Information Processing Letters
84
(3), 2002, pp. 117-124
A semantics of sequence diagrams
Seung Mo Cho
,
Hyung Ho Kim
,
Sung Deok Cha
,
Doo Hwan Bae
Information Processing Letters
84
(3), 2002, pp. 125-130
Minimum feedback vertex set and acyclic coloring
Guillaume Fertin
,
Emmanuel Godard
,
André Raspaud
Information Processing Letters
84
(3), 2002, pp. 131-139
Tight upper bound on the number of edges in bipartite
K_{3,3}
-free or
K_5
-free graph with an application
Zhi-Zhong Chen
,
Shiquing Zhang
Information Processing Letters
84
(3), 2002, pp. 141-145
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency
Hans Kleine Büning
,
Xishun Zhao
Information Processing Letters
84
(3), 2002, pp. 147-151
Priority algorithms for makespan minimization in the subset model
Oded Regev
Information Processing Letters
84
(3), 2002, pp. 153-157
On the minimal information to encode timestamps in distributed computations
Roberto Baldoni
,
Giovanna Melideo
Information Processing Letters
84
(3), 2002, pp. 159-166
Efficient generation of plane trees
Shin-ichi Nakano
Information Processing Letters
84
(3), 2002, pp. 167-172
Packing triangles in bounded degree graphs
Alberto Caprara
,
Romeo Rizzi
Information Processing Letters
84
(4), 2002, pp. 175-180
Seiten 1
2
>