STACS A

57 papers

YearTitle / Authors
1995A Family of Tag Systems for Paperfolding Sequences.
Christiane Bercoff
1995A Fully Abstract Semantics for Causality in the Pi-Calculus.
Michele Boreale, Davide Sangiorgi
1995A Packet Routing Protocol for Arbitrary Networks.
Friedhelm Meyer auf der Heide, Berthold Vöcking
1995A Prossible Code in the Genetic Code.
Didier Arquès, Christian J. Michel
1995A Random NP-Complete Problem for Inversion of 2D Cellular Automata.
Bruno Durand
1995A Set-Theoretic Translation Method for (Poly)modal Logics.
Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
1995Algorithms Explained by Symmetries.
Torsten Minkwitz
1995Beyond P^(NP) - NEXP.
Stephen A. Fenner, Lance Fortnow
1995Classes of Bounded Counting Type and their Inclusion Relations.
Ulrich Hertrampf
1995Coding and Strong Coding in Trace Monoids.
Véronique Bruyère, Clelia De Felice
1995Communication Complexity of Key Agreement on Small Ranges.
Jin-Yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
1995Completeness and Weak Completeness Under Polynomial-Size Circuits.
David W. Juedes, Jack H. Lutz
1995Computability of Convex Sets (Extended Abstract).
Martin Kummer, Marcus Schäfer
1995Concurrent Process Equivalences: Some Decision Problems (Abstract).
Albert R. Meyer
1995Dependence Orders for Computations of Concurrent Automata.
Felipe Bracho, Manfred Droste, Dietrich Kuske
1995Deterministic Generalized Automata.
Dora Giammarresi, Rosa Montalbano
1995Dynamic Analysis of the Sizes of Relations.
Danièle Gardy, Guy Louchard
1995Enumerating Extreme Points in Higher Dimensions.
Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi
1995Expander Properties in Random Regular Graphs with Edge Faults.
Sotiris E. Nikoletseas, Paul G. Spirakis
1995Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.
Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann
1995Finding Largest Common Embeddable Subtrees.
Arvind Gupta, Naomi Nishimura
1995Finding the Maximum with Linear Error Probabilities: A Sequential Analysis Approach.
Guy Louchard
1995Generalized Scans and Tri-Diagonal Systems.
Paul F. Fischer, Franco P. Preparata, John E. Savage
1995Growing Context-Sensitive Languages and Church-Rosser Languages.
Gerhard Buntrock, Friedrich Otto
1995Interval Routing Schemes.
Michele Flammini, Giorgio Gambosi, Sandro Salomone
1995Line Segmentation of Digital Curves in Parallel.
Peter Damaschke
1995Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates.
Frederic Green
1995Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).
Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp
1995Malign Distributions for Average Case Circuit Complexity.
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1995Normal Numbers and Sources for BPP.
Martin Strauss
1995On Codings of Traces.
Volker Diekert, Anca Muscholl, Klaus Reinhardt
1995On Compact Representations of Propositional Circumscription.
Marco Cadoli, Francesco M. Donini, Marco Schaerf
1995On Realizing Iterated Multiplication by Small Depth Threshold Circuits.
Matthias Krause
1995On Slender Context-free Languages.
Danny Raz
1995On the Average Running Time of Odd-Even Merge Sort.
Christine Rüb
1995On the Separators on an Infinite Word Generated by a Morphism.
Emmanuelle Garel
1995On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener
1995On the Sparse Set Conjecture for Sets with Low Denisty.
Harry Buhrman, Montserrat Hermo
1995On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract).
Ioan I. Macarie
1995On the Subword Equivalence Problem for Infinite Words.
Isabelle Fagnot
1995On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract).
Oded Maler, Amir Pnueli, Joseph Sifakis
1995On the Synthesis of Strategies in Infinite Games.
Wolfgang Thomas
1995On the Undecidability of Deadlock Detection in Families of Nets.
Anne-Cécile Fabret, Antoine Petit
1995On-line and Dynamic Algorithms for Shorted Path Problems.
Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
1995Optimal Average Case Sorting on Arrays.
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
1995Optimal Lower Bounds on the Multiparty Communication Complexity.
Pavol Duris, José D. P. Rolim
1995Optimal Simulation of Automata by Neural Nets.
Piotr Indyk
1995Partial Derivates of Regular Expressions and Finite Automata Constructions.
Valentin M. Antimirov
1995Pseudorandom Generators and the Frequency of Simplicity.
Yenjo Han, Lane A. Hemaspaandra
1995Resource-Bounded Instance Complexity (Extended Abstract).
Lance Fortnow, Martin Kummer
1995STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings
Ernst W. Mayr, Claude Puech
1995Simultaneous Messages vs. Communication.
László Babai, Peter G. Kimmel, Satyanarayana V. Lokam
1995Structural Complexity of Omega-Automata.
Sriram C. Krishnan, Anuj Puri, Robert K. Brayton
1995Systolic Tree Omega-Languages.
Angelo Monti, Adriano Peron
1995The Chi-t-Coloring Problem.
Damon Kaller, Arvind Gupta, Thomas C. Shermer
1995The Number of Views of Piecewise-Smooth Algebraic Objects.
Sylvain Petitjean
1995Two-Dimensional Pattern Matching in Linear Time and Small Space.
Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter