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=63
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Detecting conjunctions of global predicates
Vijay K. Garg
,
J. Roger Mitchell
Information Processing Letters
63
(6), 1997, pp. 295-302
Logarithmic width, linear area upward drawing of AVL trees
Sung Kwon Kim
Information Processing Letters
63
(6), 1997, pp. 303-307
Efficient stream distribution algorithm for heterogeneous multimedia multicast with link capacity constraint
Seung-Hoon Kim
,
Kyungshik Lim
,
Cheeha Kim
Information Processing Letters
63
(6), 1997, pp. 309-315
Lower bounds for robust secret sharing schemes
Carlo Blundo
,
Alfredo de Santis
Information Processing Letters
63
(6), 1997, pp. 317-321
On non-smooth convex distance functions
Ngọc-Minh Lê
Information Processing Letters
63
(6), 1997, pp. 323-329
An insight on PRAM computational bounds
Fabrizio Luccio
,
Linda Pagli
Information Processing Letters
63
(6), 1997, pp. 331-336
Seiten
<
1
2
3