![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
George Epstein
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
- [j12]George Epstein, Helena Rasiowa:
A partially ordered extention of the integers. Stud Logica 54(3): 303-332 (1995) - 1994
- [c9]George Epstein:
A Weak Propositional Calculus for Signal Processing with Thresholds. ISMVL 1994: 356-361 - 1991
- [c8]George Epstein, Helena Rasiowa:
Theory and Uses of Post Algebras of Order \omega+\omega\ast. Part II. ISMVL 1991: 248-254 - 1990
- [c7]George Epstein, Helena Rasiowa:
Theory and Uses of Post Algebras of Order omega+omegaw\ast.I. ISMVL 1990: 42-47
1980 – 1989
- 1989
- [j11]George Epstein:
Fifth Southeastern Logic Symposium. J. Symb. Log. 54(4): 1498 (1989) - 1988
- [c6]George Epstein:
Thresholds for Certainty and the Modal Logic S3. IPMU 1988: 273-280 - 1987
- [c5]Helena Rasiowa, George Epstein:
Approximation Reasoning and Scott's Information Systems. ISMIS 1987: 33-42 - 1986
- [c4]George Epstein:
Memory length as a feedback parameter in learning systems. ISMIS 1986: 290-295
1970 – 1979
- 1978
- [c3]George Epstein:
A summary of investigations into three and four valued logics. MVL 1978: 257 - 1976
- [j10]George Epstein, Alfred Horn:
Logics Which Are Characterized by Subresiduated Lattices. Math. Log. Q. 22(1): 199-210 (1976) - 1975
- [j9]George Epstein:
The pyramid teaching computer structures by computer structures. ACM SIGCSE Bull. 7(3): 58-61 (1975) - 1974
- [j8]George Epstein, Gideon Frieder, David C. Rine:
The development of multiple-valued logic as related to computer science. Computer 7(9): 20-32 (1974) - 1973
- [j7]George Epstein:
An Equational Axiomatization for the Disjoint System of Post Algebras. IEEE Trans. Computers 22(4): 422-423 (1973) - [j6]George Epstein:
Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement". IEEE Trans. Computers 22(9): 864 (1973) - 1971
- [j5]George Epstein:
Comments on 'On Finite-Memory Recursive Filters'. IEEE Trans. Inf. Theory 17(5): 614 (1971) - [j4]George Epstein:
A Note on the Derivation of Finite-Memory Almost-Least-Squares Recursive Filters. IEEE Trans. Inf. Theory 17(6): 753 (1971) - [c2]George Epstein:
Adaptive memory trackers. AFIPS Fall Joint Computing Conference 1971: 663-668 - 1970
- [j3]George Epstein:
On finite-memory recursive filters (Corresp.). IEEE Trans. Inf. Theory 16(4): 486-487 (1970)
1960 – 1969
- 1968
- [c1]George Epstein:
Recursive Fast Fourier Transforms. AFIPS Fall Joint Computing Conference (1) 1968: 141-143 - 1962
- [j2]John S. Bailey, George Epstein:
Single Function Shifting Counters. J. ACM 9(3): 375-378 (1962)
1950 – 1959
- 1958
- [j1]George Epstein:
Synthesis of Electronic Circuits for Symmetric Functions. IRE Trans. Electron. Comput. 7(1): 57-60 (1958)
![](https://dblp.uni-trier.de/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-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint