The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Claus-Peter Schnorr
    Geometry of Numbers and Integer Programming (Summary). [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:1-7 [Conf]
  2. Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
    Getting Back to the Past in the Union-Find Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:8-17 [Conf]
  3. Bernd Becker, Reiner Kolla
    On the Construction of Optimal Time Adders (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:18-28 [Conf]
  4. Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson
    On Computations with Integer Division. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:29-37 [Conf]
  5. Mark H. Overmars, Michiel H. M. Smid
    Maintaining Range Trees in Secondary Memory (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STACS, 1988, pp:38-51 [Conf]
  6. David Fernández-Baca, Giora Slutzki
    Solving Parametric Problems on Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:52-60 [Conf]
  7. Walter Unger
    On the k-Colouring of Circle-Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:61-72 [Conf]
  8. François Bergeron, Gilbert Labelle, Pierre Leroux
    Functional Equations for Data Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:73-80 [Conf]
  9. Christoph Meinel
    The Power of Polynomial Size Omega-Branching Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:81-90 [Conf]
  10. Uwe Schöning, Klaus W. Wagner
    Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:91-97 [Conf]
  11. Erich Grädel
    Domino Games with an Application to the Complexity of Boolean Algebras with Bounded Quantifier Alternations. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:98-107 [Conf]
  12. Ingolf Wald
    An Automatic Speed-up of Random Access Machines with Powerful Arithmetic Instructions. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:108-117 [Conf]
  13. Birgit Jenner, Bernd Kirsig
    Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:118-125 [Conf]
  14. Volker Diekert, Axel Möbus
    Hotz-Isomorphism Theorems in Formal Language Theory. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:126-135 [Conf]
  15. Uschi Heuter
    First-Order Properties of Trees, Star-Free Expressions, adn Aperiodicity. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:136-148 [Conf]
  16. Alain Terlutte
    Cyclic Rational Transductions and Polynomials of Rational Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:149-158 [Conf]
  17. Clelia de Felice
    Construction of a Family of Finite Maximal Codes. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:159-169 [Conf]
  18. Jean-Paul Allouche, Bernard Rande, Loÿs Thimonier
    Fonctions Génératrices Transcendantes à Coefficients Engendrés par Automates. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:170-183 [Conf]
  19. Gilberto Filé
    The Relation of Two Patterns with Comparable Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:184-192 [Conf]
  20. Wadoud Bousdira, Jean-Luc Remy
    Hierarchical Contextual Rewriting with Several Levels. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:193-206 [Conf]
  21. Egidio Astesiano, Alessandro Giovini, Gianna Reggio
    Generalized Bisimulation in Relational Specifications. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:207-226 [Conf]
  22. Franz-Josef Brandenburg
    On Polynomial Time Graph Grammars. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:227-236 [Conf]
  23. Bruno Courcelle
    An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:237-247 [Conf]
  24. Paul G. Spirakis, Basil Tampakas
    Efficient Distributed Algorithms by Using the Archemedean Time Assumption. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:248-263 [Conf]
  25. Martín Abadi, Joan Feigenbaum
    A Simple Protocol for Secure Circuit Evaluation. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:264-272 [Conf]
  26. Guan-Ing Chen, Ten-Hwang Lai
    Scheduling Independent Jobs on Hypercubes. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:273-280 [Conf]
  27. Rolf Klein, Derick Wood
    Voronoi Diagrams Based on General Metrics in the Plane. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:281-291 [Conf]
  28. Nicola Santoro, Stuart J. Sidney, Jorge Urrutia
    Geometric Containment, Common Roots of Polynomials and Partial Orders. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:292-300 [Conf]
  29. Pascal Lienhardt
    Extension of the Notion of Map and Subdivisions of a Three-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:301-311 [Conf]
  30. Jörg-Rüdiger Sack, Subhash Suri
    An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:312-321 [Conf]
  31. Francis Avnaim, Jean-Daniel Boissonnat
    Polygon Placement Under Translation and Rotation. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:322-333 [Conf]
  32. Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini
    On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:334-345 [Conf]
  33. Edward Ochmanski
    On Morphisms of Trace Monoids. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:346-355 [Conf]
  34. Irène Guessarian, Wafaa Niar-Dinedane
    An Automaton Characterization of Fairness in SCCS. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:356-372 [Conf]
  35. Joost N. Kok
    A Compositional Semantics for Concurrent Prolog. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:373-388 [Conf]
  36. Patrick Bellot, Remi Legrand
    Functions and Relations: The GRAAL System. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:389-390 [Conf]
  37. Marc V. Benveniste
    LPC: A Concurrent Programming Laboratory. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:391-392 [Conf]
  38. François Bergeron, G. Cartier
    Darwin: Computer Algebra and Enumerative Combinatorics. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:393-394 [Conf]
  39. Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade
    Some Tools for an Inference Laboratory (ATINF). [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:395-396 [Conf]
  40. Louis Dewez, Jean-Michel Douin, Philippe Lucas
    MODULOG and the MODULA WorkStation. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:397-398 [Conf]
  41. B. Le Goff, Paul Le Guernic
    The Granules, Blutton: An Idea, an Algorithm to Implement on Multiprocessor. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:399-400 [Conf]
  42. Amelia Soriano
    Prototype de Venus: Un Outil d'Aide à la Verification de Systemes Communicants. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:401-402 [Conf]
  43. Egon Wanke
    PLEXUS: A System for Implementing Hierarchical Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:403-404 [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