The connection machine
Computer science: a modern introduction (2nd ed.)
Computer science: a modern introduction (2nd ed.)
Non sequential computation and Laws of nature
Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
Tape versus queue and stacks: the lower bounds
Information and Computation
Locality, communication, and interconnect length in multicomputers
SIAM Journal on Computing
Three-Dimensional VLSI: a case study
Journal of the ACM (JACM)
Parallel Sorting Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Your Favorite Parallel Algorithms Might Not Be as Fast as You Think
IEEE Transactions on Computers
A model of computation for VLSI with related complexity results
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A complexity theory for VLSI
Computation: finite and infinite machines
Computation: finite and infinite machines
Cellular Automata
Machine models and linear time complexity
ACM SIGACT News
Are multiport memories physically feasible?
ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
Are multiport memories physically feasible?
ACM SIGARCH Computer Architecture News
Many-to-one packet routing on grids
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Optimal Layouts of Midimew Networks
IEEE Transactions on Parallel and Distributed Systems
An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem
The Journal of Supercomputing
A Parallel Cellular Tool for Interactive Modeling and Simulation
IEEE Computational Science & Engineering
A Parallel Simulation of Cellular Automata by Spatial Machines
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Relative Cost Random Access Machines
Fundamenta Informaticae
| Hi-index | 48.22 |