Sabine R. Öhring - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

1998

Reliable broadcasting in product networksFeng Bao, Yoshihide Igarashi, Sabine R. Öhring. DAM, 83(1-3):3-20, 1998. [doi]

Communication aspects of fat-tree-based interconnection networks for multicomputersSajal K. Das, Sabine R. Öhring, Maximilian Ibel. dimacs 2000: 35-60

1997

Efficient Communication in Folded Petersen NetworksSajal K. Das, Dirk H. Hohndel, Maximilian Ibel, Sabine R. Öhring. ijfcs, 8(2):163-185, 1997.

Approximation Algorithms for Time Constrained SchedulingKlaus Jansen, Sabine R. Öhring. iandc, 132(2):85-108, 1997.

1996

Folded Petersen Cube Networks: New Competitors for the HypercubesSabine R. Öhring, Sajal K. Das. tpds, 7(2):151-168, 1996. [doi]

1995

Embeddings into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection TopologySajal K. Das 0001, Sabine R. Öhring, Amit K. Banerjee. vlsi, 2(4):335-351, 1995. [doi]

Approximation Algorithms for Time Constrained SchedulingKlaus Jansen, Sabine R. Öhring. irregular 1995: 143-157

Cayley graph connected cycles: A new class of fixed-degree interconnection networksSabine R. Öhring, Falguni Sarkar, Sajal K. Das, Dirk H. Hohndel. hicss 1995: 479-488 [doi]

Reliable broadcasting in product networks in the presence of faulty nodesSabine R. Öhring, Maximilian Ibel, Sajal K. Das. spdp 1995: 711-718 [doi]

On generalized fat treesSabine R. Öhring, Maximilian Ibel, Sajal K. Das, Mohan Kumar. ipps 1995: 37 [doi]

Incomplete Hypercubes: embeddings of Tree-Related NetworksSabine R. Öhring, Sajal K. Das. jpdc, 26(1):36-47, 1995.

1994

Optimal fault-tolerant communication algorithms on product networks using spanning treesSabine R. Öhring, Dirk H. Hohndel. spdp 1994: 188-195 [doi]

Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen NetworksSabine R. Öhring, Sajal K. Das, Dirk H. Hohndel. conpar 1994: 749-760

Efficient Communication in the Folded Petersen Interconnection NetworkSabine R. Öhring, Sajal K. Das. parle 1994: 25-36

1993

Mapping data and algorithm structures on selected efficient multiprocessor networksSabine R. Öhring. PhD thesis, Julius Maximilians University Würzburg, Germany, 1993. [doi]

Dynamic Embeddings of Trees and Quasi-Grids into Hyper-de Bruijn NetworksSabine R. Öhring, Sajal K. Das. ipps 1993: 519-523

The Folded Petersen Network: A New Communication-Efficient Multiprocessor TopologySabine R. Öhring, Sajal K. Das. icpp 1993: 311-314

Folded Peterson Cube Networks: New Competitors for the Hyper CubeSabine R. Öhring, Sajal K. Das. spdp 1993: 582-590

The Folded Petersen Network: A New Versatile Multiprocessor Interconnection TopologySabine R. Öhring, Sajal K. Das. criwg 1994: 301-314

Embeddings of Tree-Related Networks in Incomplete HypercubesSabine R. Öhring, Sajal K. Das. parle 1993: 80-91

Mapping Dynamic Data and Algorithm Structures into Product NetworksSabine R. Öhring, Sajal K. Das. isaac 1993: 147-156

1992

Dynamic Tree Embeddings into de Bruijn GraphsSabine R. Öhring. conpar 1992: 783-784

Sign in or sign up to see more results.

runs on WebDSL