Algebraic complexity of path problems
Algebraic complexity theory. I: An introduction. (Algebraische Komplexitätstheorie. I: Eine Einführung.)
Algebraic complexity theory. II: Tast matrix multiplication and combinatorics. (Algebraische Komplexitätstheorie. II: Schnelle Matrixmultiplikation und Kombinatorik.)
Algebraic complexity theory. III: On the complexity of the computation of permanents. (Algebraische Komplexitätstheorie. III: Zur Berechnungskomplexität von Permanenten.)
Algebraic elimination of -transitions.
Algèbres non déterministiques et -catégories
Algorithme quadratique de calcul de la solution générale d'équations en mots à une variable
Algorithmen zur Unimodalitötsbestimmung einfacher Polygone
Algorithmes polynomiaux pour la recherche d'un chemin optimal dans une scène planifiée
Algorithmes universels
Algorithmic algebras of computers
Algorithmical complexity of some statistical decision processes. I
Algorithmical complexity of some statistical decision processes. II
Algorithmically definable functions (A contribution towards the semantics of programming languages) [Book]
Algorithms for determining the model structure of a controlled system
Algorithms for Ham Sandwich Cuts.
Algorithms for weighted graph problems on the modified cellular graph automaton
Almost Tight Bounds for e-Nets.
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
Amenable groups and cellular automata
We show that the theorems of Moore and Myhill hold for cellular automata whose universes are Cayley graphs of amenable finitely generated groups. This extends the analogous result of A. Machi and F. Mignosi “Garden of Eden configurations for cellular automata on Cayley graphs of groups” for groups of sub-exponential growth.