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
1998Cell Flipping in Permutation Diagrams.Martin Charles Golumbic, Haim Kaplan
1998On Uniform DOL Words.Anna E. Frid
1998Nearly Optimal Language Compression Using Extractors.Lance Fortnow, Sophie Laplante
1998Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract).Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan
1998Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract).Zoltn sik
1998On Disguised Double Horn Functions and Extensions.Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1998Construction of Non-intersecting Colored Flows Through a Planar Cellular Figure.Marius Dorkenoo, Marie-Christine Eglin-Leclerc, Eric Rmila
1998Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram.Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin
1998Optimal Broadcasting in Almost Trees and Partial k-trees.Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto
1998The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract).Stphane Demri, Philippe Schnoebelen
1998Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols.Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung
1998Recursively Enumerable Reals and Chaitin Omega Numbers.Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang
1998On the Structure of Valiant's Complexity Classes.Peter Brgisser
1998A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract).Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
1998Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem.Nader H. Bshouty, Lynn Burroughs
1998Simplifying the Modal Mu-Calculus Alternation Hierarchy.Julian C. Bradfield
1998Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering.Jan Behrens, Stephan Waack
1998On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract).Cristina Bazgan, Miklos Santha, Zsolt Tuza
1998Searching Constant Width Mazes Captures the ACDavid A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
1998The Complexity of Modular Graph Automorphism.Vikraman Arvind, Richard Beigel, Antoni Lozano
1998Bounded Size Dictionary Compression: SCSergio De Agostino, Riccardo Silvestri
1997Efficient Scaling-Invariant Checking of Timed Bisimulation.Carsten Weise, Dirk Lenzkes
1997On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams.Stephan Waack
1997Unifying Models.Bernhard Steffen
1997Algebraic and Logical Characterizations of Deterministic Linear Time Classes.Thomas Schwentick
1,7011,725 of 2,384← PreviousNext →

Comparable venues

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