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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=61
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scheduling chains to minimize mean flow time
Moshe Dror
,
Wieslaw Kubiak
,
Paolo Dell'Olmo
Information Processing Letters
61
(6), 1997, pp. 297-301
On learning multivariate polynomials under the uniform distribution
Nader H. Bshouty
Information Processing Letters
61
(6), 1997, pp. 303-309
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
H.S. Chao
,
F.R. Hsu
,
R.C.T. Lee
Information Processing Letters
61
(6), 1997, pp. 311-316
A note on approximating graph genus
Jianer Chen
,
Saroja P. Kanchi
,
Arkady Kanevsky
Information Processing Letters
61
(6), 1997, pp. 317-322
An exact analysis on expected seeks in shadowed disks
Athena Vakali
,
Yannis Manolopuolos
Information Processing Letters
61
(6), 1997, pp. 323-329
Minimal sense of direction in regular networks
Paola Flocchini
Information Processing Letters
61
(6), 1997, pp. 331-338
Seiten
<
1
2
3