Satisfiability of Systems of Equations over Finite Monoids
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Learning Expressions over Monoids
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Algebraic Characterizations of Small Classes of Boolean Functions
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Complete Classifications for the Communication Complexity of Regular Languages
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An Application of Hindman's Theorem to a Problem on Communication Complexity
Combinatorics, Probability and Computing
Learning expressions and programs over monoids
Information and Computation
On the Non-deterministic Communication Complexity of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning expressions and programs over monoids
Information and Computation
Languages with bounded multiparty communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The multiparty communication complexity of exact-T: improved bounds and new problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |