David A. Carlson
According to our database1, David A. Carlson authored at least 27 papers between 1980 and 2000.
Legend:Book In proceedings Article PhD thesis Other
Designing XML vocabularies with UML (poster session).
Proceedings of the Object Oriented Programming Systems Languages and Applications Conference, 2000
Cross Ambiguity Functions on the MasPar MP-2.
Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995
Retraining procedural programmers: a case against "unlearning".
OOPS Messenger, 1993
Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers.
The Journal of Supercomputing, 1992
Integrating information systems technologies to support consultation in an information center.
Information & Management, 1992
Using local memory to boost the performance of FFT algorithms on the CRAY-2 supercomputer.
The Journal of Supercomputing, 1991
An Architecture for Distributed Knowledge-Based Systems.
DATA BASE, 1991
Limited width parallel prefix circuits.
The Journal of Supercomputing, 1990
Extreme Area-Time Tradeoffs in VLSI.
IEEE Trans. Computers, 1990
Solving Linear Recurrence Systems on Mesh-Connected Computers with Multiple Global Buses.
J. Parallel Distrib. Comput., 1990
HyperIntelligence: The Next Frontier.
Commun. ACM, 1990
The Design and Analysis of the Parallel Prefix Computation Algorithm.
Proceedings of the 1990 International Conference on Parallel Processing, 1990
Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays.
Parallel Computing, 1989
Integration of information systems technologies to support consultation in an information center.
Proceedings of the 10th International Conference on Information Systems, 1989
Parallel algorithms and architectures report of a workshop.
The Journal of Supercomputing, 1988
Modified Mesh-Connected Parallel Computers.
IEEE Trans. Computers, 1988
Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms.
SIAM J. Discrete Math., 1988
The fast fourier transform and sparse matrix computations: a study of two applications on teh HORIZON supercomputer.
Proceedings of the Proceedings Supercomputing '88, Orlando, FL, USA, November 12-17, 1988, 1988
Time-Space Efficient Algorithms for Computing Convolutions and Related Problems
Inf. Comput., October, 1987
Fast area-efficient VLSI adders.
Proceedings of the 8th IEEE Symposium on Computer Arithmetic, 1987
Time-Space Tradeoffs for Tree Search and Traversal.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986
Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel Computers.
Proceedings of the International Conference on Parallel Processing, 1985
Parallel Processing of Tree-like Computations.
Proceedings of the 4th International Conference on Distributed Computing Systems, 1984
Time-Space Tradeoffs on Back-to-Back FFT Algorithms.
IEEE Trans. Computers, 1983
Size-Space Tradeoffs for Oblivious Computations.
J. Comput. Syst. Sci., 1983
Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements.
Inf. Process. Lett., 1982
Graph Pebbling with Many Free Pebbles can be Difficult
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980