Sabine R. Öhring

发表

Mapping data and algorithm structures on selected efficient multiprocessor networks

Sabine R. Öhring, 1993 .

Approximation Algorithms for Time Constrained Scheduling

Klaus Jansen, Sabine R. Öhring, 1997, Inf. Comput..

Reliable broadcasting in product networks in the presence of faulty nodes

Sajal K. Das, Sabine R. Öhring, Sajal K. Das, 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology

Sajal K. Das, Sabine R. Öhring, Sajal K. Das, 1993, WG.

Cayley graph connected cycles: A new class of fixed-degree interconnection networks

Sajal K. Das, Sabine R. Öhring, Sajal K. Das, 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

On generalized fat trees

Mohan Kumar, Sajal K. Das, Sabine R. Öhring, 1995, Proceedings of 9th International Parallel Processing Symposium.

Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen Networks

Sajal K. Das, Sabine R. Öhring, Dirk H. Hohndel, 1994, CONPAR.

Folded Petersen Cube Networks: New Competitors for the Hypercubes

Sajal K. Das, Sabine R. Öhring, 1996, IEEE Trans. Parallel Distributed Syst..

Reliable broadcasting in product networks

Yoshihide Igarashi, Sabine R. Öhring, Feng Bao, 1998, Discret. Appl. Math..

Communication aspects of fat-tree-based interconnection networks for multicomputers

Sajal K. Das, Sabine R. Öhring, Maximilian Ibel, 1998, Robust Communication Networks: Interconnection and Survivability.

Approximation Algorithms for Time Constrained Scheduling

Klaus Jansen, Sabine R. Öhring, 1995, IRREGULAR.

Efficient Communication in the Folded Petersen Interconnection Network

Sajal K. Das, Sabine R. Öhring, Sajal K. Das, 1994, PARLE.

Embeddings of Tree-Related Networks in Incomplete Hypercubes

Sajal K. Das, Sabine R. Öhring, 1993, PARLE.

Dynamic Tree Embeddings into de Bruijn Graphs

Sabine R. Öhring, 1992, CONPAR.

Efficient Communication in Folded Petersen Networks

Sabine R. Öhring, Sajal K. Das, Maximilian Ibel, 1997, Int. J. Found. Comput. Sci..

Folded Petersen cube networks: new competitors for the hypercubes

Sajal K. Das, Sabine R. Öhring, 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

Incomplete Hypercubes: embeddings of Tree-Related Networks

Sajal K. Das, Sabine R. Öhring, 1995, J. Parallel Distributed Comput..

The Folded Petersen Network : A New Communication-Efficient Multiprocessor Topology

Sajal K. Das, Sabine R. Öhring, Sajal K. Das, 1993, 1993 International Conference on Parallel Processing - ICPP'93.

Mapping Dynamic Data and Algorithm Structures into Product Networks

Sajal K. Das, Sabine R. Öhring, 1993, ISAAC.

Dynamic embeddings of trees and quasi-grids into hyper-de Bruijn networks

Sajal K. Das, Sabine R. Öhring, 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

Reliability of Hypercubes for Broadcasting with Random Faults

Sabine R. Öhring, Yoshihide Igarashi, Feng Bao, 1996 .

Embeddings Into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection Topology

Sabine R. Öhring, Sajal K. Das, Amit K. Banerjee, 1995 .

Optimal fault-tolerant communication algorithms on product networks using spanning trees

Sabine R. Öhring, Dirk H. Hohndel, D. Hohndel, 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

Asymptotically optimal communication algorithms on faulty folded Petersen networks

Sabine R. Öhring, Sajal K. Das, D. Hohndel, 1994, Proceedings of IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems.

Approximation algorithms for time constrained scheduling

Sabine R. Öhring, K. Jansen, K. Jansen, 1995, Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing.