The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Ilaria Castellani
    Causal and Distributed Semantics for Concurrent Processes (Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:1- [Conf]
  2. Klaus W. Wagner
    The Alternation Hierarchy for Sublogarithmic Space: An Exciting Race to STACS'93 (Editorial Note). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:2-4 [Conf]
  3. Burchard von Braunmühl
    Alternation for Two-way Machines with Sublogarithmic Space. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:5-15 [Conf]
  4. Maciej Liskiewicz, Rüdiger Reischuk
    Separating the Lower Levels of the Sublogarithmic Space Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:16-27 [Conf]
  5. Johannes Köbler
    Locating P/poly Optimally in the Extended Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:28-37 [Conf]
  6. Jack H. Lutz, Elvira Mayordomo
    Measure, Stochasticity, and the Density of Hard Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:38-47 [Conf]
  7. Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
    Halting Problem of One Binary Horn Clause is Undecidable. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:48-57 [Conf]
  8. Zhou Chaochen, Michael R. Hansen, Peter Sestoft
    Decidability and Undecidability Results for Duration Calculus. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:58-68 [Conf]
  9. Thomas Eiter, Georg Gottlob
    The Complexity of Logic-Based Abduction. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:70-79 [Conf]
  10. Ton Kloks, Dieter Kratsch
    Treewidth of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:80-89 [Conf]
  11. Ulrich Huckenbeck
    On Paths in Networks with Valves. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:90-99 [Conf]
  12. Sivaprakasam Sunder, Xin He
    Scheduling Interval Ordered Tasks in Parallel. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:100-109 [Conf]
  13. Andrea Pietracaprina, Franco P. Preparata
    On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:110-119 [Conf]
  14. Jörg Desel, Wolfgang Reisig
    The Synthesis Problem of Petri Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:120-129 [Conf]
  15. Eike Best, Raymond R. Devillers, Javier Esparza
    General Refinement and Recursion Operators for the Petri Box Calculus. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:130-140 [Conf]
  16. Maria Paola Bonacina, Jieh Hsiang
    On Fairness in Distributed Automated Deduction. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:141-152 [Conf]
  17. Ernst W. Mayr, Ralph Werchner
    Divide-and-Conquer Algorithms on the Hypercube. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:153-162 [Conf]
  18. Eric Allender, José L. Balcázar, Neil Immerman
    A First-Order Isomorphism Theorem. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:163-174 [Conf]
  19. Harry Buhrman, Albrecht Hoene, Leen Torenvliet
    Splittings, Robustness and Structure of Complete Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:175-184 [Conf]
  20. Lane A. Hemachandra, Sudhir K. Jha
    Defying Upward and Downward Separation. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:185-195 [Conf]
  21. Albrecht Hoene, Arfst Nickelsen
    Counting, Selecting, adn Sorting by Query-Bounded Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:196-205 [Conf]
  22. Matthias Jantzen, Holger Petersen
    Cancellation on Context-Free Languages: Enrichment by Reduction. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:206-215 [Conf]
  23. Julien Cassaigne
    Counting Overlap-Free Binary Words. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:216-225 [Conf]
  24. Philippe Narbel
    The Limit Set of Recognizable Substitution Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:226-236 [Conf]
  25. Daniel Krob, Pierre Lalonde
    Partially Commutative Lyndon Words. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:237-246 [Conf]
  26. Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling
    Parallel Architectures: Design and Efficient Use. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:247-269 [Conf]
  27. Michael Formann
    Weighted Closest Pairs. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:270-281 [Conf]
  28. Sven Schuierer
    Rectilinear Path Queries in a Simple Rectilinear Polygon. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:282-293 [Conf]
  29. Artur Czumaj
    Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:294-305 [Conf]
  30. Anders Dessmark, Andrzej Lingas, Anil Maheshwari
    Multi-List Ranking: Complexity and Applications. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:306-316 [Conf]
  31. Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarzenecker
    Exact Algorithms for a Geometric Packing Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:317-322 [Conf]
  32. Oded Maler
    A Decomposition Theorem for Probabilistic Transition Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:323-332 [Conf]
  33. Rosa Montalbano
    Local Automata and Completion. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:333-342 [Conf]
  34. Karel Culik II, Simant Dube
    Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:343-353 [Conf]
  35. Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang
    On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:354-364 [Conf]
  36. Michel Cosnard, Max H. Garzon, Pascal Koiran
    Computability Properties of Low-dimensional Dynamical Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:365-373 [Conf]
  37. Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Intractability II (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:374-385 [Conf]
  38. Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
    Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:386-397 [Conf]
  39. Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
    On Using Oracles That Compute Values. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:398-407 [Conf]
  40. Romain Gengler
    Multicounter Automata with Sublogarithmic Reversal Bounds. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:408-417 [Conf]
  41. Andrew C. Uselton
    Structured Operational Semantics for Concurrency and Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:418-427 [Conf]
  42. Hardi Hungar
    The Complexity of Verifying Functional Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:428-439 [Conf]
  43. P. J. A. Lentfert, S. Doaitse Swierstra
    Towards the Formal Design of Self-Stabilizing Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:440-451 [Conf]
  44. Wojciech Penczek
    Axiomatizations of Temporal Logics on Trace Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:452-462 [Conf]
  45. Katharina Lürwer-Brüggemeier, Friedhelm Meyer auf der Heide
    Capabilities and Complexity of Computations with Integer Division. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:463-472 [Conf]
  46. Rolf Niedermeier, Peter Rossmanith
    Extended Locally Definable Acceptance Types (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:473-483 [Conf]
  47. Stephen A. Fenner, Lance Fortnow, Lide Li
    Gap-Definability as a Closure Property. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:484-493 [Conf]
  48. Christian Choffrut, Leucio Guerra
    On the Logical Definability of Some Rational Trace Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:494-504 [Conf]
  49. Rémi Gilleron, Sophie Tison, Marc Tommasi
    Solving Systems of Set Constraints using Tree Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:505-514 [Conf]
  50. Denis Lugiez, J. L. Moysset
    Complement Problems and Tree Automata in AC-like Theories (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:515-524 [Conf]
  51. László Babai
    Transparent (Holographic) Proofs. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:525-534 [Conf]
  52. Zhi-Li Zhang, David A. Mix Barrington, Jun Tarui
    Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:535-544 [Conf]
  53. Alexis Maciel, Denis Thérien
    Threshold Circuits for Iterated Multiplication: Using AC0 for Free. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:545-565 [Conf]
  54. Sorin Istrail, Dejan Zivkovic
    A Non-Probabilistic Switching Lemma for the Sipser Function. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:566-575 [Conf]
  55. Jordan Gergov, Christoph Meinel
    Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:576-585 [Conf]
  56. Oded Maler, Ludwig Staiger
    On Syntactic Congruences for Omega-Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:586-594 [Conf]
  57. Stefano Varricchio
    Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:595-606 [Conf]
  58. Thomas Wilke
    Locally Threshold Testable Languages of Infinite Words. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:607-616 [Conf]
  59. Volker Diekert, Anca Muscholl
    Deterministic Asynchronous Automata for Infinite Traces. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:617-628 [Conf]
  60. Ludwig Staiger
    Recursive Automata on Infinite Words. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:629-639 [Conf]
  61. Sairam Sairam, Jeffrey Scott Vitter, Roberto Tamassia
    A Complexity Theoretic Approach to Incremental Computation. [Citation Graph (1, 0)][DBLP]
    STACS, 1993, pp:640-649 [Conf]
  62. Rüdiger Reischuk, Christian Schindelhauer
    Precise Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:650-661 [Conf]
  63. Peter Bro Miltersen
    The Bit Probe Complexity Measure Revisited. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:662-671 [Conf]
  64. Ganesh Baliga, John Case, Sanjay Jain
    Language Learning With Some Negative Information. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:672-681 [Conf]
  65. Steffen Lange, Thomas Zeugmann
    Language Learning with a Bounded Number of Mind Changes. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:682-691 [Conf]
  66. Carlo Blundo, Alfredo De Santis, Ugo Vaccaro
    Efficient Sharing of Many Secrets. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:692-703 [Conf]
  67. Rainer Drexler, Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel, Werner Stephan, Andreas Wolpers
    The KIV System: A Tool for Formal Program Development. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:704-705 [Conf]
  68. Franz Höfting, Egon Wanke, Aurel Balmosan, Curd Bergmann
    1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:706-707 [Conf]
  69. Thomas Käufl
    The Program Verifier Tatzelwurm. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:708-709 [Conf]
  70. Stefan Näher
    LEDA: A Library of Efficient Data Types and Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:710-711 [Conf]
  71. Philippe de Groote
    Defining Lambda-Typed Lambda-Calculi by Axiomatizing the Typing Relation. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:712-723 [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