David A. Carlson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2000

Designing XML vocabularies with UML (poster session)David A. Carlson. OOPSLA 2000: 95-96 [doi]

1997

Multimedia extensions for a 550-MHz RISC microprocessorDavid A. Carlson, Ruben W. Castelino, Robert O. Mueller. jssc, 32(11):1618-1624, 1997. [doi]

1996

A 433-MHz 64-b quad-issue RISC microprocessorPaul 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. jssc, 31(11):1687-1696, 1996. [doi]

1995

Cross Ambiguity Functions on the MasPar MP-2David A. Carlson, Craig K. Frock, Thomas A. Pauls, Daniel V. Pryor. ppsc 1995: 15-20

1993

Retraining procedural programmers: a case against unlearning Mary Lynn Manns, David A. Carlson. oopsm, 4(2):131-133, 1993.

1992

Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputersDavid A. Carlson. tjs, 6(2):107-116, 1992. [doi]

Integrating information systems technologies to support consultation in an information centerSudha Ram, Stephen Hayne, David A. Carlson. iam, 23(6):331-343, 1992. [doi]

1991

Using local memory to boost the performance of FFT algorithms on the CRAY-2 supercomputerDavid A. Carlson. tjs, 4(4):345-356, 1991. [doi]

An Architecture for Distributed Knowledge-Based SystemsDavid A. Carlson, Sudha Ram. DB, 22(1&2):11-21, 1991. [doi]

1990

Solving Linear Recurrence Systems on Mesh-Connected Computers with Multiple Global BusesDavid A. Carlson. jpdc, 8(1):89-95, 1990.

Limited width parallel prefix circuitsDavid A. Carlson, Binay Sugla. tjs, 4(2):107-129, 1990. [doi]

HyperIntelligence: The Next FrontierDavid A. Carlson, Sudha Ram. CACM, 33(3):311-321, 1990.

The Design and Analysis of the Parallel Prefix Computation AlgorithmTack-Don Han, David A. Carlson. icpp 1990: 350-351

Extreme Area-Time Tradeoffs in VLSIBinay Sugla, David A. Carlson. TC, 39(2):251-257, 1990.

1989

Adapting shuffle-exchange like parallel processing organizations to work as systolic arraysDavid A. Carlson, Binay Sugla. pc, 11(1):93-106, 1989.

Integration of information systems technologies to support consultation in an information centerSudha Ram, Stephen Hayne, David A. Carlson, Jay F. Nunamaker. icisc 1989: 67-77 [doi]

1988

1987

Time-Space Efficient Algorithms for Computing Convolutions and Related ProblemsDavid A. Carlson. iandc, 75(1):1-14, October 1987.

Fast area-efficient VLSI addersTack-Don Han, David A. Carlson. arith 1987: 49-56 [doi]

1986

Time-Space Tradeoffs for Tree Search and TraversalDavid A. Carlson. fjcc 1986: 585-594

1985

Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel ComputersDavid A. Carlson. icpp 1985: 715-718

1984

Parallel Processing of Tree-like ComputationsDavid A. Carlson. icdcs 1984: 192-200

1983

Size-Space Tradeoffs for Oblivious ComputationsDavid A. Carlson, John E. Savage. jcss, 26(1):65-81, 1983.

Time-Space Tradeoffs on Back-to-Back FFT AlgorithmsDavid A. Carlson. TC, 32(6):585-589, 1983.

1982

Extreme Time-Space Tradeoffs for Graphs with Small Space RequirementsDavid A. Carlson, John E. Savage. ipl, 14(5):223-227, 1982.

1981

Time-Space and Size-Space Tradeoffs for Oblivious ComputationsDavid A. Carlson. PhD thesis, Brown University, USA, 1981. [doi]

1980

Graph Pebbling with Many Free Pebbles can be DifficultDavid A. Carlson, John E. Savage. stoc 1980: 326-332

Sign in or sign up to see more results.

runs on WebDSL