Free Access
RAIRO-Theor. Inf. Appl.
Volume 28, Number 3-4, 1994
Special issue for Professor Karel Culik II : 60 th birthday
Page(s) 303 - 342
Published online 03 February 2017
  1. [BHMS90] A. BAGCHI, S. L. HAKIMI, J. MITCHEM and E. SCHMEICHEL, Parallel algorithms for gossiping by mail, Information, Process. Letters, 1990, 34, pp. 197-202. [MR: 1060435] [Zbl: 0696.68048] [Google Scholar]
  2. [CC84] C. CHOFFRUT and K. CULIK II, On real-time cellular automata and trellis automata, Acta Informatica, 1984, 21, pp. 393-407. [MR: 767316] [Zbl: 0534.68039] [Google Scholar]
  3. [CGS83] K. CULIK II, J. GRUSKA and A. SALOMAA, Systolic automata for VLSI on balanced trees, Acta Informatica, 1983, 18, pp. 335-344. [MR: 691733] [Zbl: 0493.68054] [Google Scholar]
  4. [CGS84] K. CULIK II, J. GRUSKA and A. SALOMAA, Systolic trellis automata. Part I, Intern. J. Comput. Math., 1984, 15, pp. 195-212. [MR: 754266] [Zbl: 0571.68041] [Google Scholar]
  5. [CSW84] K. CULIK II, A. SALOMAA and D. WOOD, Systolic tree acceptors, R.A.I.R.O. Theoretical Informatics, 1984, 18, pp. 53-69. [EuDML: 92200] [MR: 750451] [Zbl: 0571.68043] [Google Scholar]
  6. [FHMMM92] R. FELDMANN, J. HROMKOVIČ, S. MADHAVAPEDDY, B. MONIEN and P. MYSLIWIETZ, Optimal algorithms for dissemination of information in generalized communication modes, Proc. PARLE'92, Springer-Verlag, Lecture Notes in Computer Science, 1992, 605, pp. 115-130. [Zbl: 0823.68041] [MR: 1230238] [Google Scholar]
  7. [HHL88] S. M. HEDETNIEMI, S. T. HEDETNIEMI and A. L. LIESTMANN, A survey of gossiping and broadcasting in communication networks, Networks, 1988, 18, pp. 319-349. [MR: 964236] [Zbl: 0649.90047] [Google Scholar]
  8. [HJM93] J. HROMKOVIČ, C.-D. JESCHKE and B. MONIEN, Note an optimal gossiping in some weak-connected graphs, Theoretical Computer Science (to appear). [MR: 1275825] [Zbl: 0824.68010] [Google Scholar]
  9. [HKMP93] J. HROMKOVIČ, R. KLASING, B. MONIEN and R. PEINE, Dissemination of information in interconnection networks (broadcasting & gossiping), In Combinatorial Network Theory (Frank Hsu, Ding-Zhu Du, Eds), Science Press, AMS 1993 (to appear). [MR: 1382871] [Zbl: 0840.68088] [Google Scholar]
  10. [IK84] O. H. IBARRA and S. M. KIM, Characterizations and computational complexity of systolic trellis automata, Theoretical Computer Science, 1984, 29, pp. 123-153. [MR: 742405] [Zbl: 0536.68048] [Google Scholar]
  11. [IKM85] O. H. IBARRA, S. M. KIM and S. MORAN, Sequential machine characterizations of trellis and cellular automata and applications, SIAM J. Comput., 1985, 14, pp. 426-447. [MR: 784748] [Zbl: 0574.68044] [Google Scholar]
  12. [IPK85] O. H. IBARRA, M. A. PALIS and S. M. KIM, Fast parallel language recognition by cellular automata, Theoretical Computer Science, 1985, 41, pp. 231-246. [MR: 847679] [Zbl: 0591.68054] [Google Scholar]
  13. [Ku79] H. T. KUNG, Let's design algorithms for VLSI systems, In Proc. of the Caltech Conference of VLSI (CL. L. Seifz Ed.), Pasadena, California, 1979, pp. 65-90. [Google Scholar]
  14. [LHL93] R. LABAHN, S. T. HEDETNIEMI and R. LASKAR, Periodic gossiping on trees, in Discrete Applied Mathematics (to appear). [MR: 1291010] [Zbl: 0836.68085] [Google Scholar]
  15. [LR93a] A. L. LIESTMAN and D. RICHARDS, Perpetual gossiping, Technical Report, Simon Fraser University, Vancouver, Canada, 1993. [MR: 1279556] [Google Scholar]
  16. [LR93b] A. L. LIESTMAN and D. RICHARDS, Network communication in edge-colored graphs: Gossiping, IEEE Trans. Par. Distr. Syst., 1993, 4, pp. 438-445. [Google Scholar]
  17. [MS90] B. MONIEN and I. H. SUDBOROUGH, Embedding one interconnection network in another, Computing Suppl., 1990, 7, pp. 257-282. [MR: 1059934] [Zbl: 0699.68017] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.