Sylvain Perifel

According to our database1, Sylvain Perifel authored at least 16 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Deterministic pushdown automata can compress some normal sequences.
CoRR, 2022

2021
Cyclotomic Identity Testing and Applications.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2019
Non-commutative computations: lower bounds and polynomial identity testing.
Chic. J. Theor. Comput. Sci., 2019

2018
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2015
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant.
Inf. Comput., 2015

2011
Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable.
Theory Comput. Syst., 2011

Separating multilinear branching programs and formulas.
Electron. Colloquium Comput. Complex., 2011

Interpolation in Valiant's Theory.
Comput. Complex., 2011

2009
VPSPACE and a transfer theorem over the complex field.
Theor. Comput. Sci., 2009

VPSPACE and a Transfer Theorem over the Reals.
Comput. Complex., 2009

A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008
Finding a vector orthogonal to roughly half a collection of vectors.
J. Complex., 2008

Pushdown Compression.
Proceedings of the STACS 2008, 2008

2007
The complexity of two problems on arithmetic circuits.
Theor. Comput. Sci., 2007

Symmetry of Information and Nonuniform Lower Bounds.
Proceedings of the Computer Science, 2007

2006
Valiant's Model: From Exponential Sums to Exponential Products.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006


  Loading...