International Symposium on Theoretical Aspects of Computer Science

STACS

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

2,384

1984–2026

Best Theory of Computation conferences

Papers per year

198482 peak2026

Most published authors

STACS papers

2,384 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
2004	Identifying Efficiently Solvable Cases of Max CSP.	David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
2004	Errata to Analysis of the Harmonic Algorithm for Three Servers.	Marek Chrobak, Jir Sgall
2004	Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.	Ioannis Caragiannis, Christos Kaklamanis
2004	Time-Space Tradeoff in Derandomizing Probabilistic Logspace.	Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek
2004	A Measured Collapse of the Modal -Calculus Alternation Hierarchy.	Doron Bustan, Orna Kupferman, Moshe Y. Vardi
2004	Individual Communication Complexity: Extended Abstract.	Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitnyi
2004	An Information Theoretic Lower Bound for Broadcasting in Radio Networks.	Carlos Brito, Eli Gafni, Shailesh Vaya
2004	The Complexity of Boolean Constraint Isomorphism.	Elmar Bhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2004	Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models.	Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
2004	The Syntactic Graph of a Sofic Shift.	Marie-Pierre Bal, Francesca Fiorenzi, Dominique Perrin
2004	Matching Algorithms Are Fast in Sparse Random Graphs.	Hannah Bast, Kurt Mehlhorn, Guido Schfer, Hisao Tamaki
2004	Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.	Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jir Sgall, Toms Tich
2004	The Minimal Logically-Defined NP-Complete Problem.	Rgis Barbanchon, Etienne Grandjean
2004	Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms.	Sebastian Bala
2004	Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines.	Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
2004	Effective Strong Dimension in Algorithmic Information and Computational Complexity.	Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
2004	Parallel Prefetching and Caching Is Hard.	Christoph Ambhl, Birgitta Weber
2004	Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.	Christoph Ambhl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
2004	Quantum Identification of Boolean Oracles.	Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita
2004	Algebraic Results on Quantum Automata.	Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thrien
2004	What Can be Efficiently Reduced to the K-Random Strings?	Eric Allender, Harry Buhrman, Michal Kouck
2004	The Plurality Problem with Three Colors.	Martin Aigner, Gianluca De Marco, Manuela Montangero
2003	On the Effective Jordan Decomposability.	Xizhong Zheng, Robert Rettinger, Burchard von Braunmhl
2003	How Does Computer Science Change Molecular Biology?	Alain Viari
2003	Logic as a Query Language: From Frege to XML.	Victor Vianu

1,376–1,400 of 2,384← Previous Next →

Comparable venues

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