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
2008Lagrangian Relaxation and Partial Cover (Extended Abstract).Julin Mestre
2008An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines.Pinyan Lu, Changyuan Yu
2008Lower bounds for adaptive linearity tests.Shachar Lovett
2008Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental.Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz
2008A Theory for Valiant's Matchcircuits (Extended Abstract).Angsheng Li, Mingji Xia
2008Geometric Set Cover and Hitting Sets for Polytopes in RSren Laue
2008Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic.Dietrich Kuske
2008New Combinatorial Complete One-Way Functions.Arist Kojevnikov, Sergey I. Nikolenko
2008Ehrenfeucht-Frass Goes Automatic for Real Addition.Felix Klaedtke
2008Space Hierarchy Results for Randomized Models.Jeff Kinne, Dieter van Melkebeek
2008The Frobenius Problem in a Free Monoid.Jui-Yi Kao, Jeffrey O. Shallit, Zhi Xu
2008On the Induced Matching Problem.Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer
2008Cardinality and counting quantifiers on omega-automatic structures.Lukasz Kaiser, Sasha Rubin, Vince Brny
2008Improved Algorithms for the Range Next Value Problem and Applications.Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen
2008Computing Minimum Spanning Trees with Uncertainty.Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Mats Mihalk, Rajeev Raman
2008Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees.Viet Tung Hoang, Wing-Kin Sung
2008On the Complexity of Elementary Modal Logics.Edith Hemaspaandra, Henning Schnoor
2008Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.Christian Glaer, Heinz Schmitz, Victor L. Selivanov
2008Succinctness of the Complement and Intersection of Regular Expressions.Wouter Gelade, Frank Neven
2008Order-Invariant MSO is Stronger than Counting MSO in the Finite.Tobias Ganzow, Sasha Rubin
2008Model Checking Games for the Quantitative -Calculus.Diana Fischer, Erich Grdel, Lukasz Kaiser
2008Convergence Thresholds of Newton's Method for Monotone Polynomial Equations.Javier Esparza, Stefan Kiefer, Michael Luttenberger
2008Trimming of Graphs, with Application to Point Labeling.Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
2008Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps.Jean-Franois Dufourd
2008Tight Bounds for Blind Search on the Integers.Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
1,1261,150 of 2,384← PreviousNext →

Comparable venues

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