Search results for "cube-connected-cycles"

Found 112 publication records. Showing 112 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Toshinori Yamada, Shuichi Ueno	Sparse Networks Tolerating Random Faults.	ISPAN	1999	DBLP DOI BibTeX RDF	Hypercubic Graphs, Random-Fault-Tolerant Graphs, Interconnection Networks, Circulant Graphs, Multi-processor Systems
15	Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic	Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.	DISC	1998	DBLP DOI BibTeX RDF
15	Farhad Shahrokhi, László A. Székely	Integral Uniform Flows in Symmetric Networks.	WG	1998	DBLP DOI BibTeX RDF
15	Stefan Dobrev, Peter Ruzicka	Yet Another Modular Technique for Efficient Leader Election.	SOFSEM	1998	DBLP DOI BibTeX RDF
15	Juraj Hromkovic, Ralf Klasing, Elena Stöhr	Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks.	WG	1993	DBLP DOI BibTeX RDF
15	Ernst W. Mayr, Ralph Werchner	Divide-and-Conquer Algorithms on the Hypercube.	STACS	1993	DBLP DOI BibTeX RDF	Topics Theory of Parallel and Distributed Computation, Algorithms and Data Structures
15	Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz	Optimal Algorithms for Disemination of Information in Generalized Communication Modes.	PARLE	1992	DBLP DOI BibTeX RDF
15	Marc Baumslag	On the Fault-Tolerance of Quasi-Minimal Cayley Networks.	ICCI	1991	DBLP DOI BibTeX RDF
15	Goos Kant, Jan van Leeuwen	The File Distribution Problem for Processor Networks.	SWAT	1990	DBLP DOI BibTeX RDF
15	John H. Reif, Leslie G. Valiant	A logarithmic time sort for linear size networks.	J. ACM	1987	DBLP DOI BibTeX RDF
15	Friedhelm Meyer auf der Heide	Speeding up Random Access Machines by Few Processors.	STACS	1986	DBLP DOI BibTeX RDF
15	S. Lennart Johnsson	Solving Narrow Banded Systems on Ensemble Architectures.	ACM Trans. Math. Softw.	1985	DBLP DOI BibTeX RDF	banded linear systems, multiprocessors

Displaying result #101 - #112 of 112 (100 per page; Change: )
Pages: [<<][1][2]