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
2009Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence.Marius Zimand
2009Error-Correcting Data Structures.Ronald de Wolf
2009A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints.Kenya Ueno
2009Lower Bounds for Multi-Pass Processing of Multiple Data Streams.Nicole Schweikardt
2009Strong Completeness of Coalgebraic Modal Logics.Lutz Schrder, Dirk Pattinson
2009Bchi Complementation Made Tight.Sven Schewe
2009Profinite Methods in Automata Theory.Jean-Eric Pin
2009Tractable Structures for Constraint Satisfaction with Truth Tables.Dniel Marx
2009On Approximating Multi-Criteria TSP.Bodo Manthey
2009Undecidable Properties of Limit Set Dynamics of Cellular Automata.Pietro di Lena, Luciano Margara
2009Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time.Fabian Kuhn
2009Polynomial Kernelizations for MIN FStefan Kratsch
2009Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata.Daniel Kirsten, Sylvain Lombardy
2009Equations over Sets of Natural Numbers with Addition Only.Artur Jez, Alexander Okhotin
2009On the Borel Inseparability of Game Tree Languages.Szczepan Hummel, Henryk Michalewski, Damian Niwinski
2009Ambiguity and Communication.Juraj Hromkovic, Georg Schnitger
2009Random Fruits on the Zielonka Tree.Florian Horn
2009A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression.Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2009More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
2009Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness.Andr Gronemeier
2009A Complexity Dichotomy for Partition Functions with Mixed Signs.Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2009The Dynamic Complexity of Formal Languages.Wouter Gelade, Marcel Marquardt, Thomas Schwentick
2009Efficient Isomorphism Testing for a Class of Group Extensions.Franois Le Gall
2009Randomness on Computable Probability Spaces - A Dynamical Point of View.Pter Gcs, Mathieu Hoyrup, Cristobal Rojas
2009Optimal Cache-Aware Suffix Selection.Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
1,0511,075 of 2,384← PreviousNext →

Comparable venues

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