An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
Learning expressions and programs over monoids
Information and Computation
Learning expressions and programs over monoids
Information and Computation
An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
Languages with bounded multiparty communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Learning read-constant polynomials of constant degree modulo composites
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Definability of languages by generalized first-order formulas over (N,+)
STACS'06 Proceedings of the 23rd 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
Inexpressibility results for regular languages in nonregular settings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
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
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.00 |