The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Jacek Leszczylowski, Martin Wirsing
    Polymorphism, Parameterization and Typing: An Algebraic Specification Perspective. [Citation Graph (2, 0)][DBLP]
    STACS, 1991, pp:1-15 [Conf]
  2. Jean-Pierre Jouannaud
    Executable Higher-Order Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:16-25 [Conf]
  3. Jeffrey Scott Vitter
    Efficient Memory Access in Large-Scale Computation. [Citation Graph (2, 0)][DBLP]
    STACS, 1991, pp:26-41 [Conf]
  4. Peter Roth
    l-Occurrences of Avoidable Patterns. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:42-49 [Conf]
  5. Christiane Frougny, Jacques Sakarovitch
    Rational Ralations with Bounded Delay. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:50-63 [Conf]
  6. Martin Schmidt
    On the Power of Several Queues. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:64-75 [Conf]
  7. Giovanna Guaiana, Antonio Restivo, Sergio Salemi
    On Aperiodic Trace Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:76-88 [Conf]
  8. Paul Gastin
    Recognizable and Rational Languages of Finite and Infinite Traces. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:89-104 [Conf]
  9. Volker Diekert
    On the Concatenation of Infinite Traces. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:105-117 [Conf]
  10. Maria J. Serna, Paul G. Spirakis
    Tight RNC Approximations to Max Flow. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:118-126 [Conf]
  11. 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]
  12. 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]
  13. Rémi Gilleron
    Decision Problems for Term Rewriting Systems and Recognizable Tree Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:148-159 [Conf]
  14. Klaus Madlener, Friedrich Otto
    Decidable Sentences for Context-Free Groups. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:160-171 [Conf]
  15. Peter Rossmanith
    The Owner Concept for PRAMs. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:172-183 [Conf]
  16. Françoise Baude, Guy Vidal-Naquet
    Actors as a Parallel Programming Model. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:184-195 [Conf]
  17. 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]
  18. Bal Wang, R. K. Shyamasundar
    Methodology for Proving the Termination of Logic Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:214-227 [Conf]
  19. 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]
  20. Jun Tarui
    Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:238-250 [Conf]
  21. 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]
  22. Lance Fortnow, Carsten Lund
    Interactive Proof Systems and Alternating Time-Space Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:263-274 [Conf]
  23. Bernd Schmeltz
    Optimal Tradeoffs Between Time And Bit Complexity In Distributed Synchronous Rings. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:275-284 [Conf]
  24. Birgit Baum-Waidner, Birgit Pfitzmann, Michael Waidner
    Unconditional Byzantine Agreement with Good Majority. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:285-295 [Conf]
  25. 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]
  26. Walter Vogler
    Bisimulation and Action Refinement. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:309-321 [Conf]
  27. Thierry Jéron
    Testing for Unboundedness of FIFO Channels. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:322-333 [Conf]
  28. 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]
  29. Jonathan F. Buss, Judy Goldsmith
    Nondterminism Within P. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:348-359 [Conf]
  30. 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]
  31. Vladislav Rutenburg
    Complexity Classification of Truth Maintenance Systems. [Citation Graph (1, 0)][DBLP]
    STACS, 1991, pp:372-383 [Conf]
  32. Jörg Desel, Javier Esparza
    Reachability in Reversible Free Choice Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:384-397 [Conf]
  33. 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]
  34. Harry Buhrman, Edith Spaan, Leen Torenvliet
    Bounded Reductions. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:410-421 [Conf]
  35. 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]
  36. Gisela Pitsch, Elmar Schömer
    Optimal Parallel Recognition of Bracket Languages on Hypercubes. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:434-443 [Conf]
  37. Sanguthevar Rajasekaran, Richard Overholt
    Constant Queue Routing on a Mesh. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:444-455 [Conf]
  38. Anne Condon
    The Complexity of the Max Word Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:456-465 [Conf]
  39. Erich Grädel
    The Expressive Power of Second Order Horn Logic. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:466-477 [Conf]
  40. 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]
  41. Joachim Hartmann
    The Random Testability of the n-Input AND Gate. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:488-498 [Conf]
  42. 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]
  43. 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]
  44. 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]
  45. Rudolf Berghammer, Gunther Schmidt
    The RELVIEW-System. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:535-536 [Conf]
  46. 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]
  47. Berthold Hoffmann, Bernd Krieg-Brückner
    The PROSPECTRA System. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:539-540 [Conf]
  48. Thierry Jéron
    Prototype of a Verification Tool. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:541-542 [Conf]
  49. Jörg Kröger, Lothar Schmitz
    IPG - An Interactive Parser Generator. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:543-544 [Conf]
  50. Simone Pimont
    A Placement System for Constrained Blocks with Flexible Shapes. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:545-546 [Conf]
  51. D. Rayko, Kirill Vershinin, Igor Romanenko
    Algebraic Program Interpreter APREX2. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:547-548 [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