| Publication | Date of Publication | Type |
|---|
A note on \(N\)-body computations with cutoffs
Theory of Computing Systems | 2004-09-22 | Paper |
Demonstrating the scalability of a molecular dynamics application on a petaflops computer
International Journal of Parallel Programming | 2003-05-06 | Paper |
Calling names on nameless networks
Information and Computation | 1996-02-26 | Paper |
The IBM external user interface for scalable parallel systems
Parallel Computing | 1995-01-29 | Paper |
Random walks on weighted graphs and applications to on-line algorithms
Journal of the ACM | 1993-12-09 | Paper |
Cost-performance tradeoffs for interconnection networks
Discrete Applied Mathematics | 1993-01-16 | Paper |
Better computing on the anonymous ring
Journal of Algorithms | 1991-01-01 | Paper |
Size-depth trade-offs for monotone arithmetic circuits
Theoretical Computer Science | 1991-01-01 | Paper |
A complexity theory of efficient parallel algorithms
Theoretical Computer Science | 1990-01-01 | Paper |
Communication complexity of PRAMs
Theoretical Computer Science | 1990-01-01 | Paper |
Efficient parallel algorithms for graph problems
Algorithmica | 1990-01-01 | Paper |
Techniques for parallel manipulation of sparse matrices
Theoretical Computer Science | 1989-01-01 | Paper |
Computing on an anonymous ring
Journal of the ACM | 1988-01-01 | Paper |
Efficient synchronization of multiprocessors with shared memory
ACM Transactions on Programming Languages and Systems | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4074482 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4066229 (Why is no real title available?) | 1988-01-01 | Paper |
The distribution of waiting times in clocked multistage interconnection networks
IEEE Transactions on Computers | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3976322 (Why is no real title available?) | 1987-01-01 | Paper |
A unified theory of interconnection network structure
Theoretical Computer Science | 1986-01-01 | Paper |
Depth-size trade-offs for parallel prefix computation
Journal of Algorithms | 1986-01-01 | Paper |
Exact balancing is not always good
Information Processing Letters | 1986-01-01 | Paper |
On Parallel Searching
SIAM Journal on Computing | 1985-01-01 | Paper |
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM | 1985-01-01 | Paper |
Lower bounds on probabilistic linear decision trees
Theoretical Computer Science | 1985-01-01 | Paper |
Circuit partitioning with size and connection constraints
Networks | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3817041 (Why is no real title available?) | 1983-01-01 | Paper |
Some Exact Complexity Results for Straight-Line Computations over Semirings
Journal of the ACM | 1982-01-01 | Paper |
Probabilities over rich languages, testing and randomness
Journal of Symbolic Logic | 1982-01-01 | Paper |
Comparisons between linear functions can help
Theoretical Computer Science | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3738914 (Why is no real title available?) | 1981-01-01 | Paper |
On the complexity of simplifying quadratic forms
Information Processing Letters | 1981-01-01 | Paper |
On the depth complexity of formulas
Mathematical Systems Theory | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3692645 (Why is no real title available?) | 1980-01-01 | Paper |
The covering problem of complete uniform hypergraphs
Discrete Mathematics | 1979-01-01 | Paper |
A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors
IEEE Transactions on Computers | 1977-01-01 | Paper |
