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 YEAR=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting and randomly generating binary trees
James F. Korsh
Information Processing Letters
45
(6), 1993, pp. 291-294
Constant-slowdown simulations of normal hypercube algorithms on the butterfly network
Eric J. Schwabe
Information Processing Letters
45
(6), 1993, pp. 295-301
n^{\Omega(\log n)}
lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
Alexander Razborov
,
Avi Wigderson
Information Processing Letters
45
(6), 1993, pp. 303-307
A neural sorting network with
O(1)
time complexity
Wen-Tsuen Chen
,
Kuen-Rong Hsieh
Information Processing Letters
45
(6), 1993, pp. 309-313
Fault tolerant routing in the star and pancake interconnection networks
L. Gargano
,
U. Vaccaro
,
A. Vozella
Information Processing Letters
45
(6), 1993, pp. 315-320
Dense edge-disjoint embedding of complete binary trees in the hypercube
Somasundaram Ravindran
,
Alan Gibbons
Information Processing Letters
45
(6), 1993, pp. 321-325
Seiten
<
1
2
3
4
5
6
7
8
9