The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sabine R. Öhring: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sabine R. Öhring
    Dynamic Tree Embeddings into de Bruijn Graphs. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1992, pp:783-784 [Conf]
  2. Sabine R. Öhring, Sajal K. Das, Dirk H. Hohndel
    Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen Networks. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1994, pp:749-760 [Conf]
  3. Sabine R. Öhring, Falguni Sarkar, Sajal K. Das, Dirk H. Hohndel
    Cayley graph connected cycles: A new class of fixed-degree interconnection networks. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:479-488 [Conf]
  4. Sabine R. Öhring, Sajal K. Das
    The Folded Petersen Network: A New Communication-Efficient Multiprocessor Topology. [Citation Graph (0, 0)][DBLP]
    ICPP, 1993, pp:311-314 [Conf]
  5. Sabine R. Öhring, Sajal K. Das
    Dynamic Embeddings of Trees and Quasi-Grids into Hyper-de Bruijn Networks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:519-523 [Conf]
  6. Sabine R. Öhring, Maximilian Ibel, Sajal K. Das, Mohan Kumar
    On generalized fat trees. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:37-0 [Conf]
  7. Klaus Jansen, Sabine R. Öhring
    Approximation Algorithms for Time Constrained Scheduling. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1995, pp:143-157 [Conf]
  8. Sabine R. Öhring, Sajal K. Das
    Mapping Dynamic Data and Algorithm Structures into Product Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:147-156 [Conf]
  9. Sabine R. Öhring, Sajal K. Das
    Embeddings of Tree-Related Networks in Incomplete Hypercubes. [Citation Graph (0, 0)][DBLP]
    PARLE, 1993, pp:80-91 [Conf]
  10. Sabine R. Öhring, Sajal K. Das
    Efficient Communication in the Folded Petersen Interconnection Network. [Citation Graph (0, 0)][DBLP]
    PARLE, 1994, pp:25-36 [Conf]
  11. Sabine R. Öhring, Sajal K. Das
    Folded Peterson Cube Networks: New Competitors for the Hyper Cube. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:582-590 [Conf]
  12. Sabine R. Öhring, Sajal K. Das
    The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:301-314 [Conf]
  13. Feng Bao, Yoshihide Igarashi, Sabine R. Öhring
    Reliable broadcasting in product networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:3-20 [Journal]
  14. Klaus Jansen, Sabine R. Öhring
    Approximation Algorithms for Time Constrained Scheduling. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:132, n:2, pp:85-108 [Journal]
  15. Sajal K. Das, Dirk H. Hohndel, Maximilian Ibel, Sabine R. Öhring
    Efficient Communication in Folded Petersen Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:2, pp:163-185 [Journal]
  16. Sabine R. Öhring, Sajal K. Das
    Incomplete Hypercubes: embeddings of Tree-Related Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:1, pp:36-47 [Journal]
  17. Sabine R. Öhring, Sajal K. Das
    Folded Petersen Cube Networks: New Competitors for the Hypercubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:2, pp:151-168 [Journal]

Search in 0.249secs, Finished in 0.250secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002