David W. Jacobs, Daphna Weinshall, et al.
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.
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Imran Nasim, Melanie Weber
SCML 2024
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics