Conferences in DBLP
Jacek Leszczylowski , Martin Wirsing Polymorphism, Parameterization and Typing: An Algebraic Specification Perspective. [Citation Graph (2, 0)][DBLP ] STACS, 1991, pp:1-15 [Conf ] Jean-Pierre Jouannaud Executable Higher-Order Algebraic Specifications. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:16-25 [Conf ] Jeffrey Scott Vitter Efficient Memory Access in Large-Scale Computation. [Citation Graph (2, 0)][DBLP ] STACS, 1991, pp:26-41 [Conf ] Peter Roth l-Occurrences of Avoidable Patterns. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:42-49 [Conf ] Christiane Frougny , Jacques Sakarovitch Rational Ralations with Bounded Delay. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:50-63 [Conf ] Martin Schmidt On the Power of Several Queues. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:64-75 [Conf ] Giovanna Guaiana , Antonio Restivo , Sergio Salemi On Aperiodic Trace Languages. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:76-88 [Conf ] Paul Gastin Recognizable and Rational Languages of Finite and Infinite Traces. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:89-104 [Conf ] Volker Diekert On the Concatenation of Infinite Traces. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:105-117 [Conf ] Maria J. Serna , Paul G. Spirakis Tight RNC Approximations to Max Flow. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:118-126 [Conf ] Michael Godau A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:127-136 [Conf ] Ingo Wegener The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:137-147 [Conf ] Rémi Gilleron Decision Problems for Term Rewriting Systems and Recognizable Tree Languages. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:148-159 [Conf ] Klaus Madlener , Friedrich Otto Decidable Sentences for Context-Free Groups. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:160-171 [Conf ] Peter Rossmanith The Owner Concept for PRAMs. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:172-183 [Conf ] Françoise Baude , Guy Vidal-Naquet Actors as a Parallel Programming Model. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:184-195 [Conf ] Luc Albert , Rafael Casas , François Fages , A. Torrecillas , Paul Zimmermann Average Case Analysis of Unification Algorithms. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:196-213 [Conf ] Bal Wang , R. K. Shyamasundar Methodology for Proving the Termination of Logic Programs. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:214-227 [Conf ] Miklos Santha , Christopher B. Wilson Polynomial Size Constant Depth Circuits with a Limited Number of Negations. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:228-237 [Conf ] Jun Tarui Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:238-250 [Conf ] Gilles Brassard , Claude Crépeau , Sophie Laplante , Christian Léger Computationally Convincing Proofs of Knowledge. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:251-262 [Conf ] Lance Fortnow , Carsten Lund Interactive Proof Systems and Alternating Time-Space Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:263-274 [Conf ] Bernd Schmeltz Optimal Tradeoffs Between Time And Bit Complexity In Distributed Synchronous Rings. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:275-284 [Conf ] Birgit Baum-Waidner , Birgit Pfitzmann , Michael Waidner Unconditional Byzantine Agreement with Good Majority. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:285-295 [Conf ] Svante Carlsson , Christer Mattsson , Patricio V. Poblete , Mats Bengtsson A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:296-308 [Conf ] Walter Vogler Bisimulation and Action Refinement. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:309-321 [Conf ] Thierry Jéron Testing for Unboundedness of FIFO Channels. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:322-333 [Conf ] Joffroy Beauquier , Annie Choquet , Antoine Petit , Guy Vidal-Naquet Detection of Deadlocks in an Infinite Family of Nets. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:334-347 [Conf ] Jonathan F. Buss , Judy Goldsmith Nondterminism Within P. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:348-359 [Conf ] Gerhard Buntrock , Carsten Damm , Ulrich Hertrampf , Christoph Meinel Structure and Importance of Logspace-MOD-Classes. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:360-371 [Conf ] Vladislav Rutenburg Complexity Classification of Truth Maintenance Systems. [Citation Graph (1, 0)][DBLP ] STACS, 1991, pp:372-383 [Conf ] Jörg Desel , Javier Esparza Reachability in Reversible Free Choice Systems. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:384-397 [Conf ] Eike Best , Ludmila Cherkasova , Jörg Desel Compositional Generation of Home States in Free Choice Systems. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:398-409 [Conf ] Harry Buhrman , Edith Spaan , Leen Torenvliet Bounded Reductions. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:410-421 [Conf ] Carme Àlvarez , José L. Balcázar , Birgit Jenner Functional Oracle Queries as a Measure of Parallel Time. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:422-433 [Conf ] Gisela Pitsch , Elmar Schömer Optimal Parallel Recognition of Bracket Languages on Hypercubes. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:434-443 [Conf ] Sanguthevar Rajasekaran , Richard Overholt Constant Queue Routing on a Mesh. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:444-455 [Conf ] Anne Condon The Complexity of the Max Word Problem. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:456-465 [Conf ] Erich Grädel The Expressive Power of Second Order Horn Logic. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:466-477 [Conf ] Alfredo De Santis , Giuseppe Persiano Tight Bounds on the Path Length of Binary Trees. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:478-487 [Conf ] Joachim Hartmann The Random Testability of the n-Input AND Gate. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:488-498 [Conf ] Oliver Schoett An Observational Subset of First-Order Logic Cannot Specify the Behaviour of a Counter (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:499-510 [Conf ] François Denis , Jean-Paul Delahaye Unfolding, Procedural and Fixpoint Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:511-522 [Conf ] Philippe Balbiani A Modal Semantics for the Negation as Failure and the Closed World Assumption Rules. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:523-534 [Conf ] Rudolf Berghammer , Gunther Schmidt The RELVIEW-System. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:535-536 [Conf ] E. V. Biryalcev , A. M. Gusenkov , Ildar R. Nasyrov , A. A. Saveliev Geometry Models Design System GammaPOM. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:537-538 [Conf ] Berthold Hoffmann , Bernd Krieg-Brückner The PROSPECTRA System. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:539-540 [Conf ] Thierry Jéron Prototype of a Verification Tool. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:541-542 [Conf ] Jörg Kröger , Lothar Schmitz IPG - An Interactive Parser Generator. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:543-544 [Conf ] Simone Pimont A Placement System for Constrained Blocks with Flexible Shapes. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:545-546 [Conf ] D. Rayko , Kirill Vershinin , Igor Romanenko Algebraic Program Interpreter APREX2. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:547-548 [Conf ]