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=73
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On spanning trees with restricted degrees
Atsushi Kaneko
,
Kiyoshi Yoshimoto
Information Processing Letters
73
(5-6), 2000, pp. 163-165
A note on ``Category and measure in complexity classes''
Liang Chen
,
Naoyuki Tokuda
Information Processing Letters
73
(5-6), 2000, pp. 167-168
Redundancy removal in multicast protocols
Steven McKellar
,
Robert Davis
Information Processing Letters
73
(5-6), 2000, pp. 169-173
Domains of partial attributed tree transducers
Zoltán Fülöp
,
Sebastian Maneth
Information Processing Letters
73
(5-6), 2000, pp. 175-180
Maximum weight independent sets and cliques in intersection graphs of filaments
Fanica Gavril
Information Processing Letters
73
(5-6), 2000, pp. 181-188
RNS architectures for the implementation of the ``diagonal function''
G. Dimauro
,
S. Impedovo
,
G. Pirlo
,
A. Salzo
Information Processing Letters
73
(5-6), 2000, pp. 189-198
An improved testing scheme for catastrophic fault patterns
A. Nayak
,
J. Ren
,
N. Santoro
Information Processing Letters
73
(5-6), 2000, pp. 199-206
From binary consensus to multivalued consensus in asynchronous message-passing systems
Achour Mostefaoui
,
Michel Raynal
,
Frédéric Tronel
Information Processing Letters
73
(5-6), 2000, pp. 207-212
Learning unions of high-dimensional boxes over the reals
Amos Beimel
,
Ekyal Kushilevitz
Information Processing Letters
73
(5-6), 2000, pp. 213-220
Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
Daniel S̑tefankovic̑
Information Processing Letters
73
(5-6), 2000, pp. 221-225
Seiten
<
1
2