-
1
-
-
0000617715
-
Improved routing strategies with succinct tables
-
B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg, Improved routing strategies with succinct tables, J. Algorithms 11 (1990) 307-341.
-
(1990)
J. Algorithms
, vol.11
, pp. 307-341
-
-
Awerbuch, B.1
Bar-Noy, A.2
Linial, N.3
Peleg, D.4
-
3
-
-
0000576524
-
Diameters of weighted double-loop networks
-
Y. Cheng, F.K. Hwang, Diameters of weighted double-loop networks, J. Algorithms 9 (1988) 401-410.
-
(1988)
J. Algorithms
, vol.9
, pp. 401-410
-
-
Cheng, Y.1
Hwang, F.K.2
-
4
-
-
84986958900
-
A combinatorial problem related to distributed loop networks
-
D.Z. Du, D.F. Hsu, Q. Li, J. Xu, A combinatorial problem related to distributed loop networks, Networks 20 (1990) 173-180.
-
(1990)
Networks
, vol.20
, pp. 173-180
-
-
Du, D.Z.1
Hsu, D.F.2
Li, Q.3
Xu, J.4
-
5
-
-
0001709186
-
Fault-tolerant routing in double-loop networks
-
M. Escudero, J. Fiàbrea, P. Morillo, Fault-tolerant routing in double-loop networks, Ars Combin. 25A (1988) 187-198.
-
(1988)
Ars Combin.
, vol.25 A
, pp. 187-198
-
-
Escudero, M.1
Fiàbrea, J.2
Morillo, P.3
-
6
-
-
0023367428
-
A discrete optimization problem in local networks and data alignment
-
M.A. Fiol, J.L.A. Yebra, I. Alegre, M. Valero, A discrete optimization problem in local networks and data alignment, IEEE Trans. Comput. 36 (6) (1987) 702-713.
-
(1987)
IEEE Trans. Comput.
, vol.36
, Issue.6
, pp. 702-713
-
-
Fiol, M.A.1
Yebra, J.L.A.2
Alegre, I.3
Valero, M.4
-
7
-
-
3743052727
-
Designing networks with compact routing tables
-
G.N. Frederickson, R. Janardan, Designing networks with compact routing tables, Algorithmica 3 (1988) 171-190.
-
(1988)
Algorithmica
, vol.3
, pp. 171-190
-
-
Frederickson, G.N.1
Janardan, R.2
-
8
-
-
0024716011
-
Efficient message routing in planar networks
-
G.N. Frederickson, R. Janardan, Efficient message routing in planar networks, SIAM J. Comput. 18 (4) (1989) 843-857.
-
(1989)
SIAM J. Comput.
, vol.18
, Issue.4
, pp. 843-857
-
-
Frederickson, G.N.1
Janardan, R.2
-
9
-
-
0025384425
-
Space-efficient message routing in c-decomposable networks
-
G.N. Frederickson, R. Janardan, Space-efficient message routing in c-decomposable networks, SIAM J. Comput. 19 (1) (1990) 164-181.
-
(1990)
SIAM J. Comput.
, vol.19
, Issue.1
, pp. 164-181
-
-
Frederickson, G.N.1
Janardan, R.2
-
11
-
-
0003657590
-
-
Addison-Wesley, Reading, MA
-
D.E. Knuth, The Art of Computer Programming, vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1981.
-
(1981)
The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd Ed.
, vol.2
-
-
Knuth, D.E.1
-
12
-
-
0021860485
-
Reliable loop topologies for large local computer networks
-
C.S. Raghavendra, M. Gerla, A. Avižienis, Reliable loop topologies for large local computer networks, IEEE Trans. Comput. 34 (1) (1985) 46-55.
-
(1985)
IEEE Trans. Comput.
, vol.34
, Issue.1
, pp. 46-55
-
-
Raghavendra, C.S.1
Gerla, M.2
Avižienis, A.3
-
13
-
-
0023400167
-
Interval routing
-
J. van Leeuwen, B.R. Tan, Interval routing, Comput. J. 30 (4) (1987) 298-307.
-
(1987)
Comput. J.
, vol.30
, Issue.4
, pp. 298-307
-
-
Van Leeuwen, J.1
Tan, B.R.2
|