Sign in
Theoretical Computer Science
1977
1979
1981
1983
1977
1983
Keyphrases
Publications
1983
Tobias Nipkow
,
Gerhard Weikum
A decidability result about sufficient-completeness of axiomatically specified abstract data types.
Theoretical Computer Science
(1983)
Athanasios K. Tsakalidis
Maintaining order in a generalized linked list.
Theoretical Computer Science
(1983)
Anton Nijholt
,
Jan Pittl
A general scheme for some deterministically parsable grammars and their strong equivalents.
Theoretical Computer Science
(1983)
Axel Poigné
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.
Theoretical Computer Science
(1983)
Christoph Kreitz
,
Klaus Weihrauch
Complexity theory on real numbers and functions.
Theoretical Computer Science
(1983)
Gerhard Barth
Interprocedural data flow systems.
Theoretical Computer Science
(1983)
Ronald V. Book
,
Timothy J. Long
,
Alan L. Selman
Controlled relativizations of P and NP.
Theoretical Computer Science
(1983)
Claus-Peter Schnorr
Monte-Carlo factoring algorithm with finite storage.
Theoretical Computer Science
(1983)
Françoise Gire
Une extension aux mots infinis de la notion de transduction rationelle.
Theoretical Computer Science
(1983)
Franz-Josef Brandenburg
The computational complexity of certain graph grammars.
Theoretical Computer Science
(1983)
Christos H. Papadimitriou
,
Stathis Zachos
Two remarks on the power of counting.
Theoretical Computer Science
(1983)
Johann A. Makowsky
,
Bernd Mahr
An axiomatic approach to semantics of specification languages.
Theoretical Computer Science
(1983)
Robert L. Constable
Partial functions in constructive formal theories.
Theoretical Computer Science
(1983)
Harry A. G. Wijshoff
,
Jan van Leeuwen
Periodic versus arbitrary tessellations of the plane using polyominos of a single type.
Theoretical Computer Science
(1983)
Eike Best
,
Agathe Merceron
Discreteness, k-density and d-continuity of occurrence nets.
Theoretical Computer Science
(1983)
Friedhelm Meyer auf der Heide
Efficiency of universal parallel computers.
Theoretical Computer Science
(1983)
R. Kemp
The expected number of nodes and leaves at level k in ordered trees.
Theoretical Computer Science
(1983)
Bernd Becker
On the crossing-free, rectangular embedding of weighted graphs in the plane.
Theoretical Computer Science
(1983)
Andrzej Lingas
Heuristics for minimum edge length rectangular partitions of rectilinear figures.
Theoretical Computer Science
(1983)
Géraud Sénizergues
The equivalence problem for N.T.S. languages is decidable.
Theoretical Computer Science
(1983)
Patrice Séébold
Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.
Theoretical Computer Science
(1983)
Andreas Eick
,
Elfriede Fehr
Inconsistencies of pure LISP.
Theoretical Computer Science
(1983)
Jean-Eric Pin
,
Jacques Sakarovitch
Some operations and transductions that preserve rationality.
Theoretical Computer Science
(1983)
Manfred Kunde
A multifit algorithm for uniform multiprocessor scheduling.
Theoretical Computer Science
(1983)
Christos H. Papadimitriou
Theory of concurrency control.
Theoretical Computer Science
(1983)
Martin Gogolla
,
Klaus Drosten
,
Udo W. Lipeck
,
Hans-Dieter Ehrich
Algebraic and operational semantics of exceptions and errors.
Theoretical Computer Science
(1983)
Karl J. Lieberherr
,
Stephen A. Vavasis
Analysis of polynomial approximation algorithms for constraint expressions.
Theoretical Computer Science
(1983)
Wolfgang Thomas
A hierarchy of sets of infinite trees.
Theoretical Computer Science
(1983)
Kurt Sieber
Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi.
Theoretical Computer Science
(1983)
Alain Finkel
,
Gérard Memmi
Fifo nets: a new model of parallel computation.
Theoretical Computer Science
(1983)
volume 145, 1982
Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany, January 5-7, 1983, Proceedings
Theoretical Computer Science
145 (1982)
1981
Jean-Michel Autebert
Un resultat de discontinuité dans les familles de langages.
Theoretical Computer Science
(1981)
Jürgen Sattler
Netzwerke zur simultanen Berechnung Boolescher Funktionen.
Theoretical Computer Science
(1981)
Henk J. Olivié
On alpha-balanced Binary Search Trees.
Theoretical Computer Science
(1981)
Luc Boasson
Some Applications of CFL's over Infinte Alphabets.
Theoretical Computer Science
(1981)
John E. Hopcroft
Recent Directions in Algorithmic Research.
Theoretical Computer Science
(1981)
Günter Hotz
Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sprachen.
Theoretical Computer Science
(1981)
David Michael Ritchie Park
Concurrency and Automata on Infinite Sequences.
Theoretical Computer Science
(1981)
Jean-Eric Pin
Un analogue du théorème des variétés pour les cones et les cylindres.
Theoretical Computer Science
(1981)
Werner Kuich
Cycle-Free N-Algebraic Systems.
Theoretical Computer Science
(1981)
Mark H. Overmars
,
Jan van Leeuwen
Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds.
Theoretical Computer Science
(1981)
Jean-Jacques Pansiot
A Decidable Property of Iterated Morphisms.
Theoretical Computer Science
(1981)
Andrzej Ehrenfeucht
,
Grzegorz Rozenberg
On the Subword Complexity and Square-Freeness of Formal Languages.
Theoretical Computer Science
(1981)
Ralf Hartmut Güting
,
Hans-Peter Kriegel
Dynamic k-Dimensional Multiway Search under Time-Varying Access Frequencies.
Theoretical Computer Science
(1981)
Horst Müller
Reachability Analysis with Assertion Systems.
Theoretical Computer Science
(1981)
Michel Latteux
Quelques propriétés des langages à un Comptuer.
Theoretical Computer Science
(1981)
Herbert Klaeren
,
Martin Schulz
Computable Algebras, Word Problems and Canonical Term Algebras.
Theoretical Computer Science
(1981)
Ingo Wegener
/log n.
Theoretical Computer Science
(1981)
Scott Huddleston
,
Kurt Mehlhorn
Robust Balancing in B-Trees.
Theoretical Computer Science
(1981)
volume 104, 1981
Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings
Theoretical Computer Science
104 (1981)