![](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
Charles R. Baugh
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
1990 – 1999
- 1999
- [r2]Naofumi Takagi, Charles R. Baugh, Saburo Muroga:
Multipliers. The VLSI Handbook 1999 - [r1]Naofumi Takagi, Haruyuki Tago, Charles R. Baugh, Saburo Muroga:
Adders. The VLSI Handbook 1999
1980 – 1989
- 1982
- [j12]L. A. Baxter, Charles R. Baugh:
A comparison of architectural alternatives for local voice/data communications. IEEE Commun. Mag. 20(1): 44-51 (1982)
1970 – 1979
- 1977
- [j11]Charles R. Baugh:
Design and Performance of a Digital Multifrequency Receiver. IEEE Trans. Commun. 25(6): 608-615 (1977) - 1976
- [j10]Charles R. Baugh, Bruce A. Wooley:
Statistical Analysis of a Differential Threshold Logic Circuit Configuration. IEEE Trans. Computers 25(7): 745-754 (1976) - 1975
- [j9]Charles R. Baugh, Bruce A. Wooley:
Digital Multiplier Power Estimates. IEEE Trans. Commun. 23(11): 1287-1288 (1975) - 1973
- [j8]Charles R. Baugh:
Seventh annual ieee computer society international conference. Networks 3(4): 379-380 (1973) - [j7]Charles R. Baugh, Bruce A. Wooley:
A Two's Complement Parallel Array Multiplication Algorithm. IEEE Trans. Computers 22(12): 1045-1047 (1973) - [c2]Charles R. Baugh:
Chow Parameters in Pseudothreshold Logic. SWAT 1973: 49-55 - 1972
- [j6]Toshihide Ibaraki, Tso-Kai Liu, Charles R. Baugh, Saburo Muroga:
An implicit enumeration program for zero-one integer programming. Int. J. Parallel Program. 1(1): 75-92 (1972) - [j5]Charles R. Baugh, C. S. Chandersekaran, Richard S. Swee, Saburo Muroga:
Optimal Networks of NOR-OR Gates for Functions of Three Variables. IEEE Trans. Computers 21(2): 153-160 (1972) - [j4]Charles R. Baugh:
Generation of Representative Functions of the NPN Equivalence Classes of Unate Boolean Functions. IEEE Trans. Computers 21(12): 1373-1379 (1972) - 1971
- [j3]Charles R. Baugh, Toshihide Ibaraki, Saburo Muroga:
Technical Note - Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks. Oper. Res. 19(4): 1090-1096 (1971) - [j2]Charles R. Baugh:
Bounds on the Number of Pseudothreshold Functions. IEEE Trans. Computers 20(12): 1602-1605 (1971) - 1970
- [b1]Charles R. Baugh:
Pseudo-Threshold Logic: A Generalization of Threshold Logic. University of Illinois Urbana-Champaign, USA, 1970 - [j1]Saburo Muroga, Teiichi Tsuboi, Charles R. Baugh:
Enumeration of Threshold Functions of Eight Variables. IEEE Trans. Computers 19(9): 818-825 (1970)
1960 – 1969
- 1965
- [c1]Charles R. Baugh:
Undergraduate research in computer sciences: FODESAR: FORTRAN dependent storage allocation and relocation package. ACM National Conference 1965: 315-324
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-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint