Dynamic tree embeddings into de Bruijn graphs

  • Sabine Öhring
Part of the Lecture Notes in Computer Science book series (LNCS, volume 634)


  1. [BP89]
    J.C. Bermond and C. Peyrat. de Bruijn and Kautz Networks: a competitor for the hypercube? In Hypercubes and Distributed Computers, North-Holland, 1989. Elsevier Science Publishers.Google Scholar
  2. [LNRS89]
    F.T. Leighton, M. Newmann, A.G. Ranade, and E. Schwabe. Dynamic Tree Embeddings in Butterflies and Hypercubes. In Proceedings of the 1989 A CM Symposium on Parallel Algorithms and Architectures, Santa Fe, NM, June 1989.Google Scholar
  3. [MS90]
    B. Monien and H. Sudborough. Embedding one Interconnection Network in Another. In Computational Graph Theory, Wien, 1990. Springer Verlag.Google Scholar
  4. [Ö91]
    S. Öhring. The de Bruijn Network: An Efficient Host for Static Embeddings of Various Program Structures. Technical report, TR 1028-91, Universität Würzburg, Lehrstuhl Informatik 1, 1991.Google Scholar
  5. [Ö92]
    S. Öhring. Dynamic Embeddings of Arbitrary Trees in de Bruijn Graphs. Technical report, TR 0307-92, Universität Würzburg, Lehrstuhl Informatik 1, 1992.Google Scholar
  6. [SP89]
    M.R. Samatham and D.K. Pradhan. The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI. In IEEE Transactions on Computers, Vol. 38, No. 4, April 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Sabine Öhring
    • 1
  1. 1.Lehrstuhl Informatik I, Universität WürzburgWürzburgGermany

Personalised recommendations