The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase multinode broadcasting (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1994 (1) 1995 (2) 1996 (1)
Publication types (Num. hits)
inproceedings(4)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 22 occurrences of 21 keywords

Results
Found 4 publication records. Showing 4 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Paraskevi Fragopoulou, Selim G. Akl Fault tolerant communication algorithms on the star network using disjoint paths. Search on Bibsonomy HICSS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF fault-tolerant communication algorithms, node pairs, directed edge-disjoint spanning trees, single-node broadcasting, multinode broadcasting, single-node scattering problem, all-port communication assumption, faulty edges, multinode scattering problem, interconnection networks, fault tolerant computing, broadcasting, graph, multiprocessor interconnection networks, trees (mathematics), disjoint paths, star network, message transmission, faulty nodes
2Paraskevi Fragopoulou, Selim G. Akl Efficient algorithms for global data communication on the multidimensional torus network. (PDF / PS) Search on Bibsonomy IPPS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF global data communication, multidimensional torus network, parallel multiprocessors, spanning graph, multinode broadcasting, all-port communication model, performance evaluation, performance, algorithms, parallel algorithms, multiprocessing systems, optimal algorithms, interprocessor communication, scattering, store-and-forward
1Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos Leaf Communications in Complete Trees. Search on Bibsonomy Euro-Par, Vol. I The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
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
Displaying result #1 - #4 of 4 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.