default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen H. Unger
Person information
- affiliation: Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j26]Stephen H. Unger:
President message [SSIT Board Member Message]. IEEE Technol. Soc. Mag. 31(3): 3-5 (2012)- 2010
- [j25]Stephen H. Unger:
Responsibility in Engineering: Victor Paschkis vs. Wernher von Braun. IT Prof. 12(3): 6-7 (2010)
2000 – 2009
- 2005
- [j24]Stephen H. Unger:
Is engineering a viable profession in the US? IEEE Des. Test Comput. 22(1): 10-11 (2005) - [j23]Stephen H. Unger:
Poor programming quality. IEEE Technol. Soc. Mag. 24(4): 44 (2005) - 2004
- [j22]Stephen H. Unger:
Making computer professionals and other engineers: low-priced commodities. IEEE Technol. Soc. Mag. 23(2): 36-40 (2004) - 2003
- [j21]Stephen H. Unger:
Reducing Power Dissipation, Delay, and Area in Logic Circuits by Narrowing Transistors. IEEE Des. Test Comput. 20(6): 18-24 (2003) - [j20]Stephen H. Unger:
Judges versus engineers. IEEE Technol. Soc. Mag. 22(1): 5-8 (2003) - 2001
- [j19]Stephen H. Unger:
The Wen Ho Lee Case: SSIT's Role and an Update. IEEE Technol. Soc. Mag. 20(1): 39-40 (2001) - 2000
- [j18]Fu-Chiung Cheng, Stephen H. Unger, Michael Theobald:
Self-Timed Carry-Lookahead Adders. IEEE Trans. Computers 49(7): 659-672 (2000)
1990 – 1999
- 1999
- [j17]Stephen H. Unger:
The assault on IEEE ethics support [Viewpoint]. IEEE Technol. Soc. Mag. 18(1): 36-40 (1999) - 1998
- [c8]Luis A. Plana
, Stephen H. Unger:
Pulse-mode macromodular systems. ICCD 1998: 348-353 - 1997
- [c7]Fu-Chiung Cheng, Stephen H. Unger, Michael Theobald, Wen-Chung Cho:
Delay-Insensitive Carry-Lookahead Adders. VLSI Design 1997: 322-328 - 1996
- [b2]Stephen H. Unger:
The essence of logic circuits (2. ed.). IEEE 1996, ISBN 978-0-7803-1126-8, pp. I-XVI, 1-340 - 1995
- [j16]Stephen H. Unger:
Hazards, Critical Races, and Metastability. IEEE Trans. Computers 44(6): 754-768 (1995) - 1994
- [j15]Stephen H. Unger:
Some Additions to "Solution of Switching Equations Based on a Tabular Algebra". IEEE Trans. Computers 43(3): 365-367 (1994)
1980 – 1989
- 1989
- [b1]Stephen H. Unger:
The essence of logic circuits. Prentice Hall 1989, ISBN 978-0-13-284035-4, pp. I-XV, 1-302 - 1986
- [j14]Stephen H. Unger, Chung-Jen Tan:
Clocking Schemes for High-Speed Digital Systems. IEEE Trans. Computers 35(10): 880-895 (1986) - 1981
- [j13]Stephen H. Unger:
Double-Edge-Triggered Flip-Flops. IEEE Trans. Computers 30(6): 447-451 (1981)
1970 – 1979
- 1977
- [j12]Stephen H. Unger:
The Generation of Completion Signals in Iterative Combinational Circuits. IEEE Trans. Computers 26(1): 13-18 (1977) - [j11]Stephen H. Unger:
Self-Synchronizing Circuits and Nonfundamental Mode Operation. IEEE Trans. Computers 26(3): 278-281 (1977) - [j10]Stephen H. Unger:
Tree Realizations of Iterative Circuits. IEEE Trans. Computers 26(4): 365-383 (1977) - [c6]George W. Arnold, Stephen H. Unger:
A structured data base computer conferencing system. AFIPS National Computer Conference 1977: 461-467 - 1972
- [j9]Stephen H. Unger:
The Need for Heroes. Computer 5(1): 22-23 (1972) - 1971
- [j8]Stephen H. Unger:
Asynchronous Sequential Switching Circuits with Unrestricted Input Changes. IEEE Trans. Computers 20(12): 1437-1444 (1971) - 1970
- [c5]Stephen H. Unger:
Asynchronous Sequential Switching Circuits with Unrestricted Input Changes. SWAT 1970: 114-121
1960 – 1969
- 1968
- [j7]Stephen H. Unger:
A global parser for context-free phrase structure grammars. Commun. ACM 11(4): 240-247 (1968) - [j6]Marvin C. Paull, Stephen H. Unger:
Structural Equivalence of Context-Free Grammars. J. Comput. Syst. Sci. 2(4): 427-463 (1968) - [j5]Stephen H. Unger:
A Row Assignment for Delay-Free Realizations of Flow Tables Without Essential Hazards. IEEE Trans. Computers 17(2): 146-151 (1968) - [c4]Marvin C. Paull, Stephen H. Unger:
Structural Equivalence and LL-k Grammars. SWAT 1968: 176-186 - 1967
- [c3]Marvin C. Paull, Stephen H. Unger:
Structural Equivalence of Context-Free Grammars. SWAT 1967: 7-13 - 1966
- [c2]Stephen H. Unger:
A Row Assignment for Delay-Free Realizations of Flow Tables without Essential Hazards. SWAT 1966: 154-159 - 1965
- [j4]Stephen H. Unger:
Flow Table Simplification-Some Useful Aids. IEEE Trans. Electron. Comput. 14(3): 472-475 (1965) - 1964
- [j3]Stephen H. Unger:
GIT - a heuristic program for testing pairs of directed line graphs for isomorphism. Commun. ACM 7(1): 26-34 (1964)
1950 – 1959
- 1959
- [j2]Marvin C. Paull, Stephen H. Unger:
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions. IRE Trans. Electron. Comput. 8(3): 356-367 (1959) - [j1]Edward Joseph McCluskey Jr., Stephen H. Unger:
A Note on the Number of Internal Variable Assignments for Sequential Switching Circuits. IRE Trans. Electron. Comput. 8(4): 439-440 (1959) - 1958
- [c1]Stephen H. Unger:
A computer oriented toward spatial problems. IRE-ACM-AIEE Computer Conference (Western) 1958: 234-239
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 2025-01-09 13:06 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:
