default search action
Gary K. Maki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j15]Sterling R. Whitaker, Lowell H. Miles, Jody W. Gambles, Paul Winterrowd, Ron Nelson, Chad Orbe, Gary K. Maki:
Radiation Tolerance Techniques for a 1.6 Gb/s, 8 K and 4 K Low-Density Parity-Check Encoder. IEEE J. Solid State Circuits 44(6): 1776-1784 (2009) - 2006
- [j14]Lowell H. Miles, Jody W. Gambles, Gary K. Maki, William E. Ryan, Sterling R. Whitaker:
An 860-Mb/s (8158, 7136) Low-Density Parity-Check Encoder. IEEE J. Solid State Circuits 41(8): 1686-1691 (2006) - 2005
- [c3]Lowell H. Miles, Jody W. Gambles, Gary K. Maki, William E. Ryan, Sterling R. Whitaker:
An (8158, 7136) low-density parity-check encoder. CICC 2005: 699-702
1990 – 1999
- 1992
- [j13]Sterling R. Whitaker, Gary K. Maki:
Self Synchronized Asynchronous Sequential Pass Transistor Circuits. IEEE Trans. Computers 41(10): 1344-1348 (1992) - 1990
- [c2]Suresh K. Gopalakrishnan, Gary K. Maki:
VLSI asynchronous sequential circuit design. ICCD 1990: 238-242
1980 – 1989
- 1989
- [j12]Sterling R. Whitaker, Gary K. Maki:
Pass-transistor asynchronous sequential circuits. IEEE J. Solid State Circuits 24(1): 71-78 (1989)
1970 – 1979
- 1975
- [j11]Dwight H. Sawin III, Gary K. Maki:
Fail-Safe Asynchronous Sequential Machines. IEEE Trans. Computers 24(6): 675-677 (1975) - [j10]Dwight H. Sawin III, Gary K. Maki:
Comments on "Fault-Tolerant Asynchronous Networks". IEEE Trans. Computers 24(7): 756-759 (1975) - 1974
- [j9]Dwight H. Sawin III, Gary K. Maki:
Asynchronous Sequential Machines Designed for Fault Detection. IEEE Trans. Computers 23(3): 239-249 (1974) - [j8]Ray S. Wickersham, Gary K. Maki:
Safe Asynchronous Sequential Circuits. IEEE Trans. Computers 23(5): 494-500 (1974) - [j7]Gary K. Maki, Dwight H. Sawin III:
Fault-Tolerant Asynchronous Sequential Machines. IEEE Trans. Computers 23(7): 651-657 (1974) - 1973
- [j6]Gary K. Maki, Dwight H. Sawin III:
Comments on "Next-State Equations of Asynchronous Sequential Machines". IEEE Trans. Computers 22(2): 218 (1973) - 1972
- [j5]Gary K. Maki, Dwight H. Sawin III, Bore-Ren A. Jeng:
Improved State Assignment Selection Tests. IEEE Trans. Computers 21(12): 1443-1449 (1972) - 1971
- [j4]Gary K. Maki, James H. Tracey:
A State Assignment Procedure for Asynchronous Sequential Circuits. IEEE Trans. Computers 20(6): 666-668 (1971) - [j3]Gary K. Maki, James H. Tracey:
Maximum-distance linear codes (Corresp.). IEEE Trans. Inf. Theory 17(5): 632 (1971) - 1970
- [j2]Gary K. Maki, James H. Tracey:
State Assignment Selection in Asynchronous Sequential Circuits. IEEE Trans. Computers 19(7): 641-644 (1970)
1960 – 1969
- 1969
- [j1]Gary K. Maki, James H. Tracey, Robert J. Smith:
Generation of Design Equations in Asynchronous Sequential Circuits. IEEE Trans. Computers 18(5): 467-472 (1969) - 1968
- [c1]Robert J. Smith, James H. Tracey, W. L. Schoeffel, Gary K. Maki:
Automation in the design of asynchronous sequential circuits. AFIPS Spring Joint Computing Conference 1968: 55-60
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-11-13 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: