Marie-Françoise Roy

Orcid: 0000-0002-6955-6491

According to our database1, Marie-Françoise Roy authored at least 57 papers between 1985 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A new general formula for the Cauchy index on an interval with subresultants.
J. Symb. Comput., 2022

Bounds for Polynomials on Algebraic Numbers and Application to Curve Topology.
Discret. Comput. Geom., 2022

2020
Sylvester double sums, subresultants and symmetric multivariate Hermite interpolation.
J. Symb. Comput., 2020

2019
A data analysis of women's trails among ICM speakers.
CoRR, 2019

2017
Elementary recursive quantifier elimination based on Thom encoding and sign determination.
Ann. Pure Appl. Log., 2017

2014
A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets.
Found. Comput. Math., 2014

Divide and Conquer Roadmap for Algebraic Sets.
Discret. Comput. Geom., 2014

On the computation of the topology of plane curves.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
New fast euclidean algorithms.
J. Symb. Comput., 2013

Zero-nonzero and real-nonreal sign determination
CoRR, 2013

2012
Complexity of deciding connectivity in real algebraic sets: recent results and future research directions.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
Sylvester double sums and subresultants.
J. Symb. Comput., 2011

2010
Bounding the radii of balls meeting every connected component of semi-algebraic sets.
J. Symb. Comput., 2010

2009
A bound on the minimum of a real positive polynomial over the standard simplex
CoRR, 2009

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions.
Comb., 2009

2008
Computing the First Betti Number of a Semi-Algebraic Set.
Found. Comput. Math., 2008

Quantitative results on quadratic semi-algebraic sets.
Electron. Notes Discret. Math., 2008

Certificates of Positivity in the Bernstein Basis.
Discret. Comput. Geom., 2008

2007
Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
CoRR, 2007

2006
An asymptotically tight bound on the number of connected components of realizable sign conditions
CoRR, 2006

Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets
CoRR, 2006

2005
Preface.
J. Symb. Comput., 2005

Generalized Budan-Fourier theorem and virtual roots.
J. Complex., 2005

Computing the euler-poincaré characteristics of sign conditions.
Comput. Complex., 2005

Computing the first Betti number and the connected components of semi-algebraic sets.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Subdiscriminant of symmetric matrices are sums of squares.
Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005

05021 Abstracts Collection -- Mathematics, Algorithms, Proofs.
Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005

An elementary characterisation of Krull dimension.
Proceedings of the From sets and types to topology and analysis, 2005

2001
Sylvester-Habicht Sequences and Fast Cauchy Index Computation.
J. Symb. Comput., 2001

Dynamical method in algebra: effective Nullstellensätze.
Ann. Pure Appl. Log., 2001

2000
New Structure Theorem for Subresultants.
J. Symb. Comput., 2000

Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation.
J. Complex., 2000

1998
Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety.
J. Complex., 1997

1996
Semi-algebraic Complexity of Quotients and Sign Determination of Remainders.
J. Complex., 1996

On the Combinatorial and Algebraic Complexity of Quantifier Elimination.
J. ACM, 1996

Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Computing the Complexification of a Semi-Algebraic Set.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1994
Spécialisation de la suite de Sturm.
RAIRO Theor. Informatics Appl., 1994

Description of the Connected Components of a Semialgebraic in Single Exponential Time.
Discret. Comput. Geom., 1994

Finding Irreducible Components of Some Real Transcendental Varieties.
Comput. Complex., 1994

Examples of Automatic Theorem Proving a Real Geometry.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993
On the Theoretical and Practical Complexity of the Existential Theory of Reals.
Comput. J., 1993

Aspect Graphs of Algebraic Surfaces.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992
NC Algorithms for Real Algebraic Numbers.
Appl. Algebra Eng. Commun. Comput., 1992

1990
Complexity of the Computation on Real Algebraic Numbers.
J. Symb. Comput., 1990

A Theorem on Random Polynomials and Some Consequences in Average Complexity.
J. Symb. Comput., 1990

Spécialisation de la suite de Sturm et sous-résulants.
RAIRO Theor. Informatics Appl., 1990

Algorithms in Real Algebraic Geometry and Applications to Computational Geometry.
Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface.
Proceedings of the Applied Algebra, 1990

Geometric Problems Solvable in Single Exponential Time.
Proceedings of the Applied Algebra, 1990

1989
Sturm-Habicht Sequence.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

On the Complexity of Semialgebraic Sets.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988
Thom's Lemma, the Coding of Real Algebraic Numbers and the Computation of the Topology of Semi-Algebraic Sets.
J. Symb. Comput., 1988

Curves and Computer Algebra.
Proceedings of the Geometry and Robotics, 1988

1987
On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve.
Proceedings of the Applied Algebra, 1987

1985
Logique et géométrie algébrique réelle.
Proceedings of the Logic Colloquium '85, Orsay, France, 1985


  Loading...