Simeon Furrer, Dirk Dahlhaus
ISIT 2005
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.
Simeon Furrer, Dirk Dahlhaus
ISIT 2005
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Minghong Fang, Zifan Zhang, et al.
CCS 2024