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.
On computing representatives
Richard S. Bird
,
Jesús N. Ravelo
Information Processing Letters
63
(1), 1997, pp. 1-7
On building the transitive reduction of a two-dimensional poset
Enrico Nardelli
,
Vincenzo Mastrobuoni
,
Alesiano Santomo
Information Processing Letters
63
(1), 1997, pp. 9-12
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
Hon-Chan Chen
,
Yue-Li Wang
Information Processing Letters
63
(1), 1997, pp. 13-18
A simple approach for generating RSA keys
Chin-Chen Chang
,
Shin-Jia Hwang
Information Processing Letters
63
(1), 1997, pp. 19-21
On the impact of sense of direction on message complexity
Paola Flocchini
,
Bernard Mans
,
Nicola Santoro
Information Processing Letters
63
(1), 1997, pp. 23-31
A permanent formula with many zero-valued terms
Eric Bax
,
Joel Franklin
Information Processing Letters
63
(1), 1997, pp. 33-39
More information theoretical inequalities to be used in secret sharing?
Marten van Dijk
Information Processing Letters
63
(1), 1997, pp. 41-44
Partially dynamic bin packing can be solved within
1+\varepsilon
in (amortized) polylogarithmic time
Zoran Ivković
,
Errol L. Lloyd
Information Processing Letters
63
(1), 1997, pp. 45-50
A lower bound for randomized on-line multiprocessor scheduling
Jiȓí Sgall
Information Processing Letters
63
(1), 1997, pp. 51-55
A fst algorithm for stereo matching
Kuo-Liang Chung
Information Processing Letters
63
(2), 1997, pp. 57-61
An approximation algorithm for maximum packing of 3-edge paths
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
63
(2), 1997, pp. 63-67
Partitions with minimum entropy of regions in
R^2
J.G. Gaines
Information Processing Letters
63
(2), 1997, pp. 69-73
Dynamic maintenance of majority information in constant time per update
Gudmund S. Frandsen
,
Sven Skyum
Information Processing Letters
63
(2), 1997, pp. 75-78
A better lower bound on the competitive ratio of the randomized 2-server problem
Marek Chrobak
,
Lawrence L. Larmore
,
Carsten Lund
,
Nick Reingold
Information Processing Letters
63
(2), 1997, pp. 79-83
Impossiibility results for weak threshold networks
Costas Busch
,
Marios Mavronicolas
Information Processing Letters
63
(2), 1997, pp. 85-90
Recognizing Hamming graphs in linear time and space
Wilfried Imrich
,
Sandi Klavz̑ar
Information Processing Letters
63
(2), 1997, pp. 91-95
3D straight-line grid drawing of 4-colorable graphs
Tiziana Calamoneri
,
Andrea Sterbini
Information Processing Letters
63
(2), 1997, pp. 97-102
Bounded fan-out
m
-center problem
Jan-Ming Ho
,
Ming-Tat Ko
Information Processing Letters
63
(2), 1997, pp. 103-108
The bit complexity of the predecessor problem
Y. Afek
,
M. Cohen
,
E. Haalman
Information Processing Letters
63
(2), 1997, pp. 109-112
Performance bounds for modeling NUMA architectures
Robert Geist
Information Processing Letters
63
(2), 1997, pp. 113-117
A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
A.K. Amoura
Information Processing Letters
63
(3), 1997, pp. 119-122
On embedding rectangular meshes into rectangular meshes of smaller aspect ratio
Shou-Hsuan S. Huang
,
Hongfei Liu
,
Rakesh M. Verma
Information Processing Letters
63
(3), 1997, pp. 123-129
On universal learning algorithms
Oded Goldreich
,
Dana Ron
Information Processing Letters
63
(3), 1997, pp. 131-136
Finite automata-models for the investigation of dynamical systems
Christian Schittenkopf
,
Gustavo Deco
,
Wilfried Brauer
Information Processing Letters
63
(3), 1997, pp. 137-141
A nonapproximability result for finite function generation
P. Jonsson
Information Processing Letters
63
(3), 1997, pp. 143-145
Seiten 1
2
3
>