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
1985	On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem.	Norbert Blum
1985	Layouts with Wires of Balanced Length.	Bernd Becker, Hans-Georg Osthof
1985	On Lovsz' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version).	Lszl Babai
1985	On the Relative Complexity of Subproblems of Intractable Problems.	Klaus Ambos-Spies
1984	A New Definition of Morphism on Petri Nets.	Glynn Winskel
1984	Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region.	Ondrej Skora, Imrich Vrto
1984	From Expanders to Better Superconcentrators without Cascading.	Eli Shamir
1984	Algebraic and Topological Theory of Languages and Computation, Part I: Theorems for Arbitrary Labguages Generalizing the Theorems of Eilenberg, Kleene, Schtzenberger and Straubing.	John Rhodes
1984	Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus.	Axel Poign
1984	Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible.	H. Perdrix
1984	Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphimes iteres.	Jean-Jacques Pansiot
1984	Logic Programs and Many-Valued Logic.	Alan Mycroft
1984	Algebre de machines et logique temporelle.	Max Michel
1984	Computability in Higher Types and the Universal Domain P_omega.	Giuseppe Longo, Simone Martini
1984	Covering Polygons with Minimum Number of Rectangles.	Christos Levcopoulos, Andrzej Lingas
1984	On a General Weight of Trees.	Rainer Kemp
1984	A Property of Three-Element Codes.	Juhani Karhumki
1984	On Expressive Interpretations of a Hoare-Logic for Clarke's Language L4.	Bernhard Josko
1984	Polynomial Time Inference of General Pattern Languages.	Klaus P. Jantke
1984	Automates a pile sur des alphabets infinis.	Jeanne Idt
1984	Approximation Schemes for Covering and Packing Problems in Robotics and VLSI.	Dorit S. Hochbaum, Wolfgang Maass
1984	Efficient Simulations among Several Models of Parallel Computers.	Friedhelm Meyer auf der Heide
1984	Adherence Equivalence Is Decidable for DOL Languages.	Tom Head
1984	Pushdown Space Complexity and Related Full-AFLs.	Joaquim Gabarr
1984	Blocage et vivacit dans les rseaux a pile-file.	Alain Finkel

2,351–2,375 of 2,384← Previous Next →

Comparable venues

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