Jan van Leeuwen

Proceedings of the Advances in Artificial Life, 6th European Conference, 2001

2000

lambda-Coloring of Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

On Algorithms and Interaction.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

On the Power of Interactive Computing.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

1998

The Complexity of Interval Routing on Random Graphs.

[BibT_eX]

[DOI]

Michele Flammini

Alberto Marchetti-Spaccamela

Comput. J., 1998

1997

On Interval Routing Schemes and Treewidth.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Inf. Comput., 1997

1994

Compact Routing Methods: A Survey.

[BibT_eX]

Proceedings of the Structural Information and Communication Complexity, 1994

1993

Uniform <i>d</i>-emulations of rings, with an application to distributed virtual ring construction.

[BibT_eX]

[DOI]

Erwin M. Bakker

Networks, 1993

Maintenance of 2- and 3-edge- connected components of graphs I.

[BibT_eX]

[DOI]

Johannes A. La Poutré

Discret. Math., 1993

Prefix Routing Schemes in Dynamic Networks.

[BibT_eX]

[DOI]

Erwin M. Bakker

Comput. Networks ISDN Syst., 1993

Interval Heaps.

[BibT_eX]

[DOI]

Comput. J., 1993

1992

Parallel computing.

[BibT_eX]

[DOI]

Emile H. L. Aarts

Martin Rem

Future Gener. Comput. Syst., 1992

1991

On Models for Propositional Dynamic Logic.

[BibT_eX]

[DOI]

Peter M. W. Knijnenburg

Theor. Comput. Sci., 1991

1990

On special multiples of integers.

[BibT_eX]

Goos Kant

Bull. EATCS, 1990

Computational complexity of norm-maximization.

[BibT_eX]

[DOI]

Comb., 1990

The File Distribution Problem for Processor Networks.

[BibT_eX]

[DOI]

Goos Kant

Proceedings of the SWAT 90, 1990

Graph Algorithms.

[BibT_eX]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Efficient Elections in Chordal Ring Networks.

[BibT_eX]

[DOI]

Algorithmica, 1989

Structured NC.

[BibT_eX]

[DOI]

Bertha Scholten

Proceedings of the Algorithms and Data Structures, 1989

1988

Fast Simulation of Turing Machines by Random Access Machines.

[BibT_eX]

[DOI]

Jyrki Katajainen

Martti Penttonen

SIAM J. Comput., 1988

The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols.

[BibT_eX]

[DOI]

Gerard Tel

Sci. Comput. Program., 1988

On Estimating the Complexity of Logarithmic Decompositions.

[BibT_eX]

[DOI]

Marc Bezem

Inf. Process. Lett., 1988

Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases.

[BibT_eX]

[DOI]

Nicolien J. Drost

Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

1987

On Linear Skewing Schemes and d-Ordered Vectors.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1987

Diameter increase caused by edge deletion.

[BibT_eX]

[DOI]

Anneke A. Schoone

J. Graph Theory, 1987

A non-deterministic algorithm and its analysis.

[BibT_eX]

Gerard Tel

Bull. EATCS, 1987

An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors.

[BibT_eX]

[DOI]

Distributed Comput., 1987

Interval Routing.

[BibT_eX]

[DOI]

Comput. J., 1987

Array Processing Machines: An Abstract Model.

[BibT_eX]

[DOI]

BIT, 1987

Maintenance of Transitive Closures and Transitive Reductions of Graphs.

[BibT_eX]

[DOI]

Johannes A. La Poutré

Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols.

[BibT_eX]

[DOI]

Gerard Tel

Proceedings of the STACS 87, 1987

Guessing Games and Distributed Computations in Synchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Simulation of Large Networks on Smaller Networks

[BibT_eX]

[DOI]

Inf. Control., December, 1986

Improved Diameter Bounds for Altered Graphs.

[BibT_eX]

[DOI]

Anneke A. Schoone

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors.

[BibT_eX]

[DOI]

Proceedings of the STACS 86, 1986

Pragmatic Aspects of Complexity Theory (Panel).

[BibT_eX]

Proceedings of the Information Processing 86, 1986

1985

The Structure of Periodic Storage Schemes for Parallel Memories.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1985

Preface

[BibT_eX]

[DOI]

Marek Karpinski

Inf. Control., 1985

Array processing machines.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino

[BibT_eX]

[DOI]

Inf. Control., July, 1984

Worst-case Analysis of Set Union Algorithms.

[BibT_eX]

[DOI]

Robert Endre Tarjan

J. ACM, 1984

Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1984

Systolische Berechnungen und VLSI.

[BibT_eX]

Mark R. Kramer

Inform. Spektrum, 1984

1983

Periodic versus arbitrary tessellations of the plane using polyominos of a single type.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1983

The VLSI complexity of Boolean functions.

[BibT_eX]

[DOI]

Mark R. Kramer

Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

Data Mappings in Large Parallel Computers.

[BibT_eX]

[DOI]

Proceedings of the GI - 13. Jahrestagung, Hamburg, 3.-7. Oktober 1983, Proceedings, 1983

1982

Efficient Recognition of Rational Relations.

[BibT_eX]

[DOI]

Maurice Nivat

Inf. Process. Lett., 1982

Dynamic Multi-Dimensional Data Structures Based on Quad- and <i> K - D </i> Trees.

[BibT_eX]

[DOI]

Acta Informatica, 1982

Stratified Balanced Search Trees.

[BibT_eX]

[DOI]

Acta Informatica, 1982

1981

Maintenance of Configurations in the Plane.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

The Measure Problem for Rectangular Ranges in d-Space.

[BibT_eX]

[DOI]

J. Algorithms, 1981

Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Some Principles for Dynamizing Decomposable Searching Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Two general methods for dynamizing decomposable searching problems.

[BibT_eX]

[DOI]

Computing, 1981

The complexity of basic complex operations.

[BibT_eX]

[DOI]

Helmut Alt

Computing, 1981

Untangling a Travelling Salesman Tour in the Plane.

[BibT_eX]

Anneke A. Schoone

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

The Art of Dynamizing.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

Stack Machines and Classes of Nonnested Macro Languages.

[BibT_eX]

[DOI]

Joost Engelfriet

Erik Meineche Schmidt

J. ACM, 1980

Further Comments on Bykat's Convex Hull Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

Dynamization of Decomposable Searching Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

Über Programmeffizienz und algebraische Komplexität.

[BibT_eX]

Inform. Spektrum, 1980

Dynamically Maintaining Configurations in the Plane (Detailed Abstract)

[BibT_eX]

[DOI]

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

On the Complexity of Decision Trees, the Quasi-Optimizer, and the Power of Heuristic rules

[BibT_eX]

[DOI]

Nicholas V. Findler

Inf. Control., January, 1979

A Family of Similarity Measures Between Two Strings.

[BibT_eX]

[DOI]

Nicholas V. Findler

IEEE Trans. Pattern Anal. Mach. Intell., 1979

On Compromising Statistical Data-Bases with a few Known Elements.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

A Useful Lemma for Context-Free Programmed Grammars.

[BibT_eX]

[DOI]

Acta Informatica, 1979

Move Rules and Trade-Offs in the Pebble Game.

[BibT_eX]

[DOI]

Peter van Emde Boas

Proceedings of the Theoretical Computer Science, 1979

The complexity of complex division (extended abstract).

[BibT_eX]

Helmut Alt

Proceedings of the Fundamentals of Computation Theory, 1979

1978

Evaluating a polynomial and its reverse.

[BibT_eX]

[DOI]

SIGACT News, 1978

Effective constructions in well-partially- ordered free monoids.

[BibT_eX]

[DOI]

Discret. Math., 1978

1976

A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

A regularity condition for parallel rewriting systems.

[BibT_eX]

[DOI]

SIGACT News, 1976

The Halting Problem for Linear Turing Assemblers.

[BibT_eX]

[DOI]

Robert M. Baer

J. Comput. Syst. Sci., 1976

The Complexity of Vector-Products.

[BibT_eX]

[DOI]

David P. Dobkin

Inf. Process. Lett., 1976

On the Construction of Huffman Trees.

[BibT_eX]

Proceedings of the Third International Colloquium on Automata, 1976

Variations of a New Machine Model

[BibT_eX]

[DOI]

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975

An improved bound on the number of multiplications and divisions necessary to evaluate a polynomial and all its derivatives.

[BibT_eX]

[DOI]

Lieuwe de Jong

SIGACT News, 1975

The Tape-Complexity of Context-Independent Developmental Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1975

The Membership Question for ET0L-Languages is Polynomially Complete.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1975

A Study of Complexity in Hyper-Algebraic Families.

[BibT_eX]

Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974

Microprogrammed random access stored program machines.

[BibT_eX]

[DOI]

Carl H. Smith

SIGACT News, 1974

A forgotten connection between tag-systems and parallel-rewriting.

[BibT_eX]

[DOI]