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
2009A Comparison of Techniques for Sampling Web Pages.Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler
2009On the Average Complexity of Moore's State Minimization Algorithm.Frdrique Bassino, Julien David, Cyril Nicaud
2009Compressed Representations of Permutations, and Applications.Jrmy Barbay, Gonzalo Navarro
2009An Order on Sets of Tilings Corresponding to an Order on Languages.Nathalie Aubrun, Mathieu Sablik
2009Quantum Query Complexity of Multilinear Identity Testing.Vikraman Arvind, Partha Mukhopadhyay
2009Generating Shorter Bases for Hard Random Lattices.Jol Alwen, Chris Peikert
2009Preface - 26th International Symposium on Theoretical Aspects of Computer Science.Susanne Albers, Jean-Yves Marion
2009Shortest Paths Avoiding Forbidden Subpaths.Mustaq Ahmed, Anna Lubiw
2008Weighted Matching in the Semi-Streaming Model.Mariano Zelke
2008Equilibria, Fixed Points, and Complexity Classes.Mihalis Yannakakis
2008Geodesic Frchet Distance Inside a Simple Polygon.Atlas F. Cook, Carola Wenk
2008Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs.ric Colin de Verdire, Alexander Schrijver
2008Efficient Minimization of DFAs with Partial Transition.Antti Valmari, Petri Lehtinen
2008The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace.Thomas Thierauf, Fabian Wagner
2008A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract).Thomas Schwentick
2008On the decomposition of k-valued rational relations.Jacques Sakarovitch, Rodrigo de Souza
2008Factoring Polynomials over Finite Fields using Balance Test.Chandan Saha
2008Distinguishing Short Quantum Computations.Bill Rosgen
2008Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set.Johan M. M. van Rooij, Hans L. Bodlaender
2008A Mahler's theorem for functions from words to integers.Jean-Eric Pin, Pedro V. Silva
2008On Geometric Spanners of Euclidean and Unit Disk Graphs.Iyad A. Kanj, Ljubomir Perkovic
2008Complexity of solutions of equations over sets of natural numbers.Alexander Okhotin, Artur Jez
2008Weak index versus Borel rank.Filip Murlak
2008Analytic aspects of the shuffle product.Marni Mishna, Mike Zabrocki
2008On Dynamic Breadth-First Search in External-Memory.Ulrich Meyer
1,1011,125 of 2,384← PreviousNext →

Comparable venues

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