| 2009 |
44 | | Saugata Basu,
Richard Leroy,
Marie-Françoise Roy:
A bound on the minimum of a real positive polynomial over the standard simplex
CoRR abs/0902.3304: (2009) |
43 | | Saugata Basu,
Marie-Françoise Roy:
Bounding the radii of balls meeting every connected component of semi-algebraic sets
CoRR abs/0911.1340: (2009) |
| 2008 |
42 | | Fatima Boudaoud,
Fabrizio Caruso,
Marie-Françoise Roy:
Certificates of Positivity in the Bernstein Basis.
Discrete & Computational Geometry 39(4): 639-655 (2008) |
41 | | Marie-Françoise Roy:
Quantitative results on quadratic semi-algebraic sets.
Electronic Notes in Discrete Mathematics 31: 129 (2008) |
40 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing the First Betti Number of a Semi-Algebraic Set.
Foundations of Computational Mathematics 8(1): 97-136 (2008) |
| 2007 |
39 | | Saugata Basu,
Dmitrii V. Pasechnik,
Marie-Françoise Roy:
Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
CoRR abs/0708.3522: (2007) |
| 2006 |
38 | | Thierry Coquand,
Henri Lombardi,
Marie-Françoise Roy:
Mathematics, Algorithms, Proofs, 9.-14. January 2005
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
37 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets
CoRR abs/math/0603248: (2006) |
36 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
An asymptotically tight bound on the number of connected components of realizable sign conditions
CoRR abs/math/0603256: (2006) |
| 2005 |
35 | | Thierry Coquand,
Henri Lombardi,
Marie-Françoise Roy:
05021 Abstracts Collection -- Mathematics, Algorithms, Proofs.
Mathematics, Algorithms, Proofs 2005 |
34 | | Marie-Françoise Roy:
Subdiscriminant of symmetric matrices are sums of squares.
Mathematics, Algorithms, Proofs 2005 |
33 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing the first Betti number and the connected components of semi-algebraic sets.
STOC 2005: 304-312 |
32 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing the euler-poincaré characteristics of sign conditions.
Computational Complexity 14(1): 53-71 (2005) |
31 | | Michel Coste,
Tomás Lajous-Loaeza,
Henri Lombardi,
Marie-Françoise Roy:
Generalized Budan-Fourier theorem and virtual roots.
J. Complexity 21(4): 479-486 (2005) |
30 | | Arjeh M. Cohen,
Gert-Martin Greuel,
Marie-Françoise Roy:
Preface.
J. Symb. Comput. 39(3-4): 257-258 (2005) |
| 2001 |
29 | | Michel Coste,
Henri Lombardi,
Marie-Françoise Roy:
Dynamical method in algebra: effective Nullstellensätze.
Ann. Pure Appl. Logic 111(3): 203-256 (2001) |
28 | | Thomas Lickteig,
Marie-Françoise Roy:
Sylvester-Habicht Sequences and Fast Cauchy Index Computation.
J. Symb. Comput. 31(3): 315-341 (2001) |
| 2000 |
27 | | Fabrice Rouillier,
Marie-Françoise Roy,
Mohab Safey El Din:
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation.
J. Complexity 16(4): 716-750 (2000) |
26 | | Henri Lombardi,
Marie-Françoise Roy,
Mohab Safey El Din:
New Structure Theorem for Subresultants.
J. Symb. Comput. 29(4-5): 663-689 (2000) |
| 1998 |
25 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set.
ISSAC 1998: 25-29 |
| 1997 |
24 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety.
J. Complexity 13(1): 28-37 (1997) |
| 1996 |
23 | | Marie-Françoise Roy,
Nicolai Vorobjov:
Computing the Complexification of a Semi-Algebraic Set.
ISSAC 1996: 26-34 |
22 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract).
STOC 1996: 168-173 |
21 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
On the Combinatorial and Algebraic Complexity of Quantifier Elimination.
J. ACM 43(6): 1002-1045 (1996) |
20 | | Thomas Lickteig,
Marie-Françoise Roy:
Semi-algebraic Complexity of Quotients and Sign Determination of Remainders.
J. Complexity 12(4): 545-571 (1996) |
| 1994 |
19 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
On the Combinatorial and Algebraic Complexity of Quantifier Elimination
FOCS 1994: 632-641 |
18 | | Ahmed Guergueb,
Jean Mainguené,
Marie-Françoise Roy:
Examples of Automatic Theorem Proving a Real Geometry.
ISSAC 1994: 20-24 |
17 | | Marie-Françoise Roy,
Nicolai Vorobjov:
Finding Irreducible Components of Some Real Transcendental Varieties.
Computational Complexity 4: 107-132 (1994) |
16 | | Joos Heintz,
Marie-Françoise Roy,
Pablo Solernó:
Description of the Connected Components of a Semialgebraic in Single Exponential Time.
Discrete & Computational Geometry 11: 121-140 (1994) |
15 | | Laureano González-Vega,
Henri Lombardi,
Tomás Recio,
Marie-Françoise Roy:
Spécialisation de la suite de Sturm.
ITA 28(1): 1-24 (1994) |
| 1993 |
14 | | Marie-Françoise Roy:
Aspect Graphs of Algebraic Surfaces.
ISSAC 1993: 135-143 |
13 | | Joos Heintz,
Marie-Françoise Roy,
Pablo Solernó:
On the Theoretical and Practical Complexity of the Existential Theory of Reals.
Comput. J. 36(5): 427-431 (1993) |
| 1992 |
12 | | Felipe Cucker,
Hervé Lanneau,
Bud Mishra,
Paul Pedersen,
Marie-Françoise Roy:
NC Algorithms for Real Algebraic Numbers.
Appl. Algebra Eng. Commun. Comput. 3: 79-98 (1992) |
| 1990 |
11 | | Joos Heintz,
Teresa Krick,
Marie-Françoise Roy,
Pablo Solernó:
Geometric Problems Solvable in Single Exponential Time.
AAECC 1990: 11-23 |
10 | | Joos Heintz,
Marie-Françoise Roy,
Pablo Solernó:
Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface.
AAECC 1990: 180-196 |
9 | | Laureano González-Vega,
Henri Lombardi,
Tomás Recio,
Marie-Françoise Roy:
Spécialisation de la suite de Sturm et sous-résulants.
ITA 24: 561- (1990) |
8 | | Marie-Françoise Roy,
A. Szpirglas:
Complexity of the Computation on Real Algebraic Numbers.
J. Symb. Comput. 10(1): 39-52 (1990) |
7 | | Felipe Cucker,
Marie-Françoise Roy:
Kac's Theorem on the Number of Real Roots and its Consequences in Average Complexity.
J. Symb. Comput. 10(5): 405-410 (1990) |
| 1989 |
6 | | Joos Heintz,
Pablo Solernó,
Marie-Françoise Roy:
On the Complexity of Semialgebraic Sets.
IFIP Congress 1989: 293-298 |
5 | | L. Gonzalez,
Henri Lombardi,
Tomás Recio,
Marie-Françoise Roy:
Sturm-Habicht Sequence.
ISSAC 1989: 136-146 |
| 1988 |
4 | | Dominique Duval,
Marie-Françoise Roy:
Curves and Computer Algebra.
Geometry and Robotics 1988: 28-42 |
3 | | Michel Coste,
Marie-Françoise Roy:
Thom's Lemma, the Coding of Real Algebraic Numbers and the Computation of the Topology of Semi-Algebraic Sets.
J. Symb. Comput. 5(1/2): 121-129 (1988) |
| 1987 |
2 | | Felipe Cucker,
Luis Miguel Pardo,
Mario Raimondo,
Tomás Recio,
Marie-Françoise Roy:
On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve.
AAECC 1987: 161-181 |
| 1985 |
1 | | Marie-Françoise Roy:
Logique et géométrie algébrique réelle.
Logic Colloquium 1985: 267-280 |