


default search action
Richard E. Matick
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j10]Stanley Schuster, Richard E. Matick:
Fast Low Power eDRAM Hierarchical Differential Sense Amplifier. IEEE J. Solid State Circuits 44(2): 631-641 (2009) - 2008
- [j9]John Barth, William R. Reohr, Paul C. Parries, Gregory Fredeman, John Golz, Stanley Schuster, Richard E. Matick, Hillery C. Hunter, Charles Tanner, Joseph Harig, Hoki Kim, Babar A. Khan, John Griesemer, Robert Havreluk, Kenji Yanagisawa, Toshiaki Kirihata, Subramanian S. Iyer:
A 500 MHz Random Cycle, 1.5 ns Latency, SOI Embedded DRAM Macro Featuring a Three-Transistor Micro Sense Amplifier. IEEE J. Solid State Circuits 43(1): 86-95 (2008) - 2007
- [c1]John Barth, William R. Reohr, Paul C. Parries, Gregory Fredeman, John Golz, Stanley Schuster, Richard E. Matick, Hillery C. Hunter, Charles Tanner, Joseph Harig, Hoki Kim, Babar A. Khan, John Griesemer, Robert Havreluk, Kenji Yanagisawa, Toshiaki Kirihata, Subramanian S. Iyer:
A 500MHz Random Cycle 1.5ns-Latency, SOI Embedded DRAM Macro Featuring a 3T Micro Sense Amplifier. ISSCC 2007: 486-617 - 2005
- [j8]Richard E. Matick, Stanley Schuster:
Logic-based eDRAM: Origins and rationale for use. IBM J. Res. Dev. 49(1): 145-166 (2005) - 2003
- [j7]Richard E. Matick:
Comparison of analytic performance models using closed mean-value analysis versus open-queuing theory for estimating cycles per instruction of memory hierarchies. IBM J. Res. Dev. 47(4): 495-517 (2003) - 2001
- [j6]Richard E. Matick, Thomas J. Heller, Michael Ignatowski:
Analytical analysis of finite cache penalty and cycles per instruction of a multiprocessor memory hierarchy using miss rates and queuing theory. IBM J. Res. Dev. 45(6): 819-842 (2001)
1990 – 1999
- 1998
- [j5]Richard E. Matick:
Modular nets (MNETS): A modular design methodology for computer timers. IBM J. Res. Dev. 42(6): 813-830 (1998)
1980 – 1989
- 1989
- [j4]Richard E. Matick, Robert Mao, Samuel Ray:
Architecture, Design, and Operating Characteristics of a 12-ns CMOS Functional Cache Chip. IBM J. Res. Dev. 33(5): 524-539 (1989) - 1986
- [j3]Richard E. Matick:
Impact of Memory Systems on Computer Architecture and System Organization. IBM Syst. J. 25(3/4): 274-305 (1986) - 1984
- [j2]Richard E. Matick, Daniel T. Ling, Satish Gupta, Frederick Dill:
All Points Addressable Raster Display Memory. IBM J. Res. Dev. 28(4): 379-392 (1984) - [j1]Richard E. Matick, Daniel T. Ling:
Architecture Implications in the Design of Microprocessors. IBM Syst. J. 23(3): 264-280 (1984)
Coauthor Index

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-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint