Peter van Emde Boas

Stanley S. Wainer

Comput., 2018

2012

In Memoriam Manfred Kudlek (1940-2012).

[BibT_eX]

[DOI]

Bull. EATCS, 2012

Turing Machines for Dummies - Why Representations Do Matter.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Travelling with Dexter Kozen.

[BibT_eX]

[DOI]

Proceedings of the Logic and Program Semantics, 2012

2010

The History of the LLL-Algorithm.

[BibT_eX]

[DOI]

Proceedings of the LLL Algorithm - Survey and Applications, 2010

Playing Savitch and Cooking Games.

[BibT_eX]

[DOI]

Proceedings of the Concurrency, 2010

2007

Theory of Computation at CiE 2005.

[BibT_eX]

[DOI]

S. Barry Cooper

Benedikt Löwe

Ghica van Emde Boas-Lubsen

Theory Comput. Syst., 2007

1998

Compiling Horn-Clause Rules in IBM's Business System 12 and Early Experiment in Declarativeness.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

1994

The STO-Problem is NP-Hard.

[BibT_eX]

[DOI]

Krzysztof R. Apt

Angelo Welling

J. Symb. Comput., 1994

Information Acquisition from Multi-agent Resources.

[BibT_eX]

Zhisheng Huang

Proceedings of the 5th Conference on Theoretical Aspects of Reasoning about Knowledge, 1994

1993

A survey of the rule language RL/1.

[BibT_eX]

[DOI]

Karen L. Kwast

Zhisheng Huang

J. Comput. Sci. Technol., 1993

Twenty Questions to a P-Selector.

[BibT_eX]

[DOI]

Harry Buhrman

Inf. Process. Lett., 1993

Object Oriented Application Flow Graphs and their Semantics.

[BibT_eX]

[DOI]

Erik de Haas

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Resolution of Constraint Inconsistency with the Aim to Provide Support in Anaesthesia.

[BibT_eX]

[DOI]

Ernest Rotterdam

Pim Hennis

Proceedings of the Database and Expert Systems Applications, 4th International Conference, 1993

1992

Associative Storage Modification Machines.

[BibT_eX]

John Tromp

Proceedings of the Complexity Theory: Current Research, 1992

1991

Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1991

Symbolic computation in RL/1.

[BibT_eX]

Proceedings of the Proceedings of the International Conference on Database and Expert Systems Applications, 1991

Physiological modelling using RL.

[BibT_eX]

[DOI]

Fred de Geus

Ernest Rotterdam

Proceedings of the AIME 91, 1991

1990

The rule language RL/1.

[BibT_eX]

Proceedings of the International Conference on Database and Expert Systems Applications, 1990

Machine Models and Simulation.

[BibT_eX]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Maintaining Multiple Representations of Dynamic Data Structures

[BibT_eX]

[DOI]

Inf. Comput., November, 1989

Simplicity, Immunity, Relativizations and Nondeterminism

[BibT_eX]

[DOI]

Inf. Comput., January, 1989

Space Measures for Storage Modification Machines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Two Models for the Reconstruction Problem for Dynamic Data Structures.

[BibT_eX]

J. Inf. Process. Cybern., 1989

Nondeterminism fairness and a fundamental analogy.

[BibT_eX]

Edith Spaan

Bull. EATCS, 1989

Integrating Relational Databases and Constraint Languages.

[BibT_eX]

[DOI]

Comput. Lang., 1989

Multiple Representations of Dynamic Data Structures.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

The Problem of Space Invariance for Sequential Machines

[BibT_eX]

[DOI]

Cees F. Slot

Inf. Comput., May, 1988

1986

Two Results on Tables.

[BibT_eX]

[DOI]

C. T. M. Jacobs

Inf. Process. Lett., 1986

Storing and Evaluating Horn-Clause Rules in a Relational Database.

[BibT_eX]

[DOI]

Ghica van Emde Boas

IBM J. Res. Dev., 1986

A Semantical Model for Integration and Modularization of Rules.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Diagonalisation methods in a polynomial setting.

[BibT_eX]

[DOI]

Proceedings of the Structure in Complexity Theory, 1986

1985

On Tape Versus Core; an Application of Space Efficient Perfect Hash Functions to the Invariance of Space.

[BibT_eX]

Cees F. Slot

J. Inf. Process. Cybern., 1985

Combined Simplicity and Immunity in Relativized NP.

[BibT_eX]

[DOI]

Proceedings of the STACS 85, 1985

Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem.

[BibT_eX]

[DOI]

Job Zwiers

Willem P. de Roever

Proceedings of the Automata, 1985

1983

The Reconstruction and Optimization of Trie Hashing Functions.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Very Large Data Bases, October 31, 1983

1982

A Note on 'Master Keys for Group Sharing'.

[BibT_eX]

[DOI]

Andries E. Brouwer

Inf. Process. Lett., 1982

1981

Some Observations on Compositional Semantics.

[BibT_eX]

[DOI]

Theo M. V. Janssen

Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

1980

On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

1979

Move Rules and Trade-Offs in the Pebble Game.

[BibT_eX]

[DOI]

Jan van Leeuwen

Proceedings of the Theoretical Computer Science, 1979

Complexity of linear problems.

[BibT_eX]

Proceedings of the Fundamentals of Computation Theory, 1979

1978

Some Applications of the McCreight-Meyer Algorithm in Abstract Complexity Theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

A note on the recursive enumerability of some classes of recursively enumerable languages.

[BibT_eX]

[DOI]

Paul M. B. Vitányi

Inf. Sci., 1978

The Connection between Modal Logic and Algorithmic Logic.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977

Design and Implementation of an Efficient Priority Queue.

[BibT_eX]

[DOI]

R. Kaas

E. Zijlstra

Math. Syst. Theory, 1977

Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1977

The Expressive Power of Intensional Logic in the Semantics of Programming Languages.

[BibT_eX]

[DOI]

Theo M. V. Janssen

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

On the Proper Treatment or Referencing, Dereferencing and Assignment.

[BibT_eX]

[DOI]

Theo M. V. Janssen

Proceedings of the Automata, 1977

1975

The non-renameability of honesty classes.

[BibT_eX]

[DOI]

Computing, 1975

Ten Years of Speedup.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

Preserving Order in a Forest in less than Logarithmic Time

[BibT_eX]

[DOI]

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1972

A Comparison of the Properties of Complexity Classes and Honesty Classes.

[BibT_eX]