Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
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.
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Jianke Yang, Robin Walters, et al.
ICML 2023
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997