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
2007Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs.Robert Elssser, Thomas Sauerwald
2007Light Orthogonal Networks with Constant Geometric Dilation.Adrian Dumitrescu, Csaba D. Tth
2007Randomly Rounding Rationals with Cardinality Constraints and Derandomizations.Benjamin Doerr
2007The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.Peter Damaschke
2007Small Space Representations for Metric Min-SumArtur Czumaj, Christian Sohler
2007Compact Forbidden-Set Routing.Bruno Courcelle, Andrew Twigg
2007Why Almost AllAmin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
2007Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem.Andrew M. Childs, Aram W. Harrow, Pawel Wocjan
2007Languages with Bounded Multiparty Communication Complexity.Arkadev Chattopadhyay, Andreas Krebs, Michal Kouck, Mario Szegedy, Pascal Tesson, Denis Thrien
2007Wavelength Management in WDM Rings to Maximize the Number of Connections.Ioannis Caragiannis
2007On Symmetric Signatures in Holographic Algorithms.Jin-yi Cai, Pinyan Lu
2007A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window.Costas Busch, Srikanta Tirthapura
2007Associative-Commutative Deducibility Constraints.Sergiu Bursuc, Hubert Comon-Lundh, Stphanie Delaune
2007On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds.Peter Brgisser
2007An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic.Davide Bresolin, Angelo Montanari, Pietro Sala
2007Cost Sharing Methods for Makespan and Completion Time Scheduling.Janina A. Brenner, Guido Schfer
2007Symmetries and the Complexity of Pure Nash Equilibrium.Felix Brandt, Felix A. Fischer, Markus Holzer
2007Reachability in Unions of Commutative Rewriting Systems Is Decidable.Mikolaj Bojanczyk, Piotr Hoffman
2007A Cubic Kernel for Feedback Vertex Set.Hans L. Bodlaender
2007Correlations of Partial Words.Francine Blanchet-Sadri, Joshua D. Gafni, Kevin H. Wilson
2007Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity.Laurent Bienvenu
2007Admissibility in Infinite Games.Dietmar Berwanger
2007On the Complexity of Unary Tiling-Recognizable Picture Languages.Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati
2007A First Investigation of Sturmian Trees.Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2007The Polynomially Bounded Perfect Matching Problem Is in NCManindra Agrawal, Thanh Minh Hoang, Thomas Thierauf
1,2011,225 of 2,384← PreviousNext →

Comparable venues

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