STACS A

52 papers

YearTitle / Authors
1991A Modal Semantics for the Negation as Failure and the Closed World Assumption Rules.
Philippe Balbiani
1991A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms.
Michael Godau
1991A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance.
Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson
1991A Placement System for Constrained Blocks with Flexible Shapes.
Simone Pimont
1991Actors as a Parallel Programming Model.
Françoise Baude, Guy Vidal-Naquet
1991Algebraic Program Interpreter APREX2.
D. Rayko, Kirill Vershinin, Igor Romanenko
1991An Observational Subset of First-Order Logic Cannot Specify the Behaviour of a Counter (Extended Abstract).
Oliver Schoett
1991Average Case Analysis of Unification Algorithms.
Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann
1991Bisimulation and Action Refinement.
Walter Vogler
1991Bounded Reductions.
Harry Buhrman, Edith Spaan, Leen Torenvliet
1991Complexity Classification of Truth Maintenance Systems.
Vladislav Rutenburg
1991Compositional Generation of Home States in Free Choice Systems.
Eike Best, Ludmila Cherkasova, Jörg Desel
1991Computationally Convincing Proofs of Knowledge.
Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger
1991Constant Queue Routing on a Mesh.
Sanguthevar Rajasekaran, Richard Overholt
1991Decidable Sentences for Context-Free Groups.
Klaus Madlener, Friedrich Otto
1991Decision Problems for Term Rewriting Systems and Recognizable Tree Languages.
Rémi Gilleron
1991Detection of Deadlocks in an Infinite Family of Nets.
Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet
1991Efficient Memory Access in Large-Scale Computation.
Jeffrey Scott Vitter
1991Executable Higher-Order Algebraic Specifications.
Jean-Pierre Jouannaud
1991Functional Oracle Queries as a Measure of Parallel Time.
Carme Àlvarez, José L. Balcázar, Birgit Jenner
1991Geometry Models Design System GammaPOM.
E. V. Biryalcev, A. M. Gusenkov, Ildar R. Nasyrov, A. A. Saveliev
1991IPG - An Interactive Parser Generator.
Jörg Kröger, Lothar Schmitz
1991Interactive Proof Systems and Alternating Time-Space Complexity.
Lance Fortnow, Carsten Lund
1991Methodology for Proving the Termination of Logic Programs.
Bal Wang, R. K. Shyamasundar
1991Nondterminism Within P.
Jonathan F. Buss, Judy Goldsmith
1991On Aperiodic Trace Languages.
Giovanna Guaiana, Antonio Restivo, Sergio Salemi
1991On the Concatenation of Infinite Traces.
Volker Diekert
1991On the Power of Several Queues.
Martin Schmidt
1991Optimal Parallel Recognition of Bracket Languages on Hypercubes.
Gisela Pitsch, Elmar Schömer
1991Optimal Tradeoffs Between Time And Bit Complexity In Distributed Synchronous Rings.
Bernd Schmeltz
1991Polymorphism, Parameterization and Typing: An Algebraic Specification Perspective.
Jacek Leszczylowski, Martin Wirsing
1991Polynomial Size Constant Depth Circuits with a Limited Number of Negations.
Miklos Santha, Christopher B. Wilson
1991Prototype of a Verification Tool.
Thierry Jéron
1991Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy.
Jun Tarui
1991Rational Ralations with Bounded Delay.
Christiane Frougny, Jacques Sakarovitch
1991Reachability in Reversible Free Choice Systems.
Jörg Desel, Javier Esparza
1991Recognizable and Rational Languages of Finite and Infinite Traces.
Paul Gastin
1991STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings
Christian Choffrut, Matthias Jantzen
1991Structure and Importance of Logspace-MOD-Classes.
Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
1991Testing for Unboundedness of FIFO Channels.
Thierry Jéron
1991The Complexity of the Max Word Problem.
Anne Condon
1991The Expressive Power of Second Order Horn Logic.
Erich Grädel
1991The Owner Concept for PRAMs.
Peter Rossmanith
1991The PROSPECTRA System.
Berthold Hoffmann, Bernd Krieg-Brückner
1991The RELVIEW-System.
Rudolf Berghammer, Gunther Schmidt
1991The Random Testability of the n-Input AND Gate.
Joachim Hartmann
1991The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n.
Ingo Wegener
1991Tight Bounds on the Path Length of Binary Trees.
Alfredo De Santis, Giuseppe Persiano
1991Tight RNC Approximations to Max Flow.
Maria J. Serna, Paul G. Spirakis
1991Unconditional Byzantine Agreement with Good Majority.
Birgit Baum-Waidner, Birgit Pfitzmann, Michael Waidner
1991Unfolding, Procedural and Fixpoint Semantics of Logic Programs.
François Denis, Jean-Paul Delahaye
1991l-Occurrences of Avoidable Patterns.
Peter Roth