Efficient routing schemes for multiple broadcasts in hypercubes

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3182

Full metadata record

DC Field	Value	Language
dc.contributor	Stamoulis, George D.	-
dc.contributor	Tsitsiklis, John N.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:34:39Z	-
dc.date	2003-04-29T15:34:39Z	-
dc.date	1990	-
dc.date.accessioned	2013-06-04T16:16:19Z	-
dc.date.available	2013-06-04T16:16:19Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3182	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	George D. Stamoulis and John N. Tsitsiklis.	-
dc.description	"February 1990/Revised June 1990."--Cover. Cover title.	-
dc.description	Includes bibliographical references (p. 36-37).	-
dc.description	Research supported by the NSF. ECS-8552419 Research supported by Bellcore, Inc. and Du Pont. Research supported by the ARO. DAAL03-86-K-0171 Research supported by a fellowship from the Vinton Hayes Fund.	-
dc.format	50 p.	-
dc.format	3713372 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems	-
dc.relation	LIDS-P ; 1948	-
dc.title	Efficient routing schemes for multiple broadcasts in hypercubes	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI