- An algebraic approach to communication complexity
- Lower bounds for circuits with MODm gates Arkadev Chattopadhyay #
- Bounded-depth circuits: separating wires from gates Michal Kouck y y
- Threshold Circuits of Small MajorityDepth Alexis Maciel \Lambda
- Journal of Automata, Languages and Combinatorics u (v) w, x{y Otto-von-Guericke-Universitat Magdeburg
- Noname manuscript No. (will be inserted by the editor)
- Multiparty Communication Complexity of Finite Monoids
- Circuits and Expressions with NonAssociative Gates
- Rings and Integer Lattices in Computer Science Notes from a series of lectures by
- Errorcorrecting Codes and Computational Complexity Notes from a series of lectures by
- The Many Faces of a Translation Pierre McKenzie 1? , Thomas Schwentick 2 ,
- Satis ability of Systems of Equations over Finite Cristopher Moore 1 , Pascal Tesson 2 , and Denis Th erien 2?
- Rings and Integer Lattices in Computer Science: A Barbados Workshop Proposal
- The bideterministic concatenation product Jean-Eric Pin and Denis Th erien
- Modular Temporal Logic Augustin Baziramwabo \Lambda
- Programs over semigroups of dot-depth one Alexis Maciel 1
- TOCS manuscript No. (will be inserted by the editor)
- Lectures on Proof Theory Samuel R. Buss
- Lower Bounds for Algebraic Circuits Notes from a series of lectures by
- Learning Expressions and Programs over Ricard Gavald`a \Lambda
- Nesting Until and Since in Linear Temporal Logic (Full Paper)
- Partially-ordered Two-way Automata: A New Characterization of DA
- A Very Partial Bibliography [Bod93] H.L. Bodlaender. A linear-time algorithm for nding tree-
- Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups
- A Note on MOD p MOD m Circuits Howard Straubing 1 and Denis Th'erien 2
- Over Words, Two Variables Are as Powerful as One Quantifier Alternation: FO 2 = \Sigma 2 `` \Pi 2
- Tractable Clones of Polynomials over V'ictor Dalmau \Lambda Ricard Gavald`a y Pascal Tesson z
- An Algebraic Approach to Data Languages and Timed Languages
- Finite loops recognize exactly the regular open languages \Lambda
- Restricted Two-Variable FO+MOD Sentences, Circuits and Communication Complexity
- Data Stream Algorithms Notes from a series of lectures by
- 2004 Barbados Workshop on Computational Complexity LECTURE NOTES ON FINITE METRIC SPACES AND LOWDIMENSIONAL EMBEDDINGS
- DIAMONDS ARE FOREVER: THE VARIETY DA
- The DotDepth and the Polynomial Hierarchy Correspond on the Delta Levels
- August 8, 2001 Some results on the generalized star-height
- Learning Expressions over Monoids (Extended Abstract)
- Polyabelian loops and Boolean completeness Fran cois Lemieux y Cristopher Moore z and Denis Th erien x
- Logical Methods in Computer Science Volume 00, Number 0, Pages 000000
- An Algebraic Point of View on the Crane-Beach Clemens Lautemann, Pascal Tesson 1
- Elliptic Curves Notes from a series of lectures by
- Regular Languages De ned by Generalized First-Order Formulas with a Bounded Number
- Weakly Iterated Block Products of Finite Howard Straubing 1 and Denis Th erien 2?
- Complete Classi cations for the Communication Complexity of Regular Languages
- Algebraic Characterizations of Small Classes of Boolean Functions
- Algebraic Results on Quantum Automata Andris Ambainis 1 , Martin Beaudry 2 , Marats Golovkins 1 , Arnolds K ikusts 1 ,