Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
It is shown that every n-superconcentrator of depth 2 has size μ(n log n); that there exist n-superconcentrators of depth 2 and size O(n(log n)2); and that there exist n-superconcentrators on which the pebble game can be played in space S and time O( (n log n)2 S), for a wide range of values of S. © 1982.
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
M. Tismenetsky
International Journal of Computer Mathematics
Imran Nasim, Michael E. Henderson
Mathematics
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998