default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Sedoglavic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Jean-Guillaume Dumas
, Clément Pernet, Alexandre Sedoglavic:
Strassen's algorithm is not optimally accurate. ISSAC 2024: 254-263- [i11]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Strassen's algorithm is not optimally accurate. CoRR abs/2402.05630 (2024) - 2023
- [j5]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Some fast algorithms multiplying a matrix by its adjoint. J. Symb. Comput. 115: 285-315 (2023) - 2021
- [c9]Alexandre Sedoglavic, Alexey V. Smirnov:
The Tensor Rank of 5x5 Matrices Multiplication is Bounded by 98 andIts Border Rank by 89. ISSAC 2021: 345-351 - [i10]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
Some fast algorithms multiplying a matrix by its adjoint. CoRR abs/2101.01025 (2021) - [i9]Alexandre Sedoglavic, Alexey V. Smirnov:
The tensor rank of 5x5 matrices multiplication is bounded by 98 and its border rank by 89. CoRR abs/2101.12568 (2021) - 2020
- [c8]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
On fast multiplication of a matrix by its transpose. ISSAC 2020: 162-169 - [i8]Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
On fast multiplication of a matrix by its transpose. CoRR abs/2001.04109 (2020)
2010 – 2019
- 2017
- [i7]Alexandre Sedoglavic:
Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies. CoRR abs/1703.08298 (2017) - [i6]Alexandre Sedoglavic:
A non-commutative algorithm for multiplying 5 $\times$ 5 matrices using 99 multiplications. CoRR abs/1707.06860 (2017) - [i5]Alexandre Sedoglavic:
A non-commutative algorithm for multiplying (7×7) matrices using 250 multiplications. CoRR abs/1712.07935 (2017) - 2011
- [j4]Lisi D'Alfonso, Gabriela Jeronimo, François Ollivier, Alexandre Sedoglavic, Pablo Solernó:
A geometric index reduction method for implicit systems of differential algebraic equations. J. Symb. Comput. 46(10): 1114-1138 (2011) - [c7]François Boulier, François Lemaire, Alexandre Sedoglavic:
On the Regularity Property of Differential Polynomials Modulo Regular Differential Chains. CASC 2011: 61-72 - [c6]François Boulier, François Lemaire, Michel Petitot, Alexandre Sedoglavic:
Chemical Reaction Systems, Computer Algebra and Systems Biology - (Invited Talk). CASC 2011: 73-87 - 2010
- [c5]Masahiko Nakatsui, Alexandre Sedoglavic, François Lemaire, François Boulier, Asli Ürgüplü, Katsuhisa Horimoto:
A General Procedure for Accurate Parameter Estimation in Dynamic Systems Using New Estimation Errors. ANB 2010: 149-166 - [i4]Lisi D'Alfonso, Gabriela Jeronimo, François Ollivier, Alexandre Sedoglavic, Pablo Solernó:
A Geometric Index Reduction Method for Implicit Systems of Differential Algebraic Equations. CoRR abs/1008.5080 (2010)
2000 – 2009
- 2009
- [j3]François Boulier, François Lemaire, Alexandre Sedoglavic, Asli Ürgüplü:
Towards an Automated Reduction Method for Polynomial ODE Models of Biochemical Reaction Systems. Math. Comput. Sci. 2(3): 443-464 (2009) - 2007
- [c4]Alexandre Sedoglavic:
Reduction of Algebraic Parametric Systems by Rectification of Their Affine Expanded Lie Symmetries. AB 2007: 277-291 - [c3]Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
Fast computation of power series solutions of systems of differential equations. SODA 2007: 1012-1021 - 2006
- [i3]Evelyne Hubert, Alexandre Sedoglavic:
Polynomial Time Nondimensionalisation of Ordinary Differential Equations via their Lie Point Symmetries. CoRR abs/cs/0604060 (2006) - [i2]Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
Fast computation of power series solutions of systems of differential equations. CoRR abs/cs/0604101 (2006) - [i1]Alexandre Sedoglavic:
Reduction of Algebraic Parametric Systems by Rectification of their Affine Expanded Lie Symmetries. CoRR abs/cs/0612094 (2006) - 2003
- [j2]Guillermo Matera, Alexandre Sedoglavic:
Fast computation of discrete invariants associated to a differential rational mapping. J. Symb. Comput. 36(3-4): 473-499 (2003) - 2002
- [j1]Alexandre Sedoglavic:
A Probabilistic Algorithm to Test Local Algebraic Observability in Polynomial Time. J. Symb. Comput. 33(5): 735-755 (2002) - [c2]Guillermo Matera, Alexandre Sedoglavic:
The differential Hilbert function of a differential rational mapping can be computed in polynomial time. ISSAC 2002: 184-191 - 2001
- [b1]Alexandre Sedoglavic:
Méthodes seminumériques en algèbre différentielle~; applications à l'étude des propriétés structurelles de systèmes différentiels algébriques en automatique. École Polytechnique, Palaiseau, France, 2001 - [c1]Alexandre Sedoglavic:
A probabilistic algorithm to test local algebraic observability in polynomial time. ISSAC 2001: 309-317
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 2025-01-21 00:16 CET 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:
