Patrick C. Fischer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 47 from 47

1988

Nested Relations: A Step Forward - or Backward?Patrick C. Fischer. SIGMOD 1988: 2 [doi]

Multilevel Nested Relational StructuresDirk Van Gucht, Patrick C. Fischer. jcss, 36(1):77-105, 1988.

1986

Some Classes of Multilevel Relational StructuresDirk Van Gucht, Patrick C. Fischer. PODS 1986: 60-69 [doi]

High Level Data Manipulation Languages for Unnormalized Relational Database ModelsDirk Van Gucht, Patrick C. Fischer. xp 1986: [doi]

Nested Relational StructuresStan J. Thomas, Patrick C. Fischer. acr, 3:269-307, 1986.

1985

Structure of Relations Satisfying Certain Families of DependenciesPatrick C. Fischer, Dirk Van Gucht. STACS 1985: 131-142

Interactions between Dependencies and Nested Relational StructuresPatrick C. Fischer, Lawrence V. Saxton, Stan J. Thomas, Dirk Van Gucht. jcss, 31(3):343-354, 1985.

Determining when a Structure is a Nested RelationPatrick C. Fischer, Dirk Van Gucht. VLDB 1985: 171-180 [doi]

1984

Weak Multivalued DependenciesPatrick C. Fischer, Dirk Van Gucht. PODS 1984: 266-274 [doi]

1983

Succinctness in Dependency SystemsPatrick C. Fischer, Jiann H. Jou, Don-Min Tsou. TCS, 24:323-329, 1983.

Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-HardPatrick C. Fischer, Don-Min Tsou. SICOMP, 12(2):259-266, 1983.

1982

The Complexity of Recognizing 3NF Relation SchemesJiann H. Jou, Patrick C. Fischer. ipl, 14(4):187-190, 1982.

Decomposition of a relation scheme into Boyce-Codd Normal FormDon-Min Tsou, Patrick C. Fischer. sigact, 14(3):23-29, 1982. [doi]

1981

Succinctness in Dependency SystemsPatrick C. Fischer, Jiann H. Jou, Don-Min Tsou. xp 1981:

1980

Refining Nondeterminism in Relativized Polynomial-Time Bounded ComputationsChandra M. R. Kintala, Patrick C. Fischer. SICOMP, 9(1):46-53, 1980.

Decomposition of a relation scheme into Boyce-Codd Normal FormDon-Min Tsou, Patrick C. Fischer. acm 1980: 411-417 [doi]

1979

Real-Time Computations with Restricted NondeterminismPatrick C. Fischer, Chandra M. R. Kintala. mst, 12:219-231, 1979.

Storage Reorganization Techniques for Matrix Computation in a Paging EnvironmentPatrick C. Fischer, Robert L. Probert. CACM, 22(7):405-415, 1979.

1977

Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract)Chandra M. R. Kintala, Patrick C. Fischer. stoc 1977: 178-185

1976

On the Sequential Nature of FunctionsPatrick C. Fischer, Edward L. Robertson, Lawrence V. Saxton. jcss, 13(1):51-68, 1976.

A note on matrix multiplication in a paging environmentPatrick C. Fischer, Robert L. Probert. acm 1976: 17-21 [doi]

SIGACT (Paper Session)Patrick C. Fischer, George T. Ligler, William C. Nylin Jr., Patrick Wang, Patrick C. Fischer, Robert L. Probert. acm 1976: 1 [doi]

1974

Predecessor MachinesPatrick C. Fischer, John C. Warkentin. jcss, 8(2):190-219, 1974.

Efficient Procedures for Using Matrix AlgorithmsPatrick C. Fischer, Robert L. Probert. icalp 1974: 413-427

Further Schemes for Combining Matrix AlgorithmsPatrick C. Fischer. icalp 1974: 428-436

1972

Real-Time Simulation of Multihead Tape UnitsPatrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg. JACM, 19(4):590-607, 1972. [doi]

Theory of computing in computer science educationPatrick C. Fischer. afips 1972: 857-864 [doi]

Computational Speed-Up by Effective OperatorsAlbert R. Meyer, Patrick C. Fischer. JSYML, 37(1):55-68, 1972.

Predecessor Machines and Regressing FunctionsJohn C. Warkentin, Patrick C. Fischer. stoc 1972: 81-87

1970

Time-Restricted Sequence GenerationPatrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg. jcss, 4(1):50-73, 1970.

1968

The Reduction of Tape Reversals for Off-Line One-Tape Turing MachinesPatrick C. Fischer. jcss, 2(2):136-147, 1968.

Tape Reversal Complexity HierarchiesPatrick C. Fischer, Juris Hartmanis, Manuel Blum. focs 1968: 373-382

Counter Machines and Counter LanguagesPatrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg. mst, 2(3):265-283, 1968.

Multitape One-Way Nonwriting AutomataPatrick C. Fischer, Arnold L. Rosenberg. jcss, 2(1):88-101, 1968.

On Computational Speed-UpAlbert R. Meyer, Patrick C. Fischer. focs 1968: 351-355

1967

The Solvability of the Halting Problem for 2-State Post MachinesStål Aanderaa, Patrick C. Fischer. JACM, 14(4):677-682, 1967. [doi]

Turing Machines with a Schedule to KeepPatrick C. Fischer. iandc, 11(1/2):138-146, July-August 1967.

Real Time Counter Machines (Preliminary Version)Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg. focs 1967: 148-154

Turing Machines with Several Read-Write Heads (Preliminary Report)Albert R. Meyer, Arnold L. Rosenberg, Patrick C. Fischer. focs 1967: 117-127

1966

Turing Machines with Restricted Memory AccessPatrick C. Fischer. iandc, 9(4):364-379, August 1966.

1965

Multi-tape and infinite-state automata - a surveyPatrick C. Fischer. CACM, 8(12):799-805, 1965. [doi]

On Formalisms for Turing MachinesPatrick C. Fischer. JACM, 12(4):570-580, 1965. [doi]

Generation of Primes by a One-Dimensional Real-Time Iterative ArrayPatrick C. Fischer. JACM, 12(3):388-394, 1965. [doi]

Translational methods and computational complexityS. S. Ruby, Patrick C. Fischer. focs 1965: 173-178

1964

On formalisms for Turing machinesPatrick C. Fischer. focs 1964: 68-75

1963

On computability by certain classes of restricted Turing machinesPatrick C. Fischer. focs 1963: 23-32

1958

Automatic propagated and round-off error analysisPatrick C. Fischer. acm 1958: [doi]

Sign in or sign up to see more results.

runs on WebDSL