Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerald Estrin
Person information
- affiliation: University of California, Los Angeles, USA
- award (1995): Computer Pioneer Award
- 1924-2012
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2002
[j22]Gerald Estrin:
Reconfigurable Computer Origins: The UCLA Fixed-Plus-Variable (F+V) Structure Computer. IEEE Ann. Hist. Comput. 24(4): 3-9 (2002)- 2000
- [j21]Gerald Estrin:
Computer Network-Based Scientific Collaboration in the Energy Research Community, 1973-1977: A Memoir. IEEE Ann. Hist. Comput. 22(2): 42-52 (2000) - 1994
- [j20]Ivan Tou, Steven Berson, Gerald Estrin, Yadran Eterovic, Elsie Wu:
Prototyping Synchronous Group Applications. Computer 27(5): 48-56 (1994) - 1986
- [j19]Gerald Estrin, Robert S. Fenchel, Rami R. Razouk, Mary K. Vernon:
SARA (System ARchitects Apprentice): Modeling, Analysis, and Simulation Support for Design of Concurrent Systems. IEEE Trans. Software Eng. 12(2): 293-311 (1986) - 1982
- [j18]Robert S. Fenchel, Gerald Estrin:
Self-Descrbing Systems Using Integral Help. IEEE Trans. Syst. Man Cybern. 12(2): 162-167 (1982) - 1980
- [j17]Rami R. Razouk, Gerald Estrin:
Modeling and Verification of Communication Protocols in SARA: The X.21 Interface. IEEE Trans. Computers 29(12): 1038-1052 (1980) - 1972
- [j16]Kim P. Gostelow, Vincent G. Cerf, Gerald Estrin, Saul Volansky:
Proper termination of flow-of-control in programs involving concurrent processes. ACM SIGPLAN Notices 7(11): 15-27 (1972) - 1970
- [j15]Jean-Loup Baer, Daniel P. Bovet, Gerald Estrin:
Legality and Other Properties of Graph Models of Computations. J. ACM 17(3): 543-554 (1970) - [j14]Daniel P. Bovet, Gerald Estrin:
A Dynamic Memory Allocation Algorithm. IEEE Trans. Computers 19(5): 403-411 (1970) - [j13]Daniel P. Bovet, Gerald Estrin:
On Static Memory Allocation in Computer Systems. IEEE Trans. Computers 19(6): 492-503 (1970) - 1969
- [j12]David F. Martin, Gerald Estrin:
Path Length Computations on Graph Models of Computations. IEEE Trans. Computers 18(6): 530-536 (1969) - [j11]Jean-Loup Baer, Gerald Estrin:
Bounds for Maxium Parallelism in a Bilogic Graph Model of Computations. IEEE Trans. Computers 18(11): 1012-1014 (1969) - 1967
- [j10]David F. Martin, Gerald Estrin:
Models of Computations and Systems - Evaluation of Vertex Probabilities in Graph Models of Computations. J. ACM 14(2): 281-299 (1967) - [j9]David F. Martin, Gerald Estrin:
Experiments on Models of Computations and Systems. IEEE Trans. Electron. Comput. 16(1): 59-69 (1967) - [j8]David F. Martin, Gerald Estrin:
Models of Computational Systems-Cyclic to Acyclic Graph Transformations. IEEE Trans. Electron. Comput. 16(1): 70-79 (1967) - 1963
- [j7]Gerald Estrin, Bertram Bussell, Rein Turn, James Bibb:
Parallel Processing in a Restructurable Computer System. IEEE Trans. Electron. Comput. 12(6): 747-755 (1963) - [j6]Gerald Estrin, Rein Turn:
Automatic Assignment of Computations in a Variable Structure Computer System. IEEE Trans. Electron. Comput. 12(6): 755-773 (1963) - 1962
- [j5]Gerald Estrin, C. R. Viswanathan:
Organization of a "Fixed-Plus-Variable" Structure Computer for Computation of Eigenvalues and Eigenvectors of Real Symmetric Matrices. J. ACM 9(1): 41-60 (1962) - [j4]Gerald Estrin, C. R. Viswanathan:
Correction and Addendum: "Organization of a 'Fixed-Plus-Variable' Structure Computer for Computation of Eigenvalues and Eigenvectors of Real Symmetric Matrices". J. ACM 9(4): 522 (1962) - [j3]David Geoffrey Cantor, Gerald Estrin, Rein Turn:
Logarithmic and Exponential Function Evaluation in a Variable Structure Digital Computer. IRE Trans. Electron. Comput. 11(2): 155-164 (1962) - 1961
- [j2]Masanao Aoki, Gerald Estrin:
Bilateral Switching Using Nonsymmetric Elements. IRE Trans. Electron. Comput. 10(1): 42-50 (1961) - 1956
- [j1]Gerald Estrin, Bruce Gilchrist, James H. Pomerene:
A Note on High-Speed Digital Multiplication. IRE Trans. Electron. Comput. 5(3): 140 (1956)
Conference and Workshop Papers
- 1992
- [c32]Gerald Estrin, Steven Berson, Ivan Tou:
coSARA: A System for Collaborative Design. CSCW Tools and Technologies Workshop 1992: 10 - 1985
- [c31]Gerald Estrin:
SARA in the design room. ACM Conference on Computer Science 1985: 1-12 - 1983
- [c30]Mary K. Vernon, Edmundo de Souza e Silva, Gerald Estrin:
Performance Evaluation of Asynchronous Concurrent Systems: The UCLA Graph Model of Behavior. Performance 1983: 153-171 - 1982
- [c29]James W. Winchester, Gerald Estrin:
Requirements definition and its interface to the SARA design methodology for computer-based systems. AFIPS National Computer Conference 1982: 369-379 - 1981
- [c28]Maria Heloisa (Lolo) Penedo, Daniel M. Berry, Gerald Estrin:
An Algorithm to Support Code-Skeleton Generation for Concurrent Systems. ICSE 1981: 125-135 - 1979
- [c27]Wilson Vicente Ruggiero
, Gerald Estrin, Robert S. Fenchel, Rami R. Razouk, D. Schwabe, Mary K. Vernon:
Analysis of data flow models using the SARA graph model of behavior. MARK 1979: 975-988 - [c26]Rami R. Razouk, Mary K. Vernon, Gerald Estrin:
Evaluation methods in SARA - the graph model simulator. SIGMETRICS 1979: 189-206 - 1978
- [c25]Gerald Estrin:
A methodology for the design of digital systems-Supported by SARA at the age of one. AFIPS National Computer Conference 1978: 313-324 - [c24]Ivan M. Campos, Gerald Estrin:
SARA aided design of software for concurrent systems. AFIPS National Computer Conference 1978: 325-336 - [c23]Ivan M. Campos, Gerald Estrin:
Concurrent Software System Design, Supported by SARA at the Age of One. ICSE 1978: 230-242 - [c22]Gerald Estrin:
Electronic Digital Computing in Israel: Between the Golems of Prague and Rehovot. Jerusalem Conference on Information Technology 1978: 323-329 - [c21]Gerald Estrin:
Applications of Machine Descriptions to Design of Concurrent Systems. Jerusalem Conference on Information Technology 1978: 337-347 - 1977
- [c20]Gerald Estrin:
Modeling for synthesis - the gap between intent and behavior. Design Automation and Microprocessors 1977: 54-59 - [c19]Rami R. Razouk, Gerald Estrin:
The graph model of behavior simulator. Design Automation and Microprocessors 1977: 67-76 - [c18]William T. Overman, Gerald Estrin:
Developing a SARA building block - the 8080. Design Automation and Microprocessors 1977: 77-86 - [c17]Ivan M. Campos, Gerald Estrin:
Specialization of SARA for software synthesis. Design Automation and Microprocessors 1977: 87-94 - 1972
- [c16]Kim P. Gostelow, Vincent G. Cerf, Gerald Estrin, Saul Volansky:
Proper termination of flow-of-control in programs involving concurrent processes. ACM Annual Conference (2) 1972: 742-754 - [c15]Gerald Estrin, Richard R. Muntz, Robert C. Uzgalis:
Modeling, measurement and computer power. AFIPS Spring Joint Computing Conference 1972: 725-738 - 1971
- [c14]Vinton G. Cerf, Gerald Estrin:
Measurement of Recursive Programs. IFIP Congress (1) 1971: 314-319 - [c13]H. J. Helms, Gerald Estrin, B. Whitman, G. Kacin, C. Kohn:
Computer System Performance. IFIP Congress (2) 1971: 1590-1605 - 1969
- [c12]H. Potash, A. Tyrrill, D. Allen, S. Joseph, Gerald Estrin:
DCDS digital simulating system. AFIPS Fall Joint Computing Conference 1969: 707-720 - [c11]E. C. Russell, Gerald Estrin:
Measurement based automatic analysis of FORTRAN programs. AFIPS Spring Joint Computing Conference 1969: 723-732 - 1967
- [c10]Gerald Estrin, Leonard Kleinrock:
Measures, models and measurements for time-shared computer utilities. ACM National Conference 1967: 85-96 - [c9]Gerald Estrin, D. Hopkins, B. Coggan, Stephen D. Crocker:
Snuper computer: a computer in instrumentation automaton. AFIPS Spring Joint Computing Conference 1967: 645-656 - 1966
- [c8]Richard L. Mandell, Gerald Estrin:
A meta-compiler as a design automation tool. DAC 1966 - 1965
- [c7]Richard L. Mandell, Gerald Estrin:
Specifications for a design automation system. DAC 1965 - 1963
- [c6]Masanao Aoki, Gerald Estrin, Richard L. Mandell:
Analysis of computing-load assignment in a multi-processor computer. AFIPS Fall Joint Computing Conference 1963: 147-160 - [c5]Gerald Estrin, R. H. Fuller:
Some applications for content-addressable memories. AFIPS Fall Joint Computing Conference 1963: 495-508 - 1961
- [c4]Masanao Aoki, Gerald Estrin, T. Tang:
Parallelism in computer organization random number generation in the fixed-plus-variable computer system. IRE-AIEE-ACM Computer Conference (Western) 1961: 157-172 - 1960
- [c3]Gerald Estrin:
Organization of computer systems: the fixed plus variable structure computer. IRE-AIEE-ACM Computer Conference (Western) 1960: 33-40 - 1958
- [c2]Gerald Estrin:
The Shiftrix-machine organization for high-speed digital computation. IRE-ACM-AIEE Computer Conference (Western) 1958: 207-211 - 1952
- [c1]Gerald Estrin:
A description of the electronic computer at the institute for advanced studies. ACM National Meeting (Toronto) 1952: 95-109
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 02:48 CEST 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:
