Michael A. Harrison - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 70 from 70

2008

Jim Gray at BerkeleyMichael A. Harrison. SIGMOD, 37(2):26-27, 2008. [doi]

2005

In memory of Seymour Ginsburg 1928 - 2004Serge Abiteboul, Richard Hull, Victor Vianu, Sheila A. Greibach, Michael A. Harrison, Ellis Horowitz, Daniel J. Rosenkrantz, Jeffrey D. Ullman, Moshe Y. Vardi. SIGMOD, 34(1):5-12, 2005. [doi]

1997

Grendel: a Web browser with end user extensibilityBrian M. Dennis, Michael A. Harrison. compcon 1997: 74-79 [doi]

Presentation by tree transformationMichael A. Harrison, Vance Maverick. compcon 1997: 68-73 [doi]

1995

Technical Issues in Hypermedia Authoring Systems (Extended Abstract)Brian M. Dennis, Michael A. Harrison. compcon 1995: 373-378

1994

Accurate Static Estimators for Program OptimizationTim A. Wagner, Vance Maverick, Susan L. Graham, Michael A. Harrison. PLDI 1994: 85-96

1993

User Interface Management System Embedded in a Multimedia Document Editor FrameworkTakashi Ohtsu, Michael A. Harrison. fodo 1993: 35-50

1992

The Proteus presentation systemSusan L. Graham, Michael A. Harrison, Ethan V. Munson. SDE 1992: 130-138 [doi]

Proving Nonmembership in Certain Families of Context Free LanguagesMichael A. Harrison. BIRTHDAY 1992: 15-71

1991

Numbering Document ComponentsMichael A. Harrison, Ethan V. Munson. epodd, 4(1):43-60, 1991.

1988

Multiple Representation Document DevelopmentPehong Chen, Michael A. Harrison. Computer, 21(1):15-31, 1988.

Index Preparation and ProcessingPehong Chen, Michael A. Harrison. SPE, 18(9):897-915, 1988.

Incremental document formattingPehong Chen, Michael A. Harrison, Ikuo Minakata. docprocs 1988: 93-100 [doi]

On Integrated Bibliography ProcessingMichael A. Harrison, Ethan V. Munson. epodd, 2(4):193-209, 1988.

1986

An improved user environment for T::E::XPehong Chen, Michael A. Harrison, Jeffrey W. McCarrell, John Coker, Steve Procter. tex 1986: 32-44

The V::OR::T::E::X Document Preparation EnvironmentPehong Chen, John Coker, Michael A. Harrison, Jeffrey W. McCarrell, Steve Procter. tex 1986: 45-54

1985

Theoretical Issues Concerning Protection in Operating SystemsMichael A. Harrison. ac, 24:61-100, 1985.

1982

Executive Committee Position on VLDB ConferencesPeter J. Denning, Michael A. Harrison, Kathleen A. Wagner, Aaron Finerman, Daniel D. McCracken. SIGMOD, 12(3), 1982. [doi]

1981

Eliminating Null Rules in Linear TimeMichael A. Harrison, Amiram Yehudai. cj, 24(2):156-161, 1981.

1980

An Improved Context-Free RecognizerSusan L. Graham, Michael A. Harrison, Walter L. Ruzzo. TOPLAS, 2(3):415-462, 1980. [doi]

1979

On Equivalence of Grammars Through Transformation TreesMichael A. Harrison, Ivan M. Havel, Amiram Yehudai. TCS, 9:173-205, 1979.

A Hierarchy of Deterministic LanguagesMichael A. Harrison, Amiram Yehudai. jcss, 19(1):63-78, 1979.

1978

Programming and operating systems overviewMichael A. Harrison. afips 1978: 1077-1078

1977

Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, IMatthew M. Geller, Michael A. Harrison. jcss, 14(3):265-317, 1977.

On LR::::(k):::: Grammars and LanguagesMatthew M. Geller, Michael A. Harrison. TCS, 4(3):245-276, 1977.

Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, IIMatthew M. Geller, Michael A. Harrison. jcss, 14(3):318-343, 1977.

1976

1975

On Models of Protection in Operating SystemsMichael A. Harrison. mfcs 1975: 46-60

On Protection in Operating SystemMichael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman. sosp 1975: 14-24

1974

Mutually divisible semigroupsRonald V. Book, Michael A. Harrison. DM, 9(4):329-332, 1974. [doi]

Production Prefix Parsing (Extended Abstract)Matthew M. Geller, Susan L. Graham, Michael A. Harrison. icalp 1974: 232-241

On the Parsing of Deterministic LanguagesMichael A. Harrison, Ivan M. Havel. JACM, 21(4):525-548, 1974. [doi]

1973

Characterizations of LR(0) Languages (Extended Abstract)Matthew M. Geller, Michael A. Harrison. focs 1973: 103-108

Strict Deterministic Versus LR(0) ParsingMatthew M. Geller, Michael A. Harrison. POPL 1973: 22-32

Canonical Precedence SchemesJim Gray, Michael A. Harrison. JACM, 20(2):214-234, 1973. [doi]

On Covers and Precedence AnalysisMichael A. Harrison. gi 1973: 2-17

Strict Deterministic GrammarsMichael A. Harrison, Ivan M. Havel. jcss, 7(3):237-277, 1973.

On the Number of Classes of Binary MatricesMichael A. Harrison. TC, 22(12):1048-1052, 1973. [doi]

1972

On the Covering and Reduction Problems for Context-Free GrammarsJim Gray, Michael A. Harrison. JACM, 19(4):675-698, 1972. [doi]

On a Family of Deterministic Grammars (Extended Abstract)Michael A. Harrison, Ivan M. Havel. icalp 1972: 413-441

Real-Time Strict Deterministic LanguagesMichael A. Harrison, Ivan M. Havel. SICOMP, 1(4):333-349, 1972.

1971

A Grammatical Characterization of One-Way Nondeterministic Stack LanguagesMichael A. Harrison, Mario Schkolnick. JACM, 18(2):148-172, 1971. [doi]

1970

On the Closure of AFL under ReversalSeymour Ginsburg, Michael A. Harrison. iandc, 17(4):395-409, November 1970.

B70-1 Truth Functions and the Problem of Their Realization by Two-Terminal GraphsMichael A. Harrison. TC, 19(5):462, 1970. [doi]

1969

Decomposition of Linear Sequential MachinesHervé Gallaire, Michael A. Harrison. mst, 3(3):246-287, 1969.

Single Pass Precedence Analysis (Extended Abstract)Jim Gray, Michael A. Harrison. focs 1969: 106-117

1968

Infinite Linear Sequential MachinesHervé Gallaire, Jim Gray, Michael A. Harrison, Gabor T. Herman. jcss, 2(4):381-419, 1968.

On the Elimination of EndmarkersSeymour Ginsburg, Michael A. Harrison. iandc, 12(2):103-115, February 1968.

One-way nondeterministic real-time list-storage languagesSeymour Ginsburg, Michael A. Harrison. JACM, 15(3):428-446, 1968. [doi]

On Equivalence of State AssignmentsMichael A. Harrison. TC, 17(1):55-57, 1968. [doi]

Multi-Tape and Multi-Head Pushdown AutomataMichael A. Harrison, Oscar H. Ibarra. iandc, 13(5):433-470, November 1968.

1967

One-way stack automataSeymour Ginsburg, Sheila A. Greibach, Michael A. Harrison. JACM, 14(2):389-418, 1967. [doi]

Stack automata and compilingSeymour Ginsburg, Sheila A. Greibach, Michael A. Harrison. JACM, 14(1):172-201, 1967. [doi]

Bracketed Context-Free LanguagesSeymour Ginsburg, Michael A. Harrison. jcss, 1(1):1-23, 1967.

Two-Way Pushdown AutomataJim Gray, Michael A. Harrison, Oscar H. Ibarra. iandc, 11(1/2):30-70, July-August 1967.

A Remark on Determining the Number of States of a Sequential MachineMichael A. Harrison. TC, 16(5):689-690, 1967. [doi]

1966

One-Way Stack Automata (Extended Abstract)Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison. focs 1966: 47-52

The Theory of Sequential RelationsJim Gray, Michael A. Harrison. iandc, 9(5):435-468, October 1966.

On Asymptotic Estimates in Switching and Automata TheoryMichael A. Harrison. JACM, 13(1):151-157, 1966. [doi]

1965

On the Error Correcting Capacity of Finite AutomataMichael A. Harrison. iandc, 8(4):430-450, August 1965.

1964

A census of finite automata (extended summary)Michael A. Harrison. focs 1964: 44-46

A Remark on Uniform DistributionMichael A. Harrison. TC, 13(5):630-631, 1964. [doi]

1963

Algebraic Properties of Symmetric and Partially Symmetric Boolean FunctionsRichard F. Arnold, Michael A. Harrison. TC, 12(3):244-251, 1963. [doi]

The Number of Classes of Invertible Boolean FunctionsMichael A. Harrison. JACM, 10(1):25-28, 1963. [doi]

The Number of Equivalence Classes of Boolean Functions Under Groups Containing NegationMichael A. Harrison. TC, 12(5):559-561, 1963. [doi]

Sign in or sign up to see more results.

runs on WebDSL