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
1999Eliminating Recursion in the µ-Calculus.Martin Otto
1999Finding Paths with the Right Cost.Matti Nyknen, Esko Ukkonen
1999Algorithms for Selfish Agents.Noam Nisan
1999Upper Bounds for Vertex Cover Further Improved.Rolf Niedermeier, Peter Rossmanith
1999A Modal Fixpoint Logic with Chop.Markus Mller-Olm
1999On Optimal Algorithms and Optimal Proof Systems.Jochen Mener
1999The Reduced Genus of a Multigraph.Patrice Ossona de Mendez
1999A Logical Characterisation of Linear Time on Nondeterministic Turing Machines.Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick
1999The Descriptive Complexity Approach to LOGCFL.Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1999The Weakness of Self-Complementation.Orna Kupferman, Moshe Y. Vardi
1999Approximating Bandwidth by Mixing Layouts of Interval Graphs.Dieter Kratsch, Lorna Stewart
1999Worst-case Equilibria.Elias Koutsoupias, Christos H. Papadimitriou
1999A Model of Behaviour Abstraction for Communicating Processes.Maciej Koutny, Giuseppe Pappalardo
1999New Branchwidth Territories.Ton Kloks, Jan Kratochvl, Haiko Mller
1999Some Undecidability Results Related to the Star Problem in Trace Monoids.Daniel Kirsten
1999Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions.Ming-Yang Kao, Andrzej Lingas, Anna stlin
1999Scheduling Dynamic Graphs.Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk
1999The Average Time Complexity to Compute Prefix Functions in Processor Networks.Andreas Jakoby
1999An Optimal Competitive Strategy for Walking in Streets.Christian Icking, Rolf Klein, Elmar Langetepe
1999Decidability and Undecidability of Marked PCP.Vesa Halava, Mika Hirvensalo, Ronald de Wolf
1999Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries.Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999Parallel Searching on m Rays.Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
1999Lower Bounds for Dynamic Algebraic Problems.Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
1999On Quantum Algorithms for Noncommutative Hidden Subgroups.Mark Ettinger, Peter Hyer
1999Space Bounds for Resolution.Juan Luis Esteban, Jacobo Torn
1,6261,650 of 2,384← PreviousNext →

Comparable venues

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