default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSabine R. Öhring
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j6]Feng Bao, Yoshihide Igarashi, Sabine R. Öhring:
Reliable broadcasting in product networks. Discret. Appl. Math. 83(1-3): 3-20 (1998)- [c15]Sajal K. Das, Sabine R. Öhring, Maximilian Ibel:
Communication aspects of fat-tree-based interconnection networks for multicomputers. Robust Communication Networks: Interconnection and Survivability 1998: 35-60 - 1997
- [j5]Klaus Jansen, Sabine R. Öhring:
Approximation Algorithms for Time Constrained Scheduling. Inf. Comput. 132(2): 85-108 (1997) - [j4]Sajal K. Das, Dirk H. Hohndel, Maximilian Ibel, Sabine R. Öhring:
Efficient Communication in Folded Petersen Networks. Int. J. Found. Comput. Sci. 8(2): 163-185 (1997) - 1996
- [j3]Sabine R. Öhring, Sajal K. Das
:
Folded Petersen Cube Networks: New Competitors for the Hypercubes. IEEE Trans. Parallel Distributed Syst. 7(2): 151-168 (1996) - 1995
- [j2]Sabine R. Öhring, Sajal K. Das:
Incomplete Hypercubes: embeddings of Tree-Related Networks. J. Parallel Distributed Comput. 26(1): 36-47 (1995) - [j1]Sajal K. Das, Sabine R. Öhring, Amit K. Banerjee:
Embeddings into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection Topology. VLSI Design 2(4): 335-351 (1995) - [c14]Sabine R. Öhring, Falguni Sarkar, Sajal K. Das, Dirk H. Hohndel:
Cayley graph connected cycles: A new class of fixed-degree interconnection networks. HICSS (2) 1995: 479-488 - [c13]Sabine R. Öhring, Maximilian Ibel, Sajal K. Das, Mohan Kumar:
On generalized fat trees. IPPS 1995: 37-44 - [c12]Klaus Jansen, Sabine R. Öhring:
Approximation Algorithms for Time Constrained Scheduling. IRREGULAR 1995: 143-157 - [c11]Sabine R. Öhring, Maximilian Ibel, Sajal K. Das:
Reliable broadcasting in product networks in the presence of faulty nodes. SPDP 1995: 711-718 - 1994
- [c10]Sabine R. Öhring, Sajal K. Das, Dirk H. Hohndel:
Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen Networks. CONPAR 1994: 749-760 - [c9]Sabine R. Öhring, Sajal K. Das:
Efficient Communication in the Folded Petersen Interconnection Network. PARLE 1994: 25-36 - [c8]Sabine R. Öhring, Dirk H. Hohndel:
Optimal fault-tolerant communication algorithms on product networks using spanning trees. SPDP 1994: 188-195 - 1993
- [b1]Sabine R. Öhring:
Mapping data and algorithm structures on selected efficient multiprocessor networks. Julius Maximilians University Würzburg, Germany, 1993, pp. 1-214 - [c7]Sabine R. Öhring, Sajal K. Das:
The Folded Petersen Network: A New Communication-Efficient Multiprocessor Topology. ICPP (1) 1993: 311-314 - [c6]Sabine R. Öhring, Sajal K. Das:
Dynamic Embeddings of Trees and Quasi-Grids into Hyper-de Bruijn Networks. IPPS 1993: 519-523 - [c5]Sabine R. Öhring, Sajal K. Das:
Mapping Dynamic Data and Algorithm Structures into Product Networks. ISAAC 1993: 147-156 - [c4]Sabine R. Öhring, Sajal K. Das:
Embeddings of Tree-Related Networks in Incomplete Hypercubes. PARLE 1993: 80-91 - [c3]Sabine R. Öhring, Sajal K. Das:
Folded Peterson Cube Networks: New Competitors for the Hyper Cube. SPDP 1993: 582-590 - [c2]Sabine R. Öhring, Sajal K. Das:
The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology. WG 1993: 301-314 - 1992
- [c1]Sabine R. Öhring:
Dynamic Tree Embeddings into de Bruijn Graphs. CONPAR 1992: 783-784
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
