Sylvain Perifel

Centre National de la Recherche Scientifique — France

Computer Science · Physical Sciences

8h-index142citations31works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(15), semigroups and automata theory(9), Polynomial and algebraic computation(7), Computability, Logic, AI Algorithms(7), Formal Methods in Verification(6)

Publications31 total

Deterministic pushdown automata can compress some normal sequences
Logical Methods in Computer Science·2024Open Access
Deterministic pushdown automata can compress some normal sequences
arXiv (Cornell University)·2022Open Access
Cyclotomic Identity Testing and Applications
2021Open Access
Untitled
Chicago Journal of Theoretical Computer Science·2019Open Access
Lempel-Ziv: a “one-bit catastrophe” but not a tragedy
Society for Industrial and Applied Mathematics eBooks·2018Open Access
Non-commutative computations: lower bounds and polynomial identity testing.
2016· 3 cited
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
Information and Computation·2014
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
arXiv (Cornell University)·2013Open Access
On fixed-polynomial size circuit lower bounds for uniform polynomials in\n the sense of Valiant
arXiv (Cornell University)·2013Open Access
On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant
Lecture notes in computer science·2013· 1 cited
Separating multilinear branching programs and formulas
2012· 25 cited
Interpolation in Valiant’s Theory
Computational Complexity·2011· 15 citedOpen Access
Separating multilinear branching programs and formulas.
2011
Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable
Theory of Computing Systems·2010· 8 cited
VPSPACE and a Transfer Theorem over the Reals
Computational Complexity·2009· 16 cited
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mstyle mathvariant="sans-serif"><mml:mi>VPSPACE</mml:mi></mml:mstyle></mml:math> and a transfer theorem over the complex field
Theoretical Computer Science·2009· 11 cited
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
2009· 14 citedOpen Access
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
arXiv (Cornell University)·2009Open Access
On the construction of a family of transversal subspaces over finite fields
Linear Algebra and its Applications·2008· 2 cited
Interpolation in Valiant's theory
arXiv (Cornell University)·2007Open Access
page 1 of 2Next →

Frequent Co-authors

Pascal Koiran(14), Hervé Fournier(5), Guillaume Malod(4), Rémi de Joannis de Verclos(4), Elvira Mayordomo(3), Philippe Moser(3), Guillaume Lagarde(3), Zeev Dvir(2), Amir Yehudayoff(2), Olivier Carton(2), Pierre Charbit(1), Emmanuel Jeandel(1), Stéphan Thomassé(1), Pilar Albert(1), A. L. Chistov(1), Nikhil Balaji(1), Mahsa Shirmohammadi(1), James Worrell(1)