Patrick C. Fischer

J. Comput. Syst. Sci., 1988

Nested Relations: A Step Forward - or Backward?

[BibT_eX]

Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988

1986

Nested Relational Structures.

[BibT_eX]

Stan J. Thomas

Adv. Comput. Res., 1986

High Level Data Manipulation Languages for Unnormalized Relational Database Models.

[BibT_eX]

Proceedings of the XP / 7.52 Workshop on Database Theory, 1986

Some Classes of Multilevel Relational Structures.

[BibT_eX]

[DOI]

Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

1985

Interactions between Dependencies and Nested Relational Structures.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1985

Determining when a Structure is a Nested Relation.

[BibT_eX]

[DOI]

Proceedings of the VLDB'85, 1985

Structure of Relations Satisfying Certain Families of Dependencies.

[BibT_eX]

[DOI]

Proceedings of the STACS 85, 1985

1984

Weak Multivalued Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

1983

Succinctness in Dependency Systems.

[BibT_eX]

[DOI]

Jiann H. Jou

Don-Min Tsou

Theor. Comput. Sci., 1983

Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard.

[BibT_eX]

[DOI]

Don-Min Tsou

SIAM J. Comput., 1983

1982

Decomposition of a relation scheme into Boyce-Codd Normal Form.

[BibT_eX]

[DOI]

Don-Min Tsou

SIGACT News, 1982

The Complexity of Recognizing 3NF Relation Schemes.

[BibT_eX]

[DOI]

Jiann H. Jou

Inf. Process. Lett., 1982

1980

Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations.

[BibT_eX]

[DOI]

Chandra M. R. Kintala

SIAM J. Comput., 1980

1979

Real-Time Computations with Restricted Nondeterminism.

[BibT_eX]

[DOI]

Chandra M. R. Kintala

Math. Syst. Theory, 1979

Storage Reorganization Techniques for Matrix Computation in a Paging Environment.

[BibT_eX]

[DOI]

Robert L. Probert

Commun. ACM, 1979

1977

Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract)

[BibT_eX]

[DOI]

Chandra M. R. Kintala

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976

On the Sequential Nature of Functions.

[BibT_eX]

[DOI]

Edward L. Robertson

Lawrence V. Saxton

J. Comput. Syst. Sci., 1976

A note on matrix multiplication in a paging environment.

[BibT_eX]

[DOI]

Robert L. Probert

Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

SIGACT (Paper Session).

[BibT_eX]

[DOI]

Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

1974

Predecessor Machines.

[BibT_eX]

[DOI]

John C. Warkentin

J. Comput. Syst. Sci., 1974

Efficient Procedures for Using Matrix Algorithms.

[BibT_eX]

[DOI]

Robert L. Probert

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Further Schemes for Combining Matrix Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1972

Computational Speed-Up by Effective Operators.

[BibT_eX]

[DOI]

J. Symb. Log., 1972

Real-Time Simulation of Multihead Tape Units.

[BibT_eX]

[DOI]

J. ACM, 1972

Predecessor Machines and Regressing Functions

[BibT_eX]

[DOI]

John C. Warkentin

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

Theory of computing in computer science education.

[BibT_eX]

[DOI]

Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1972 Spring Joint Computer Conference, 1972

1970

Time-Restricted Sequence Generation.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1970

1968

Counter Machines and Counter Languages.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1968

Multitape One-Way Nonwriting Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1968

The Reduction of Tape Reversals for Off-Line One-Tape Turing Machines.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1968

On Computational Speed-Up

[BibT_eX]

[DOI]

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

Tape Reversal Complexity Hierarchies

[BibT_eX]

[DOI]

Juris Hartmanis

Manuel Blum

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967

The Solvability of the Halting Problem for 2-State Post Machines.

[BibT_eX]

[DOI]

Stål Aanderaa

J. ACM, 1967

Turing Machines with a Schedule to Keep

[BibT_eX]

[DOI]

Inf. Control., 1967

Turing Machines with Several Read-Write Heads (Preliminary Report)

[BibT_eX]

[DOI]

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

Real Time Counter Machines (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966

Turing Machines with Restricted Memory Access

[BibT_eX]

[DOI]

Inf. Control., August, 1966

1965

On Formalisms for Turing Machines.

[BibT_eX]

[DOI]

J. ACM, 1965

Generation of Primes by a One-Dimensional Real-Time Iterative Array.

[BibT_eX]

[DOI]

J. ACM, 1965

Multi-tape and infinite-state automata - a survey.

[BibT_eX]

[DOI]

Commun. ACM, 1965

Translational methods and computational complexity

[BibT_eX]

[DOI]

S. S. Ruby

Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, 1965

1963

On computability by certain classes of restricted Turing machines

[BibT_eX]

[DOI]

Proceedings of the 4th Annual Symposium on Switching Circuit Theory and Logical Design, 1963

1958

Automatic propagated and round-off error analysis.

[BibT_eX]

[DOI]