Michael A. Harrison

Affiliations:
  • University of California, Berkeley, USA


According to our database1, Michael A. Harrison authored at least 70 papers between 1963 and 2008.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 1996, "For his rare combination of fundamental theoretical contributions in automata theory and formal languages, service to ACM, and entrepreneurial contributions.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2008
Jim Gray at Berkeley.
SIGMOD Rec., 2008

2005
In memory of Seymour Ginsburg 1928 - 2004.
SIGMOD Rec., 2005

1997
Presentation by tree transformation.
Proceedings of the Proceedings IEEE COMPCON 97, 1997

Grendel: a Web browser with end user extensibility.
Proceedings of the Proceedings IEEE COMPCON 97, 1997

1995
Technical Issues in Hypermedia Authoring Systems (Extended Abstract).
Proceedings of the COMPCON '95: Technologies for the Information Superhighway, 1995

1994
Accurate Static Estimators for Program Optimization.
Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI), 1994

1993
User Interface Management System Embedded in a Multimedia Document Editor Framework.
Proceedings of the Foundations of Data Organization and Algorithms, 1993

1992
The Proteus presentation system.
Proceedings of the 5th ACM SIGSOFT Symposium on Software Development Environments, 1992

Proving Nonmembership in Certain Families of Context Free Languages.
Proceedings of the Theoretical Studies in Computer Science, 1992

1991
Numbering Document Components.
Electron. Publ., 1991

1988
Index Preparation and Processing.
Softw. Pract. Exp., 1988

On Integrated Bibliography Processing.
Electron. Publ., 1988

Multiple Representation Document Development.
Computer, 1988

Incremental document formatting.
Proceedings of the ACM conference on Document processing systems, 1988

1986
An improved user environment for T<sub>E</sub>X.
Proceedings of the T<sub>E</sub>X for Scientific Documentation, 1986

The V<sub>OR</sub>T<sub>E</sub>X Document Preparation Environment.
Proceedings of the T<sub>E</sub>X for Scientific Documentation, 1986

1985
Theoretical Issues Concerning Protection in Operating Systems.
Adv. Comput., 1985

1982
Executive Committee Position on VLDB Conferences
SIGMOD Rec., 1982

1981
Eliminating Null Rules in Linear Time.
Comput. J., 1981

1980
An Improved Context-Free Recognizer.
ACM Trans. Program. Lang. Syst., 1980

1979
On Equivalence of Grammars Through Transformation Trees.
Theor. Comput. Sci., 1979

A Hierarchy of Deterministic Languages.
J. Comput. Syst. Sci., 1979

1978
Programming and operating systems overview.
Proceedings of the American Federation of Information Processing Societies: 1978 National Computer Conference, 1978

1977
On LR<i>(k)</i> Grammars and Languages.
Theor. Comput. Sci., 1977

Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, II.
J. Comput. Syst. Sci., 1977

Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, I.
J. Comput. Syst. Sci., 1977

1976
Normal forms of deterministic grammars.
Discret. Math., 1976

Protection in Operating Systems.
Commun. ACM, 1976

Parsing of General Context-Free Languages.
Adv. Comput., 1976

On Line Context Free Language Recognition in Less than Cubic Time (Extended Abstract)
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

Theoretical results in compiler design and implementation (Tutorial Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

SIGACT (Tutorial Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

1975
On Protection in Operating System.
Proceedings of the Fifth Symposium on Operating System Principles, 1975

On Models of Protection in Operating Systems.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

1974
On the Parsing of Deterministic Languages.
J. ACM, 1974

Mutually divisible semigroups.
Discret. Math., 1974

Production Prefix Parsing (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973
On the Number of Classes of Binary Matrices.
IEEE Trans. Computers, 1973

Strict Deterministic Grammars.
J. Comput. Syst. Sci., 1973

Canonical Precedence Schemes.
J. ACM, 1973

Strict Deterministic Versus LR(0) Parsing.
Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

On Covers and Precedence Analysis.
Proceedings of the Gesellschaft für Informatik e.V., 1973

Characterizations of LR(0) Languages (Extended Abstract)
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1972
Real-Time Strict Deterministic Languages.
SIAM J. Comput., 1972

On the Covering and Reduction Problems for Context-Free Grammars.
J. ACM, 1972

On a Family of Deterministic Grammars (Extended Abstract).
Proceedings of the Automata, 1972

1971
A Grammatical Characterization of One-Way Nondeterministic Stack Languages.
J. ACM, 1971

1970
On the Closure of AFL under Reversal
Inf. Control., November, 1970

B70-1 Truth Functions and the Problem of Their Realization by Two-Terminal Graphs.
IEEE Trans. Computers, 1970

1969
Decomposition of Linear Sequential Machines.
Math. Syst. Theory, 1969

Single Pass Precedence Analysis (Extended Abstract)
Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

1968
Multi-Tape and Multi-Head Pushdown Automata
Inf. Control., November, 1968

On the Elimination of Endmarkers
Inf. Control., February, 1968

On Equivalence of State Assignments.
IEEE Trans. Computers, 1968

Infinite Linear Sequential Machines.
J. Comput. Syst. Sci., 1968

One-way nondeterministic real-time list-storage languages.
J. ACM, 1968

1967
A Remark on Determining the Number of States of a Sequential Machine.
IEEE Trans. Electron. Comput., 1967

Bracketed Context-Free Languages.
J. Comput. Syst. Sci., 1967

One-way stack automata.
J. ACM, 1967

Stack automata and compiling.
J. ACM, 1967

Two-Way Pushdown Automata
Inf. Control., 1967

1966
The Theory of Sequential Relations
Inf. Control., October, 1966

On Asymptotic Estimates in Switching and Automata Theory.
J. ACM, 1966

One-Way Stack Automata (Extended Abstract)
Proceedings of the 7th Annual Symposium on Switching and Automata Theory, 1966

1965
On the Error Correcting Capacity of Finite Automata
Inf. Control., August, 1965

1964
A Remark on Uniform Distribution.
IEEE Trans. Electron. Comput., 1964

A census of finite automata (extended summary)
Proceedings of the 5th Annual Symposium on Switching Circuit Theory and Logical Design, 1964

1963
The Number of Equivalence Classes of Boolean Functions Under Groups Containing Negation.
IEEE Trans. Electron. Comput., 1963

Algebraic Properties of Symmetric and Partially Symmetric Boolean Functions.
IEEE Trans. Electron. Comput., 1963

The Number of Classes of Invertible Boolean Functions.
J. ACM, 1963


  Loading...