STACS A

72 papers

YearTitle / Authors
19931st Grade - A System for Implementation, Testing and Animation of Graph Algorithms.
Franz Höfting, Egon Wanke, Aurel Balmosan, Curd Bergmann
1993A Complexity Theoretic Approach to Incremental Computation.
Sairam Sairam, Jeffrey Scott Vitter, Roberto Tamassia
1993A Decomposition Theorem for Probabilistic Transition Systems.
Oded Maler
1993A First-Order Isomorphism Theorem.
Eric Allender, José L. Balcázar, Neil Immerman
1993A Non-Probabilistic Switching Lemma for the Sipser Function.
Sorin Istrail, Dejan Zivkovic
1993Alternation for Two-way Machines with Sublogarithmic Space.
Burchard von Braunmühl
1993Axiomatizations of Temporal Logics on Trace Systems.
Wojciech Penczek
1993Cancellation on Context-Free Languages: Enrichment by Reduction.
Matthias Jantzen, Holger Petersen
1993Capabilities and Complexity of Computations with Integer Division.
Katharina Lürwer-Brüggemeier, Friedhelm Meyer auf der Heide
1993Causal and Distributed Semantics for Concurrent Processes (Abstract).
Ilaria Castellani
1993Complement Problems and Tree Automata in AC-like Theories (Extended Abstract).
Denis Lugiez, J. L. Moysset
1993Computability Properties of Low-dimensional Dynamical Systems.
Michel Cosnard, Max H. Garzon, Pascal Koiran
1993Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate.
Zhi-Li Zhang, David A. Mix Barrington, Jun Tarui
1993Counting Overlap-Free Binary Words.
Julien Cassaigne
1993Counting, Selecting, adn Sorting by Query-Bounded Machines.
Albrecht Hoene, Arfst Nickelsen
1993Decidability and Undecidability Results for Duration Calculus.
Zhou Chaochen, Michael R. Hansen, Peter Sestoft
1993Defining Lambda-Typed Lambda-Calculi by Axiomatizing the Typing Relation.
Philippe de Groote
1993Defying Upward and Downward Separation.
Lane A. Hemachandra, Sudhir K. Jha
1993Deterministic Asynchronous Automata for Infinite Traces.
Volker Diekert, Anca Muscholl
1993Divide-and-Conquer Algorithms on the Hypercube.
Ernst W. Mayr, Ralph Werchner
1993Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data.
Karel Culík II, Simant Dube
1993Efficient Sharing of Many Secrets.
Carlo Blundo, Alfredo De Santis, Ugo Vaccaro
1993Exact Algorithms for a Geometric Packing Problem (Extended Abstract).
Ludek Kucera, Kurt Mehlhorn, B. Preis, Erik Schwarzenecker
1993Extended Locally Definable Acceptance Types (Extended Abstract).
Rolf Niedermeier, Peter Rossmanith
1993Fixed-Parameter Intractability II (Extended Abstract).
Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
1993Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs.
Jordan Gergov, Christoph Meinel
1993Gap-Definability as a Closure Property.
Stephen A. Fenner, Lance Fortnow, Lide Li
1993General Refinement and Recursion Operators for the Petri Box Calculus.
Eike Best, Raymond Devillers, Javier Esparza
1993Halting Problem of One Binary Horn Clause is Undecidable.
Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
1993LEDA: A Library of Efficient Data Types and Algorithms.
Stefan Näher
1993Language Learning With Some Negative Information.
Ganesh R. Baliga, John Case, Sanjay Jain
1993Language Learning with a Bounded Number of Mind Changes.
Steffen Lange, Thomas Zeugmann
1993Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution.
Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
1993Local Automata and Completion.
Rosa Montalbano
1993Locally Threshold Testable Languages of Infinite Words.
Thomas Wilke
1993Locating P/poly Optimally in the Extended Low Hierarchy.
Johannes Köbler
1993Measure, Stochasticity, and the Density of Hard Languages.
Jack H. Lutz, Elvira Mayordomo
1993Multi-List Ranking: Complexity and Applications.
Anders Dessmark, Andrzej Lingas, Anil Maheshwari
1993Multicounter Automata with Sublogarithmic Reversal Bounds.
Romain Gengler
1993On Fairness in Distributed Automated Deduction.
Maria Paola Bonacina, Jieh Hsiang
1993On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem.
Andrea Pietracaprina, Franco P. Preparata
1993On Paths in Networks with Valves.
Ulrich Huckenbeck
1993On Syntactic Congruences for Omega-Languages.
Oded Maler, Ludwig Staiger
1993On Using Oracles That Compute Values.
Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
1993On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages.
Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang
1993On the Logical Definability of Some Rational Trace Languages.
Christian Choffrut, Leucio Guerra
1993Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract).
Artur Czumaj
1993Parallel Architectures: Design and Efficient Use.
Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling
1993Partially Commutative Lyndon Words.
Daniel Krob, Pierre Lalonde
1993Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages.
Stefano Varricchio
1993Precise Average Case Complexity.
Rüdiger Reischuk, Christian Schindelhauer
1993Rectilinear Path Queries in a Simple Rectilinear Polygon.
Sven Schuierer
1993Recursive Automata on Infinite Words.
Ludwig Staiger
1993STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings
Patrice Enjalbert, Alain Finkel, Klaus W. Wagner
1993Scheduling Interval Ordered Tasks in Parallel.
Sivaprakasam Sunder, Xin He
1993Separating the Lower Levels of the Sublogarithmic Space Hierarchy.
Maciej Liskiewicz, Rüdiger Reischuk
1993Solving Systems of Set Constraints using Tree Automata.
Rémi Gilleron, Sophie Tison, Marc Tommasi
1993Splittings, Robustness and Structure of Complete Sets.
Harry Buhrman, Albrecht Hoene, Leen Torenvliet
1993Structured Operational Semantics for Concurrency and Hierarchy.
Andrew C. Uselton
1993The Alternation Hierarchy for Sublogarithmic Space: An Exciting Race to STACS'93 (Editorial Note).
Klaus W. Wagner
1993The Bit Probe Complexity Measure Revisited.
Peter Bro Miltersen
1993The Complexity of Logic-Based Abduction.
Thomas Eiter, Georg Gottlob
1993The Complexity of Verifying Functional Programs.
Hardi Hungar
1993The KIV System: A Tool for Formal Program Development.
Rainer Drexler, Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel, Werner Stephan, Andreas Wolpers
1993The Limit Set of Recognizable Substitution Systems.
Philippe Narbel
1993The Program Verifier Tatzelwurm.
Thomas Käufl
1993The Synthesis Problem of Petri Nets.
Jörg Desel, Wolfgang Reisig
1993Threshold Circuits for Iterated Multiplication: Using AC0 for Free.
Alexis Maciel, Denis Thérien
1993Towards the Formal Design of Self-Stabilizing Distributed Algorithms.
P. J. A. Lentfert, S. Doaitse Swierstra
1993Transparent (Holographic) Proofs.
László Babai
1993Treewidth of Bipartite Graphs.
Ton Kloks, Dieter Kratsch
1993Weighted Closest Pairs.
Michael Formann