Skip to content

International Symposium on Theoretical Aspects of Computer Science

STACS

A

CORE rank

CORE rank (raw)

A

Fields of research

Theory of Computation

Papers indexed

2,384

1984–2026

Papers per year

198482 peak2026

STACS papers

2,384 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1989A Generalization of Automatic Sequences.Jeffrey O. Shallit
1989Deciding Equivalence of Finite Tree Automata.Helmut Seidl
1989Shorest Edge-Disjoint Paths in Graphs.Andreas Schwill
1989Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract).Otfried Schwarzkopf
1989A Proof System for Type Theory and CCS.Olov Scheln, Nils-Olof Forsgren
1989Time is Not a Healer.Nicola Santoro, Peter Widmayer
1989Area Efficient Methods to Increase the Reliability of Combinatorial Circuits.Rdiger Reischuk, Bernd Schmeltz
1989Dynamic Planar Point Location with Optimal Query Time.Franco P. Preparata, Roberto Tamassia
1989New Results on the Generalized Star-Height Problem.Jean-Eric Pin, Howard Straubing, Denis Thrien
1989TIME vs BITS.Mark H. Overmars, Nicola Santoro
1989Algebraic Specifications for Domain THeory.Friederike Nickl
1989It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair.Paliath Narendran, Jonathan Stillman
1989Unified Algebras and Action Semantics.Peter D. Mosses
1989Membership in Plynomial Ideals over Q Is Exponential Space Complete.Ernst W. Mayr
1989A First Order Logic for Partial Functions (Extended Abstract).Francisca Lucio-Carrasco, Antonio Gavilanes-Franco
1989Average Number of Messages for Distributed Leader Finding in Rings of Processors.Christian Lavault
1989Concatenable Segment Trees (Extended Abstract).Marc J. van Kreveld, Mark H. Overmars
1989AMORE: A System for Computing Automata, MOnoids, and Regular Expressions.V. Kell, Albert Maier, Andreas Potthoff, Wolfgang Thomas, U. Wermuth
1989Rounds versus Time for the Two Person Pebble Game (Extended Abstract).Bala Kalyanasundaram, Georg Schnitger
1989Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs.Bengt Jonsson, Joachim Parrow
1989Examining the Satisfiability of Formulas of Propositional Dynamic Logic.Tomasz Janowski
1989Decidability of Waek Fairness in Petri Nets.Petr Jancar
1989SAMPLE: A Language Dependent Prototyping Environment.Michael Jger
1989Classes of Picture Languages that Cannot be Distinguished in the Chain Code Concept and Deletion of Redundant Retreats.Friedhelm Hinz
1989Graph^Ed: An Interactive Garpg Editor.Michael Himsolt
2,1512,175 of 2,384← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.