| 1995 |
| 20 | | David A. Carlson,
Craig K. Frock,
Thomas A. Pauls,
Daniel V. Pryor:
Cross Ambiguity Functions on the MasPar MP-2.
PPSC 1995: 15-20 |
| 1993 |
| 19 | | Mary Lynn Manns,
David A. Carlson:
Retraining procedural programmers: a case against "unlearning".
OOPS Messenger 4(2): 131-133 (1993) |
| 1991 |
| 18 | EE | David A. Carlson,
Sudha Ram:
An Architecture for Distributed Knowledge-Based Systems.
DATA BASE 22(1&2): 11-21 (1991) |
| 1990 |
| 17 | | Tack-Don Han,
David A. Carlson:
The Design and Analysis of the Parallel Prefix Computation Algorithm.
ICPP (3) 1990: 350-351 |
| 16 | | David A. Carlson,
Sudha Ram:
HyperIntelligence: The Next Frontier.
Commun. ACM 33(3): 311-321 (1990) |
| 15 | | Binay Sugla,
David A. Carlson:
Extreme Area-Time Tradeoffs in VLSI.
IEEE Trans. Computers 39(2): 251-257 (1990) |
| 14 | | David A. Carlson:
Solving Linear Recurrence Systems on Mesh-Connected Computers with Multiple Global Buses.
J. Parallel Distrib. Comput. 8(1): 89-95 (1990) |
| 1989 |
| 13 | EE | Sudha Ram,
Stephen Hayne,
David A. Carlson,
Jay F. Nunamaker:
Integration of information systems technologies to support consultation in an information center.
ICIS 1989: 67-77 |
| 12 | | David A. Carlson,
Binay Sugla:
Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays.
Parallel Computing 11(1): 93-106 (1989) |
| 1988 |
| 11 | EE | 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: 55-58 |
| 10 | | David A. Carlson:
Modified Mesh-Connected Parallel Computers.
IEEE Trans. Computers 37(10): 1315-1321 (1988) |
| 9 | | David A. Carlson:
Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded fas Fourier Transforms.
SIAM J. Discrete Math. 1(1): 22-37 (1988) |
| 1987 |
| 8 | | David A. Carlson:
Time-Space Efficient Algorithms for Computing Convolutions and Related Problems
Inf. Comput. 75(1): 1-14 (1987) |
| 1986 |
| 7 | | David A. Carlson:
Time-Space Tradeoffs for Tree Search and Traversal.
FJCC 1986: 585-594 |
| 1985 |
| 6 | | David A. Carlson:
Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel Computers.
ICPP 1985: 715-718 |
| 1984 |
| 5 | | David A. Carlson:
Parallel Processing of Tree-like Computations.
ICDCS 1984: 192-200 |
| 1983 |
| 4 | | David A. Carlson:
Time-Space Tradeoffs on Back-to-Back FFT Algorithms.
IEEE Trans. Computers 32(6): 585-589 (1983) |
| 3 | | David A. Carlson,
John E. Savage:
Size-Space Tradeoffs for Oblivious Computations.
J. Comput. Syst. Sci. 26(1): 65-81 (1983) |
| 1982 |
| 2 | | David A. Carlson,
John E. Savage:
Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements.
Inf. Process. Lett. 14(5): 223-227 (1982) |
| 1980 |
| 1 | | David A. Carlson,
John E. Savage:
Graph Pebbling with Many Free Pebbles can be Difficult
STOC 1980: 326-332 |