page 1  (18 pages)
2to next section

EIDGEN?OSSISCHE TECHNISCHE HOCHSCHULE LAUSANNE
POLITECNICO FEDERALE DI LOSANNA
SWISS FEDERAL INSTITUTE OF TECHNOLOGY LAUSANNE
DEPARTMENT OF COMPUTER SCIENCE
COMPUTER SCIENCE THEORY LABORATORY

?COLEPOLYTECHNIQUEF?D?RALEDELAUSANNE

An Efficient Algorithm for Solving the
Token Distribution Problem on k-ary
d-cube Networks?

Claude G. Diderich and Marc Gengler
Swiss Federal Institute of Technology, Lausanne
Computer Science Theory Laboratory
CH-1015 Lausanne
Switzerland
fdiderich,[email protected]

March 1994
Technical report LITH-97

c March 1994, Claude G. Diderich and Marc Gengler. All rights reserved.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the copyright notice and the title of the publication and its date appear. To copy otherwise, or to republish, requires a specific permission.

?Research partly supported by Swiss National Science Foundation grant SPP-IF 5003-034349.