David A. Carlson

Publication Activity (10 Years)

Years Active: 1980-2000
Publications (10 Years): 0

Publications

David A. Carlson
Designing XML vocabularies with UML (poster session). OOPSLA Addendum (2000)
David A. Carlson, Ruben W. Castelino, Robert O. Mueller
Multimedia extensions for a 550-MHz RISC microprocessor. IEEE J. Solid State Circuits 32 (11) (1997)
Paul E. Gronowski, William J. Bowhill, Dale R. Donchin, Randel P. Blake-Campos, David A. Carlson, Edward R. Equi, Bruce J. Loughlin, Shekhar Mehta, Robert O. Mueller, Andy Olesin, Date J. W. Noorlag, Ronald P. Preston
A 433-MHz 64-b quad-issue RISC microprocessor. IEEE J. Solid State Circuits 31 (11) (1996)
David A. Carlson, Craig K. Frock, Thomas A. Pauls, Daniel V. Pryor
Cross Ambiguity Functions on the MasPar MP-2. PPSC (1995)
Mary Lynn Manns, David A. Carlson
Retraining procedural programmers: a case against "unlearning". OOPS Messenger 4 (2) (1993)
Sudha Ram, Stephen C. Hayne, David A. Carlson
Integrating information systems technologies to support consultation in an information center. Inf. Manag. 23 (6) (1992)
David A. Carlson
Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers. J. Supercomput. 6 (2) (1992)
David A. Carlson
Using local memory to boost the performance of FFT algorithms on the CRAY-2 supercomputer. J. Supercomput. 4 (4) (1991)
David A. Carlson, Sudha Ram
An Architecture for Distributed Knowledge-Based Systems. Data Base 22 (1&2) (1991)
Tack-Don Han, David A. Carlson
The Design and Analysis of the Parallel Prefix Computation Algorithm. ICPP (3) (1990)
David A. Carlson, Sudha Ram
HyperIntelligence: The Next Frontier. Commun. ACM 33 (3) (1990)
David A. Carlson, Binay Sugla
Limited width parallel prefix circuits. J. Supercomput. 4 (2) (1990)
Binay Sugla, David A. Carlson
Extreme Area-Time Tradeoffs in VLSI. IEEE Trans. Computers 39 (2) (1990)
David A. Carlson
Solving Linear Recurrence Systems on Mesh-Connected Computers with Multiple Global Buses. J. Parallel Distributed Comput. 8 (1) (1990)
David A. Carlson, Binay Sugla
Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays. Parallel Comput. 11 (1) (1989)
Sudha Ram, Stephen C. Hayne, David A. Carlson, Jay F. Nunamaker Jr.
Integration of information systems technologies to support consultation in an information center. ICIS (1989)
David A. Carlson
Modified Mesh-Connected Parallel Computers. IEEE Trans. Computers 37 (10) (1988)
David A. Carlson
Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms. SIAM J. Discret. Math. 1 (1) (1988)
Duncan A. Buell, David A. Carlson, Yuan-Chieh Chow, Karel Culík, Narsingh Deo, Raphael A. Finkel, Elias N. Houstis, Elaine M. Jacob Son, Zvi M. Kedem, Janusz S. Kowalik, Philip Kuekes, Joanne L. Martin, George A. Michael, Neil S. Ostlund, Jerry Potter, D. K. Pradhan, Michael J. Quinn, G. W. Stewart, Quentin F. Stout, Layne T. Watson, Jon Webb
Parallel algorithms and architectures report of a workshop. J. Supercomput. 1 (3) (1988)
David A. Carlson, John M. Conroy
The fast fourier transform and sparse matrix computations: a study of two applications on teh HORIZON supercomputer. SC (1988)
David A. Carlson
Time-Space Efficient Algorithms for Computing Convolutions and Related Problems Inf. Comput. 75 (1) (1987)
Tack-Don Han, David A. Carlson
Fast area-efficient VLSI adders. IEEE Symposium on Computer Arithmetic (1987)
David A. Carlson
Time-Space Tradeoffs for Tree Search and Traversal. FJCC (1986)
David A. Carlson
Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel Computers. ICPP (1985)
David A. Carlson
Parallel Processing of Tree-like Computations. ICDCS (1984)
David A. Carlson, John E. Savage
Size-Space Tradeoffs for Oblivious Computations. J. Comput. Syst. Sci. 26 (1) (1983)
David A. Carlson
Time-Space Tradeoffs on Back-to-Back FFT Algorithms. IEEE Trans. Computers 32 (6) (1983)
David A. Carlson, John E. Savage
Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements. Inf. Process. Lett. 14 (5) (1982)
David A. Carlson, John E. Savage
Graph Pebbling with Many Free Pebbles can be Difficult STOC (1980)