M. Tismenetsky
International Journal of Computer Mathematics
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.
M. Tismenetsky
International Journal of Computer Mathematics
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology