The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase maximal fault-tolerance (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1991-2009 (7)
Publication types (Num. hits)
article(3) inproceedings(4)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 47 occurrences of 28 keywords

Results
Found 7 publication records. Showing 7 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Sabine R. Öhring, Maximilian Ibel, Sajal K. Das, Mohan Kumar On generalized fat trees. (PDF / PS) Search on Bibsonomy IPPS The full citation details ... 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
1Weidong Chen, Wenjun Xiao, Behrooz Parhami Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sabine R. Öhring, Sajal K. Das Folded Petersen Cube Networks: New Competitors for the Hypercubes. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF folded Petersen graph, fault-tolerance, routing, interconnection network, broadcasting, hypercube, embedding, tree, mesh, pyramid, Average distance
1Sabine R. Öhring, Sajal K. Das, Dirk H. Hohndel Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen Networks. Search on Bibsonomy CONPAR The full citation details ... 1994 DBLP  DOI  BibTeX  RDF arc-disjoint spanning trees, folded Petersen graph, fault-tolerance, communication, interconnection network
1Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi Randomized Wait-Free Naming. Search on Bibsonomy ISAAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Sabine R. Öhring, Sajal K. Das The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology. Search on Bibsonomy WG The full citation details ... 1993 DBLP  DOI  BibTeX  RDF Petersen graph, fault-tolerance, routing, interconnection network, broadcasting, hypercube, embedding, tree, mesh
1Arif Ghafoor, Theodore R. Bashkow A Study of Odd Graphs as Fault-Tolerant Interconnection Networks. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1991 DBLP  DOI  BibTeX  RDF odd graphs, fault-tolerant interconnection networks, binary n-cube, flip-trees, self-routing algorithms, maximal fault tolerance, partitioning property, self-diagnostics, parallel architectures, fault tolerant computing, mesh, resilience, persistence, ring, star, chordal ring, Hadamard matrices
Displaying result #1 - #7 of 7 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.