David E. Muller - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

1995

Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and SafraDavid E. Muller, Paul E. Schupp. TCS, 141(1&2):69-107, 1995. [doi]

1992

Parallel Restructuring and Evaluation of ExpressionsDavid E. Muller, Franco P. Preparata. jcss, 44(1):43-62, 1992.

Alternating Automata, the Weak Monadic Theory of Trees and its ComplexityDavid E. Muller, Ahmed Saoudi, Paul E. Schupp. TCS, 97(2):233-244, 1992.

On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order TheoryDavid E. Muller, Paul E. Schupp, Ahmed Saoudi. icci 1992: 2-5

Finite State Processes, Z-Temporal Logic and the Monadic Theory of the IntegersAhmed Saoudi, David E. Muller, Paul E. Schupp. ijfcs, 3(3):233-244, 1992.

1990

On the Complexity of omega-Tree Sets and Nerode TheoremAhmed Saoudi, David E. Muller, Paul E. Schupp. ijfcs, 1(1):11-22, 1990.

1988

Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential TimeDavid E. Muller, Ahmed Saoudi, Paul E. Schupp. lics 1988: 422-427

1987

Alternating Automata on Infinite TreesDavid E. Muller, Paul E. Schupp. TCS, 54:267-276, 1987.

Toward a switching theory of CMOS circuitsDavid E. Muller, Franco P. Preparata. fjcc 1987: 347-348 [doi]

1986

Alternating Automata. The Weak Monadic Theory of the Tree, and its ComplexityDavid E. Muller, Ahmed Saoudi, Paul E. Schupp. icalp 1986: 275-283

1985

The Theory of Ends, Pushdown Automata, and Second-Order LogicDavid E. Muller, Paul E. Schupp. TCS, 37:51-75, 1985.

1984

Alternating automata on infinite objects, determinacy and Rabin s theoremDavid E. Muller, Paul E. Schupp. litp 1985: 100-107

1983

Groups, the Theory of Ends, and Context-Free LanguagesDavid E. Muller, Paul E. Schupp. jcss, 26(3):295-310, 1983.

1981

Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability ProblemsDavid E. Muller, Paul E. Schupp. stoc 1981: 46-54

1979

Finding the Intersection of n Half-Spaces in Time O(n log n)Franco P. Preparata, David E. Muller. TCS, 8:45-55, 1979.

1978

Finding the Intersection of two Convex PolyhedraDavid E. Muller, Franco P. Preparata. TCS, 7:217-236, 1978.

1977

Reduction of Depth of Boolean Networks with a Fan-In ConstraintFranco P. Preparata, David E. Muller, Amnon Barak. TC, 26(5):474-479, 1977.

1976

Restructuring of Arithmetic Expressions For Parallel EvaluationDavid E. Muller, Franco P. Preparata. JACM, 23(3):534-543, 1976. [doi]

1975

Bounds to Complexities of Networks for Sorting and for SwitchingDavid E. Muller, Franco P. Preparata. JACM, 22(2):195-201, 1975. [doi]

The Time Required to Evaluate Division-Free Arithmetic ExpressionsFranco P. Preparata, David E. Muller. ipl, 3(5):144-146, 1975.

1972

A Generalization of the Theory of Incompletely Specified MachinesDavid E. Muller, Raymond E. Miller. jcss, 6(5):419-447, 1972.

1971

On the Delay Required to Realize Boolean FunctionsFranco P. Preparata, David E. Muller. TC, 20(4):459-461, 1971. [doi]

1970

Connectivity and Reversibility in AutomataZamir Bavel, David E. Muller. JACM, 17(2):231-240, 1970. [doi]

Generation of Near-Optimal Universal Boolean FunctionsFranco P. Preparata, David E. Muller. jcss, 4(2):93-102, 1970.

1968

Frequency of Decomposability among Machines with a Large Number of StatesDavid E. Muller, Gianfranco R. Putzolu. jcss, 2(3):219-227, 1968.

Use of Multiple Index Matrices in Generalized Automata TheoryDavid E. Muller. focs 1968: 395-404

1967

The General Synthesis Problem for Asynchronous Digital NetworksDavid E. Muller. focs 1967: 71-82

1965

Reversibility in monadic algebras and automataZamir Bavel, David E. Muller. focs 1965: 242-247

1964

The place of logical design and switching theory in the computer curriculumDavid E. Muller. CACM, 7(4):222-225, 1964. [doi]

1963

Infinite sequences and finite machinesDavid E. Muller. focs 1963: 3-16

1960

A Method for Factoring the Action of Asynchronous CircuitsW. D. Frazer, David E. Muller. focs 1961: 246-249

1959

Treatment of transition signals in electronic switching circuits by algebraic methodsDavid E. Muller. TC, 8(3):401, 1959. [doi]

1956

Complexity in Electronic Switching CircuitsDavid E. Muller. TC, 5(1):15-19, 1956. [doi]

1954

Application of Boolean algebra to switching circuit design and to error detectionDavid E. Muller. TC, 3(3):6-12, 1954. [doi]

Sign in or sign up to see more results.

runs on WebDSL