default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSylvain Perifel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Olivier Carton, Sylvain Perifel:
Deterministic pushdown automata can compress some normal sequences. Log. Methods Comput. Sci. 20(3) (2024)- 2022
- [i12]Olivier Carton, Sylvain Perifel:
Deterministic pushdown automata can compress some normal sequences. CoRR abs/2205.00734 (2022) - 2021
- [c10]Nikhil Balaji
, Sylvain Perifel, Mahsa Shirmohammadi, James Worrell:
Cyclotomic Identity Testing and Applications. ISSAC 2021: 35-42 - 2020
- [i11]Nikhil Balaji, Sylvain Perifel, Mahsa Shirmohammadi, James Worrell:
Cyclotomic Identity Testing and Applications. CoRR abs/2007.13179 (2020)
2010 – 2019
- 2019
- [j8]Guillaume Lagarde, Guillaume Malod, Sylvain Perifel:
Non-commutative computations: lower bounds and polynomial identity testing. Chic. J. Theor. Comput. Sci. 2019 (2019) - 2018
- [c9]Guillaume Lagarde, Sylvain Perifel:
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. SODA 2018: 1478-1495 - 2017
- [i10]Guillaume Lagarde, Sylvain Perifel:
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. CoRR abs/1707.04312 (2017) - 2016
- [i9]Guillaume Lagarde, Guillaume Malod, Sylvain Perifel:
Non-commutative computations: lower bounds and polynomial identity testing. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j7]Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. Inf. Comput. 240: 31-41 (2015) - 2013
- [c8]Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. MFCS 2013: 433-444 - [i8]Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. CoRR abs/1304.5910 (2013) - 2012
- [c7]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. STOC 2012: 615-624 - 2011
- [j6]Pascal Koiran, Sylvain Perifel:
Interpolation in Valiant's Theory. Comput. Complex. 20(1): 1-20 (2011) - [j5]Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable. Theory Comput. Syst. 48(4): 731-766 (2011) - [i7]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. Electron. Colloquium Comput. Complex. TR11 (2011)
2000 – 2009
- 2009
- [j4]Pascal Koiran, Sylvain Perifel:
VPSPACE and a Transfer Theorem over the Reals. Comput. Complex. 18(4): 551-575 (2009) - [j3]Pascal Koiran, Sylvain Perifel:
VPSPACE and a transfer theorem over the complex field. Theor. Comput. Sci. 410(50): 5244-5251 (2009) - [c6]Pascal Koiran, Sylvain Perifel:
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent. CCC 2009: 35-40 - [i6]Pascal Koiran, Sylvain Perifel:
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent. CoRR abs/0902.1866 (2009) - [i5]Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable. CoRR abs/0903.4101 (2009) - 2008
- [j2]Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé:
Finding a vector orthogonal to roughly half a collection of vectors. J. Complex. 24(1): 39-53 (2008) - [c5]Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Pushdown Compression. STACS 2008: 39-48 - 2007
- [j1]Pascal Koiran, Sylvain Perifel:
The complexity of two problems on arithmetic circuits. Theor. Comput. Sci. 389(1-2): 172-181 (2007) - [c4]Sylvain Perifel:
Symmetry of Information and Nonuniform Lower Bounds. CSR 2007: 315-327 - [c3]Pascal Koiran, Sylvain Perifel:
VPSPACE and a Transfer Theorem over the Complex Field. MFCS 2007: 359-370 - [c2]Pascal Koiran, Sylvain Perifel:
VPSPACE and a Transfer Theorem over the Reals. STACS 2007: 417-428 - [i4]Pascal Koiran, Sylvain Perifel:
VPSPACE and a transfer theorem over the complex field. CoRR abs/0706.1477 (2007) - [i3]Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Pushdown Compression. CoRR abs/0709.2346 (2007) - [i2]Pascal Koiran, Sylvain Perifel:
Interpolation in Valiant's theory. CoRR abs/0710.0360 (2007) - 2006
- [c1]Pascal Koiran, Sylvain Perifel:
Valiant's Model: From Exponential Sums to Exponential Products. MFCS 2006: 596-607 - [i1]Pascal Koiran, Sylvain Perifel:
VPSPACE and a Transfer Theorem over the Reals. CoRR abs/cs/0610009 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
