John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
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.
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.