ILLC Publications, Computation and Complexity Theory (CT) Series

These reports are also available from the UvA/DARE server: the page corresponding to the listing below can be found here.

CT-1998-07:
Frans Voorbraak Optimising and Satisficing under Partial Ignorance.
1.Full Text, 2.Abstract.
CT-1998-06:
Jan van Eijck Programming with Dynamic Predicate Logic.
1.Full Text, 2.Abstract.
CT-1998-05:
Carlos Areces, Maarten de Rijke Expressiveness Revisited.
1.Full Text, 2.Abstract.
CT-1998-04:
Ghica van Emde Boas-Lubsen, Peter van Emde Boas Compiling Horn-Clause Rules in IBM's Business System 12 - an Early Experiment in Declarativeness.
1.Full Text, 2.Abstract.
CT-1998-03:
Johan van Benthem Temporal Patterns and Modal Structure.
1.Full Text (PDF), 2.Full Text (PS), 3.Abstract.
CT-1998-02:
Renata Wassermann On Structured Belief Bases - Preliminary Report.
1.Full Text, 2.Abstract.
CT-1998-01:
Hans de Nivelle Resolution Decides the Guarded Fragment.
1.Full Text, 2.Abstract.
CT-1997-04:
Andrei Muchnik, Andrei Romashchenko, Alexander Shen, Nikolai Vereshagin Upper Semi-Lattice of Binary Strings with the Relation ``$x$ is simple conditional to $y$''.
1.Full Text, 2.Abstract.
CT-1997-03:
Harry Buhrman, Dieter van Melkebeek Complete Sets under Non-Adaptive Reductions are Scarce.
1.Full Text, 2.Abstract.
CT-1997-02:
Peter van Emde Boas Resistance is Futile; Formal Linguistic Observations on Design Patterns.
1.Full Text, 2.Abstract.
CT-1997-01:
Carl H. Smith, R\={u}si\c{n}\u{s} Freivalds Catagory, Measure, Inductive Inference: A Triality Theorem and its Applications.
1.Full Text, 2.Abstract.
CT-1996-02:
A.S. Troelstra From Constructivism to Computer Science.
1.Full Text, 2.Abstract.
CT-1996-01:
Peter van Emde Boas The Convenience of Tilings.
1.Full Text, 2.Abstract.
CT-1995-07:
Frans Voorbraak Combining Unreliable Pieces of Evidence.
1.Full Text, 2.Abstract.
CT-1995-06:
Krzysztof Apt, Rachel Ben-Eliyahu Meta-variables in Logic Programming, or the Praise of Ambivalent Syntax.
1.Full Text.
CT-1995-05:
Joeri Engelfriet Minimal Temporal Epistemic Logic.
1.Full Text.
CT-1995-04:
Paul Vitányi Randomness.
1.Full Text, 2.Abstract.
CT-1995-03:
Krzysztof Apt, Ingrid Luitjes Verification of Logic Programs with Delay Declarations.
1.Full Text, 2.Abstract.
CT-1995-02:
Leen Torenvliet, Marten Trautwein A Note on the Complexity of Restricted Attribute-Value Grammars.
1.Full Text, 2.Abstract.
CT-1995-01:
Marianne Kalsbeek, Yuejun Jiang A Vademecum of Ambivalent Logic.
1.Full Text.
CT-1994-14:
Henkjan Honing The Vibrato Problem. Comparing two Ways to Describe the Intraction between the Continuous Knowledge and Discrete Components in Music Representation Systems.
1.Full Text, 2.Abstract.
CT-1994-13:
Peter Desain, Henkjan Honing CLOSe to the edge? Advanced Object-Oriented Techniques in the Representation of Musical Knowledge.
1.Full Text, 2.Abstract.
CT-1994-12:
Marianne Kalsbeek Gentzen Systems for Logic Programming Styles.
1.Full Text.
CT-1994-11:
Natasha Alechina Logic with Probabilistic Operators.
1.Full Text.
CT-1994-10:
Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan A. Terwijn Genericity and Measure for Exponential Time.
1.Full Text, 2.Abstract.
CT-1994-09:
Klaus Ambos-Spies, Sebastiaan A. Terwijn, Zheng Xizhong Resource Bounded Randomness and Weakly Complete Problems.
1.Full Text, 2.Abstract.
CT-1994-08:
Krzysztof R. Apt, Peter van Emde Boas, Angelo Welling The STO-problem is NP-hard.
1.Full Text.
CT-1994-07:
Charles H. Bennett, Péter Gács, Ming Li, Paul M.B. Vitányi, Wojciech H. Zurek Thermodynamics of Computation and Information Distance.
1.Full Text.
CT-1994-06:
Guido te Brake, Joost N. Kok, Paul Vitányi Model Selection for Neural Networks: Comparing MDL and NIC.
1.Full Text.
CT-1994-05:
Tao Jiang, Joel I. Seiferas, Paul M.B. Vitányi Two heads are Better than Two Tapes.
1.Full Text.
CT-1994-04:
Ming Lee, Paul Vitányi Inductive Reasoning.
1.Full Text.
CT-1994-03:
Ming Lee, John Tromp, Paul Vitányi Sharpening Occam's Razor (extended abstract).
1.Full Text.
CT-1994-02:
Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul Vitányi Randomized Wait-Free Distributed Naming.
1.Full Text.
CT-1994-01:
Harry Buhrman, Leen Torenvliet On the Cutting Edge of Relativization: the Resource Bounded Injury Method.
1.Full Text.
CT-1993-07:
Janusz A. Pomykala Approximation, Similarity and Rough Constructions, Part I. Elementary Introduction.
1.Full Text.
CT-1993-06:
Krzysztof R. Apt Declarative programming in Prolog.
1.Full Text.
CT-1993-05:
Erik Aarts Proving Theorems of the Lambek Calculus of Order 2 in Polynomial Time.
1.Full Text.
CT-1993-04:
Karen L. Kwast, Sieger van Denneheuvel The Meaning of Duplicates in the Relational Database Model.
1.Full Text.
CT-1993-03:
Johan van Benthem, Jan Bergstra Logic of Transition Systems.
1.Full Text.
CT-1993-02:
Sophie Fischer A Note on the Complexity of Local Search Problems.
1.Full Text.
CT-1993-01:
Marianne Kalsbeek The Vanilla Meta-Interpreter for Definite Logic Programs and Ambivalent Syntax.
1.Full Text.
CT-1992-03:
Krzysztof R. Apt, Kees Doets A new Definition of SLDNF-resolution.
1.Full Text.
CT-1992-02:
Karen L. Kwast, Sieger van Denneheuvel Weak Equivalence: Theory and Applications.
1.Full Text.
CT-1992-01:
Erik de Haas, Peter van Emde Boas Object Oriented Application Flow Graphs and their Semantics (superseded by X-1992-05).
1.Full Text.
CT-1991-12:
Krzysztof R. Apt, Dino Pedreschi Reasoning about Termination of Prolog Programs.
1.Full Text.
CT-1991-11:
Lane A. Hemachandra, Edith Spaan Quasi-Injective Reductions.
1.Full Text.
CT-1991-10:
John Tromp, Paul Vitányi A Randomized Algorithm for Two-Process Wait-Free Test-and-Set.
1.Full Text.
CT-1991-09:
Ming Li, Paul M.B. Vitányi Combinatorial Properties of Finite Sequences with high Kolmogorov Complexity.
1.Full Text.
CT-1991-08:
Kees Doets Levationis Laus.
1.Full Text.
CT-1991-07:
Karen L. Kwast The Incomplete Database.
1.Full Text.
CT-1991-06:
Edith Spaan Census Techniques on Relativized Space Classes.
1.Full Text.
CT-1991-05:
Sieger van Denneheuvel, Karen Kwast Weak Equivalence for Constraint Sets.
1.Full Text.
CT-1991-04:
Sieger van Denneheuvel, Karen Kwast Weak Equivalence.
1.Full Text.
CT-1991-03:
Ming Li, Paul M.B. Vitányi Average Case Complexity under the Universal Distribution Equals Worst Case Complexity.
1.Full Text.
CT-1991-02:
Ming Li, John Tromp, Paul M.B. Vitányi How to Share Concurrent Wait-Free Variables.
1.Full Text.
CT-1991-01:
Ming Li, Paul M.B. Vitányi Kolmogorov Complexity Arguments in Combinatorics.
1.Full Text.
CT-1990-09:
Roel de Vrijer Unique Normal Forms for Combinatory Logic with Parallel Conditional, a case study in Conditional Rewriting.
1.Full Text.
CT-1990-08:
Fred de Geus, Ernest Rotterdam, Sieger van Denneheuvel, Peter van Emde Boas Physiological Modelling using RL.
1.Full Text.
CT-1990-07:
Kees Doets Greatest Fixed Points of Logic Programs.
1.Full Text.
CT-1990-06:
Michiel Smid, Peter van Emde Boas Dynamic Data Structures on Multiple Storage Media, a Tutorial.
1.Full Text.
CT-1990-05:
Sieger van Denneheuvel, Karen Kwast Efficient Normalization of Database and Constraint Expressions.
1.Full Text.
CT-1990-04:
Harry Buhrman, Edith Spaan, Leen Torenvliet Bounded Reductions.
1.Full Text.
CT-1990-03:
Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar Generalized Kolmogorov Complexity in Relativized Separations.
1.Full Text.
CT-1990-02:
Sieger van Denneheuvel, Gerard R. Renardel de Lavalette A Normal Form for PCSJ Expressions.
1.Full Text.
CT-1990-01:
John Tromp, Peter van Emde Boas Associative Storage Modification Machines.
1.Full Text.
CT-1989-11:
Zhisheng Huang, Sieger van Denneheuvel, Peter van Emde Boas Towards Functional Classification of Recursive Query Processing.
1.Full Text.
CT-1989-10:
Sieger van Denneheuvel The Rule Language RL/1.
1.Full Text.
CT-1989-09:
Harry Buhrman, Edith Spaan, Leen Torenvliet On Adaptive Resource Bounded Computations.
1.Full Text.
CT-1989-08:
Harry Buhrman, Steven Homer, Leen Torenvliet Honest Reductions, Completeness and Nondeterministic Complexity Classes.
1.Full Text.
CT-1989-07:
Ming Li, Paul M.B. Vitanyi A Theory of Learning Simple Concepts under Simple Distributinos and Average Case Complexity for the Universal Distribution (Prel. Version).
1.Full Text.
CT-1989-06:
H.W. Lenstra Jr. Finding Isomorphisms between Finite Fields.
1.Full Text.
CT-1989-05:
Pieter H. Hartel, Michiel H.M. Smid, Leen Torenvliet, Willem G. Vree A Parallel Functional Implementation of Range Queries.
1.Full Text.
CT-1989-04:
Harry Buhrman, Leen Torenvliet A Comparison of Reductions on Nondeterministic Space.
1.Full Text.
CT-1989-03:
Ming Li, Herman Neuféglise, Leen Torenvliet, Peter van Emde Boas On Space Efficient Simulation.
1.Full Text.
CT-1989-02:
Peter van Emde Boas Machine Models and Simulations.
1.Full Text.
CT-1989-01:
Michiel H.M. Smid Dynamic Deferred Data Structures.
1.Full Text.
CT-1988-11:
Siger van Denneheuvel, Peter van Emde Boas Towards implementing RL.
1.Full Text.
CT-1988-10:
Edith Spaan, Leen Torenvliet, Peter van Emde Boas Nondeterminism, Fairness and a Fundamental Analogy.
1.Full Text.
CT-1988-09:
Theo M.V. Janssen Towards a Universal Parsing Algorithm for Functional Grammar.
1.Full Text.
CT-1988-08:
Michiel H.M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas Multiple Representations of Dynamic Data Structures.
1.Full Text.
CT-1988-07:
Johan van Benthem Time, Logic and Computation.
1.Full Text.
CT-1988-06:
Michiel H.M. Smid A Data Structure for the Union-find Problem having good Single-Operation Complexity.
1.Full Text.
CT-1988-05:
Peter van Emde Boas Machine Models and Simulations (revised version).
1.Full Text.
CT-1988-04:
Dick de Jongh, Lex Hendriks, Gerard R. Renardel de Lavalette Computations in Fragments of Intuitionistic Propositional Logic.
1.Full Text.
CT-1988-03:
Michiel H.M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas Maintaining Multiple Representations of Dynamic Data Structures.
1.Full Text.
CT-1988-02:
Michiel H.M. Smid General Lower Bounds for the Partitioning of Range Trees.
1.Full Text.
CT-1988-01:
Ming Li, Paul M.B. Vitanyi Two Decades of Applied Kolmogorov Complexity.
1.Full Text.

The websites of the UvA make use of cookiesThis site uses cookies More informationMore info Hide this message XHide X