Search results for "Sabine R. Öhring"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Feng Bao, Yoshihide Igarashi, Sabine R. Öhring	Reliable broadcasting in product networks.	Discrete Applied Mathematics	1998	DBLP DOI BibTeX RDF
1	Sajal K. Das, Dirk H. Hohndel, Maximilian Ibel, Sabine R. Öhring	Efficient Communication in Folded Petersen Networks.	Int. J. Found. Comput. Sci.	1997	DBLP BibTeX RDF
1	Klaus Jansen, Sabine R. Öhring	Approximation Algorithms for Time Constrained Scheduling.	Inf. Comput.	1997	DBLP DOI BibTeX RDF
1	Sabine R. Öhring, Sajal K. Das	Folded Petersen Cube Networks: New Competitors for the Hypercubes.	IEEE Trans. Parallel Distrib. Syst.	1996	DBLP DOI BibTeX RDF	folded Petersen graph, fault-tolerance, routing, interconnection network, broadcasting, hypercube, embedding, tree, mesh, pyramid, Average distance
1	Sabine R. Öhring, Sajal K. Das	Incomplete Hypercubes: embeddings of Tree-Related Networks.	J. Parallel Distrib. Comput.	1995	DBLP DOI BibTeX RDF
1	Sabine R. Öhring, Maximilian Ibel, Sajal K. Das, Mohan Kumar	On generalized fat trees. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	generalized fat trees, multiprocesser interconnection networks, connection machine architecture, pruned butterflies, fat tree based architecture, inner nodes, leaf processors, recursive scalability, maximal fault-tolerance, logarithmic diameter bisection scalability, fault tolerant self-routing, reliability, parallel architectures, fault tolerant computing, broadcasting, hypercubes, multiprocessor interconnection networks, trees, meshes, communication complexity, symmetry, routers, network routing, switches, rings, pyramids, tori, CM-5
1	Klaus Jansen, Sabine R. Öhring	Approximation Algorithms for Time Constrained Scheduling.	IRREGULAR	1995	DBLP DOI BibTeX RDF
1	Sabine R. Öhring, Falguni Sarkar, Sajal K. Das, Dirk H. Hohndel	Cayley graph connected cycles: A new class of fixed-degree interconnection networks.	HICSS	1995	DBLP DOI BibTeX RDF	Cayley graph connected cycles, fixed-degree interconnection networks, vertex-symmetric networks, maximally fault tolerant networks, abelian generator-sets, graph theory, fault tolerant computing, multiprocessor interconnection networks, routing algorithms, hypercube networks, network routing, broadcasting algorithms, cube-connected cycles, average distance
1	Sabine R. Öhring, Sajal K. Das	Efficient Communication in the Folded Petersen Interconnection Network.	PARLE	1994	DBLP DOI BibTeX RDF
1	Sabine R. Öhring, Sajal K. Das, Dirk H. Hohndel	Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen Networks.	CONPAR	1994	DBLP DOI BibTeX RDF	arc-disjoint spanning trees, folded Petersen graph, fault-tolerance, communication, interconnection network
1	Sabine R. Öhring, Sajal K. Das	The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology.	WG	1993	DBLP DOI BibTeX RDF	Petersen graph, fault-tolerance, routing, interconnection network, broadcasting, hypercube, embedding, tree, mesh
1	Sabine R. Öhring, Sajal K. Das	Embeddings of Tree-Related Networks in Incomplete Hypercubes.	PARLE	1993	DBLP DOI BibTeX RDF	shuffle-trees, Interconnection networks, graph embeddings, pyramids, mesh of trees, incomplete hypercubes
1	Sabine R. Öhring, Sajal K. Das	Dynamic Embeddings of Trees and Quasi-Grids into Hyper-de Bruijn Networks.	IPPS	1993	DBLP BibTeX RDF
1	Sabine R. Öhring, Sajal K. Das	The Folded Petersen Network: A New Communication-Efficient Multiprocessor Topology.	ICPP	1993	DBLP BibTeX RDF
1	Sabine R. Öhring, Sajal K. Das	Folded Peterson Cube Networks: New Competitors for the Hyper Cube.	SPDP	1993	DBLP BibTeX RDF
1	Sabine R. Öhring, Sajal K. Das	Mapping Dynamic Data and Algorithm Structures into Product Networks.	ISAAC	1993	DBLP DOI BibTeX RDF	dynamic embedding, folded Petersen, hyper-de Bruijn, hyper Petersen, product-shuffle, grid, hypercube, tree, de Bruijn
1	Sabine R. Öhring	Dynamic Tree Embeddings into de Bruijn Graphs.	CONPAR	1992	DBLP DOI BibTeX RDF

Publications of "Sabine R. Öhring" ( http://dblp.L3S.de/Authors/Sabine_R._Öhring )