Michael A. Harrison

Michael A. Harrison's AcademicInfluence.com Rankings

Michael A. Harrison

Computer Science

#8032

Historical Rank

Database

#4861

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Michael A. Harrison's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Michael A. Harrison Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Michael A. Harrison's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Protection in operating systems (1976) (1255)
Introduction to formal language theory (1978) (974)
Introduction to switching and automata theory (1965) (345)
An Improved Context-Free Recognizer (1980) (244)
One-way stack automata (1967) (202)
Stack automata and compiling (1967) (121)
Accurate static estimators for program optimization (1994) (118)
Proceedings of the fifth annual ACM symposium on Theory of computing (1977) (103)
Bracketed Context-Free Languages (1967) (94)
Strict Deterministic Grammars (1973) (93)
On the Classification of Boolean Functions by the General Linear and Affine Groups (1964) (74)
On the Parsing of Deterministic Languages (1974) (68)
On the Covering and Reduction Problems for Context-Free Grammars (1972) (66)
Multi-Tape and Multi-Head Pushdown Automata (1968) (65)
Lectures on linear sequential machines (1969) (64)
Two-Way Pushdown Automata (1967) (56)
Real-Time Strict Deterministic Languages (1972) (53)
On Equivalence of Grammars Through Transformation Trees (1979) (48)
Parsing of General Context-Free Languages (1976) (46)
A Census of Finite Automata (1964) (44)
On the Cycle Index of a Product of Permutation Groups (1968) (40)
Algebraic Properties of Symmetric and Partially Symmetric Boolean Functions (1963) (39)
On protection in operating systems (1975) (38)
Proceedings of the third annual ACM symposium on Theory of computing (1971) (37)
The Proteus presentation system (1992) (36)
Advances in Information Systems Science (1981) (35)
Complementary methods for the iterative design of interactive systems (1989) (33)
On LR(k) Grammars and Languages (1977) (32)
Multiple representation document development (1988) (30)
On line context free language recognition in less than cubic time(Extended Abstract) (1976) (30)
The number of transitivity sets of Boolean functions : technical note (1963) (26)
The Theory of Sequential Relations (1966) (25)
The technology war: a case for competitiveness (1987) (25)
COUNTING THEOREMS AND THEIR APPLICATIONS TO CLASSIFICATION OF SWITCHING FUNCTIONS (1971) (24)
One-way nondeterministic real-time list-storage languages (1968) (22)
The Number of Classes of Invertible Boolean Functions (1963) (21)
Theories of Abstract Automata. Michael A. Arbib. Prentice-Hall, Englewood Cliffs, N.J., 1969. xviii, 414 pp., illus. $14.95. Prentice-Hall Series in Automatic Computation (1970) (20)
Index preparation and processing (1988) (20)
Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, I (1977) (20)
The Number of Equivalence Classes of Boolean Functions Under Groups Containing Negation (1963) (17)
The VORTEX Document Preparation Environment (1986) (17)
Normal forms of deterministic grammars (1976) (17)
Presentation by tree transformation (1997) (16)
Applied Cryptology, Cryptographic Protocols, and Computer Security Models (1983) (16)
A Grammatical Characterization of One-Way Nondeterministic Stack Languages (1971) (15)
Canonical Precedence Schemes (1973) (15)
Strict deterministic versus LR(0) parsing (1973) (13)
A Multiple-Representation Paradigm for Document Development (1988) (12)
Proceedings of the eleventh annual ACM symposium on Theory of computing (1974) (12)
Theoretical Issues Concerning Protection in Operating Systems (1985) (12)
On Equivalence of State Assignments (1968) (11)
On Asymptotic Estimates in Switching and Automata Theory (1966) (11)
Eliminating Null Rules in Linear Time (1981) (10)
Combinatorial problems in boolean algebras and applications to the theory of switching (1963) (9)
Single Pass Precedence Analysis (Extended Abstract) (1969) (9)
Production Prefix Parsing (Extended Abstract) (1974) (9)
On the Number of Classes of Binary Matrices (1973) (9)
On the Closure of AFL under Reversal (1970) (8)
Infinite Linear Sequential Machines (1968) (8)
Proceedings of the fourth annual ACM symposium on Theory of computing (1969) (8)
Characterizations of LR(O) languages (1973) (8)
On the number of classes of (n,k) switching networks (1963) (7)
The number of isomorphism types of finite algebras (1966) (7)
Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1973) (7)
On the Error Correcting Capacity of Finite Automata (1965) (7)
Grendel: a Web browser with end user extensibility (1997) (7)
A Hierarchy of Deterministic Languages (1979) (6)
Incremental document formatting (2000) (6)
Automating Index Preparation (1987) (6)
On Integrated Bibliography Processing (1989) (6)
Numbering Document Components (1991) (6)
Note on the number of finite algebras (1966) (5)
On a Family of Deterministic Grammars (Extended Abstract) (1972) (4)
On Covers and Precedence Analysis (1973) (4)
Production Prefix Parsing (1974) (4)
Iteration Theorems for Deterministic Families of Languages (1985) (3)
Integrating Noninteractive Document Processors into an Interactive Environment (1987) (3)
Advanced Software Applications in Japan (1995) (3)
In memory of Seymour Ginsburg 1928 - 2004 (2005) (3)
Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, II (1977) (3)
On the Relation Between Grammars and Automata (1972) (3)
Decomposition of linear sequential machines (1969) (3)
Theory of Automata. Arto Salomaa. Pergamon, New York, 1969. xii, 264 pp., illus. $12. International Series of Monographs in Pure and Applied Mathematics, vol. 100 (1970) (3)
News from the VOR~ Project (1989) (2)
One-Way Stack Automata (Extended Abstract) (1966) (2)
A Remark on Uniform Distribution (1964) (2)
4/67–1R Theory of Self‐Reproducing Automata. 1966. John von Neumann. Arthur W. Burks, Editor. University of Illinois Press. (1967) (2)
Proving Protection Systems Safe (1976) (2)
On Models of Protection in Operating Systems (1975) (2)
Science in technology: technology in science (1990) (2)
An improved user environment for TEX (1986) (2)
Regulation FD's Effect on Fixed-Income Investors: Is the Public Protected or Harmed? (2002) (2)
On the Elimination of Endmarkers (1968) (2)
Characterizations of LR(0) Languages (Extended Abstract) (1973) (2)
Jim Gray at Berkeley (2008) (1)
Symmetric and partially symmetric boolean functions (1962) (1)
Multiple representation document development (1988) (1)
Integrating Noninteractive Document Processors Into an Interactive (1987) (1)
Lodon by gaslight : 1861-1911 (1987) (1)
GRAMMARS AND LANGUAGES (1977) (1)
A Debugger for the Post Script Language (1991) (1)
A Debugger for the PostScript Language (1991) (1)
Technical Issues in Hypermedia Authoring Systems* Extended Abstract (1995) (0)
Software News from the Vor~ Project (2011) (0)
Proving Nonmembership in Certain Families of Context Free Languages (1991) (0)
Technical issues in hypermedia authoring systems (1995) (0)
Special SIGACT issue (1973) (0)
Programming and operating systems overview (1899) (0)
A census of finite automata (extended summary) (1964) (0)
Automata theory: edited by E. R. Caianiello. 342 pages, diagrams, 6 × 9 in. New York, Academic Press, Inc., 1966. Price, $14.00 (1967) (0)
The Number of Transitivity Sets of Boolean Functions@@@The Number of Equivalence Classes of Boolean Functions under Groups Containing negation.@@@On the Number of Classes of (n, k) Switching Networks.@@@The Number of Classes of Invertible Boolean Functions. (1970) (0)
A Remark on Determining the Number of States of a Sequential Machine (1967) (0)
Crossjam: a language for hypermedia authoring (1998) (0)
Multiple representation document development (extende abstract) (1988) (0)
Executive Committee Position on VLDB Conferences (1982) (0)
Mutually divisible semigroups (1974) (0)
R69-14 Translator Writing Systems (1969) (0)
ONE-WAY REAL-TIME LIST-STORAGE LANGUAGES, (1967) (0)
R69-9 Deterministic Stack Automata and the Quotient Operator (1969) (0)
RESEARCH ON COMPUTER LOGIC AND NUMBER SYSTEF. (1964) (0)
Theoretical results in compiler design and implementation (Tutorial Session) (1976) (0)
Abstracts of Current Computer Literature (1963) (0)
SIGACT (Tutorial Session) (1976) (0)
De ning Hypermedia: The Essential Elements (0)
Truth functions and the problem of their realization by two-terminal graphs, by A. Ádám. Akadémiai Kiadó, Budapest, 1968. 206 pages. U.S. $7.80. (1969) (0)
B70-1 Truth Functions and the Problem of Their Realization by Two-Terminal Graphs (1970) (0)
User Interface Management System Embedded in a Multimedia Document Editor Framework (1993) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Michael A. Harrison?

Michael A. Harrison is affiliated with the following schools:

Michael A. Harrison's Academic­Influence.com Rankings