The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Theoretical Aspects of Computer Science (STACS) (stacs)
1987 (conf/stacs/1987)

  1. Ronald V. Book
    Towards a Theory of Relativizations: Positive Relativizations. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:1-21 [Conf]
  2. Gilles Kahn
    Natural Semantics. [Citation Graph (1, 0)][DBLP]
    STACS, 1987, pp:22-39 [Conf]
  3. Michael Kaufmann, Kurt Mehlhorn
    On Local Routing of Two-Terminal Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:40-52 [Conf]
  4. Franz Aurenhammer, Hiroshi Imai
    Geometric Relations Among Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:53-65 [Conf]
  5. J. D. Brock
    Finding the Largest Empty Rectangle on a Grated Surface. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:66-75 [Conf]
  6. Kshitij Doshi, Peter J. Varman
    Efficient Graph Algorithm Using Limited Communication on a Fixed-Size Array of Processors. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:76-87 [Conf]
  7. Bala Ravikumar, K. Ganesan, K. B. Lakshmanan
    On Selecting the Largest Element in Spite of Erroneous Information. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:88-99 [Conf]
  8. Thomas Lengauer, Klaus W. Wagner
    The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:100-113 [Conf]
  9. Uwe Schöning
    Graph Isomorphism is in the Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:114-124 [Conf]
  10. John G. Geske, Dung T. Huynh, Alan L. Selman
    A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:125-135 [Conf]
  11. José L. Balcázar
    Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:136-147 [Conf]
  12. Jin-yi Cai
    Probability One Separation of the Boolean Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:148-158 [Conf]
  13. Juraj Hromkovic
    Reversal Complexity of Multicounter and Multihead Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:159-168 [Conf]
  14. Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini
    Computing the Counting Function of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:169-179 [Conf]
  15. Veikko Keränen
    On the k-Freeness of Morphisms on Free Monoids. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:180-188 [Conf]
  16. Ursula Schmidt
    Avoidable Patterns on 2 Letters. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:189-197 [Conf]
  17. Mustapha Arfi
    Polynomial Operations on Rational Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:198-206 [Conf]
  18. Annegret Habel, Hans-Jörg Kreowski
    Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement. [Citation Graph (1, 0)][DBLP]
    STACS, 1987, pp:207-219 [Conf]
  19. S. Kaplan, Amir Pnueli
    Specification and Implementation of Concurrently Accessed Data Structures: An Abstract Data Type Approach. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:220-244 [Conf]
  20. Christoph Beierle, Angi Voß
    On Implementations of Loose Abstract Data Type Specifications and Their Vertical Composition. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:245-259 [Conf]
  21. Tobias Nipkow
    Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types? [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:260-271 [Conf]
  22. Volker Diekert
    Some Remarks on Presentations by Finite Church-Rosser Thue Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:272-285 [Conf]
  23. Harald Ganzinger
    Ground Term Confluence in Parametric Conditional Equational Specifications. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:286-298 [Conf]
  24. Gunther Schmidt, Rudolf Berghammer, Hans Zierer
    Describing Semantic Domains with Sprouts. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:299-310 [Conf]
  25. Egidio Astesiano, Gianna Reggio
    Comparing Direct and Continuation Semantics Styles for Concurrent Languages: Revisiting an Old Problem from a New Viewpoint. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:311-322 [Conf]
  26. Vikraman Arvind, Somenath Biswas
    Expressibility of First Order Logic with a Nondeterministic Inductive Operator. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:323-335 [Conf]
  27. Rob J. van Glabbeek
    Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:336-347 [Conf]
  28. Dirk Taubner, Walter Vogler
    The Step Failure Semantics. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:348-359 [Conf]
  29. Rodney R. Howell
    On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:360-370 [Conf]
  30. Elisabeth Pelz
    Closure Properties of Deterministic Petri Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:371-382 [Conf]
  31. Lutz Priese, Ralf Rehrmann, Uwe Willecke-Klemme
    Some Results on Fairness: The Regular Case. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:383-395 [Conf]
  32. Heino Carstensen
    Decidability Questions for Fairness in Petri Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:396-407 [Conf]
  33. Manfred Kunde
    Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:408-419 [Conf]
  34. Paul Molitor
    On the Contact-Minimization-Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:420-431 [Conf]
  35. Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks
    Making Distributed Spanning Tree Algorithms Fault-Resilient. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:432-444 [Conf]
  36. Gerard Tel, Richard B. Tan, Jan van Leeuwen
    The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:445-455 [Conf]
  37. Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney
    On the Expected Complexity of Distributed Selection. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:456-467 [Conf]
  38. Didier Bert, Pascal Drabik, Rachid Echahed
    LPG: A Generic, Logic and Functional Programming Language. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:468-469 [Conf]
  39. Hubert Bertling, Harald Ganzinger, Hubert Baumeister
    CEC (Conditional Equations Completion). [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:470- [Conf]
  40. Michel Bidoit, Francis Capy, Christine Choppy, M.-A. Choquer, Stéphane Kaplan, Françoise Schlienger, Frédéric Voisin
    Asspegique: An Integrated Specification Environment. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:471- [Conf]
  41. Wadoud Bousdira, Jean-Luc Remy
    REVEUR4: A Laboratory for Conditional Rewriting. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:472-473 [Conf]
  42. N. Girard
    An Interactive, Incremental and Portable Computer Algebra System for Lambda-Calculus and Combinatory Logic Based on Video Edition and Rewriting Techniques. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:474- [Conf]
  43. Heinrich Hußmann
    The Passau RAP System: Rapid Prototyping for Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:475-476 [Conf]
  44. Michel Lemoine, René Jacquart, Guy Zanon
    SPRAC: A Software Engineering Environment. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:477-478 [Conf]
  45. Laurent Fribourg
    SLOG: A Logic Interpreter for Equational Clauses. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:479-480 [Conf]
  46. Michael Goldsmith, A. Cox, Geoff Barrett
    An Algebraic Transformation System for Occam Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:481- [Conf]
  47. Pierre Lescanne
    REVE: A Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:482-483 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002