![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
David A. Carlson
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
- [c11]David A. Carlson:
Designing XML vocabularies with UML (poster session). OOPSLA Addendum 2000: 95-96
1990 – 1999
- 1997
- [j18]David A. Carlson, Ruben W. Castelino, Robert O. Mueller:
Multimedia extensions for a 550-MHz RISC microprocessor. IEEE J. Solid State Circuits 32(11): 1618-1624 (1997) - 1996
- [j17]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): 1687-1696 (1996) - 1995
- [c10]David A. Carlson, Craig K. Frock, Thomas A. Pauls, Daniel V. Pryor:
Cross Ambiguity Functions on the MasPar MP-2. PP 1995: 15-20 - 1992
- [j16]Sudha Ram, Stephen C. Hayne
, David A. Carlson:
Integrating information systems technologies to support consultation in an information center. Inf. Manag. 23(6): 331-343 (1992) - [j15]David A. Carlson:
Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers. J. Supercomput. 6(2): 107-116 (1992) - [c9]Mary Lynn Manns, David A. Carlson:
Retraining procedural programmers: a case against "unlearning". OOPSLA Addendum 1992: 131-133 - 1991
- [j14]David A. Carlson, Sudha Ram:
An Architecture for Distributed Knowledge-Based Systems. Data Base 22(1&2): 11-21 (1991) - [j13]David A. Carlson:
Using local memory to boost the performance of FFT algorithms on the CRAY-2 supercomputer. J. Supercomput. 4(4): 345-356 (1991) - 1990
- [j12]David A. Carlson, Sudha Ram:
HyperIntelligence: The Next Frontier. Commun. ACM 33(3): 311-321 (1990) - [j11]David A. Carlson:
Solving Linear Recurrence Systems on Mesh-Connected Computers with Multiple Global Buses. J. Parallel Distributed Comput. 8(1): 89-95 (1990) - [j10]Binay Sugla, David A. Carlson:
Extreme Area-Time Tradeoffs in VLSI. IEEE Trans. Computers 39(2): 251-257 (1990) - [j9]David A. Carlson, Binay Sugla:
Limited width parallel prefix circuits. J. Supercomput. 4(2): 107-129 (1990) - [c8]Tack-Don Han, David A. Carlson:
The Design and Analysis of the Parallel Prefix Computation Algorithm. ICPP (3) 1990: 350-351
1980 – 1989
- 1989
- [j8]David A. Carlson, Binay Sugla:
Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays. Parallel Comput. 11(1): 93-106 (1989) - [c7]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: 67-77 - 1988
- [j7]David A. Carlson:
Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms. SIAM J. Discret. Math. 1(1): 22-37 (1988) - [j6]David A. Carlson:
Modified Mesh-Connected Parallel Computers. IEEE Trans. Computers 37(10): 1315-1321 (1988) - [j5]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): 301-325 (1988) - [c6]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 - 1987
- [j4]David A. Carlson:
Time-Space Efficient Algorithms for Computing Convolutions and Related Problems. Inf. Comput. 75(1): 1-14 (1987) - [c5]Tack-Don Han, David A. Carlson:
Fast area-efficient VLSI adders. IEEE Symposium on Computer Arithmetic 1987: 49-56 - 1986
- [c4]David A. Carlson:
Time-Space Tradeoffs for Tree Search and Traversal. FJCC 1986: 585-594 - 1985
- [c3]David A. Carlson:
Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel Computers. ICPP 1985: 715-718 - 1984
- [c2]David A. Carlson:
Parallel Processing of Tree-like Computations. ICDCS 1984: 192-200 - 1983
- [j3]David A. Carlson, John E. Savage:
Size-Space Tradeoffs for Oblivious Computations. J. Comput. Syst. Sci. 26(1): 65-81 (1983) - [j2]David A. Carlson:
Time-Space Tradeoffs on Back-to-Back FFT Algorithms. IEEE Trans. Computers 32(6): 585-589 (1983) - 1982
- [j1]David A. Carlson, John E. Savage:
Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements. Inf. Process. Lett. 14(5): 223-227 (1982) - 1981
- [b1]David A. Carlson:
Time-Space and Size-Space Tradeoffs for Oblivious Computations. Brown University, USA, 1981 - 1980
- [c1]David A. Carlson, John E. Savage:
Graph Pebbling with Many Free Pebbles can be Difficult. STOC 1980: 326-332
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint