Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Marie-Françoise Roy
2010 – today
- 2013
[j26]Marie-Françoise Roy, Sidi Mohamed Sedjelmaci: New fast euclidean algorithms. J. Symb. Comput. 50: 208-226 (2013)- 2012
- [c17]Marie-Françoise Roy: Complexity of deciding connectivity in real algebraic sets: recent results and future research directions. ISSAC 2012: 3-5
- [i6]Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost: A baby step-giant step roadmap algorithm for general algebraic sets. CoRR abs/1201.6439 (2012)
- 2011
- [j25]Marie-Françoise Roy, Aviva Szpirglas: Sylvester double sums and subresultants. J. Symb. Comput. 46(4): 385-395 (2011)
- 2010
- [j24]Saugata Basu, Marie-Françoise Roy: Bounding the radii of balls meeting every connected component of semi-algebraic sets. J. Symb. Comput. 45(12): 1270-1279 (2010)
2000 – 2009
- 2009
- [j23]Saugata Basu, Richard Pollack, Marie-Françoise Roy: An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions. Combinatorica 29(5): 523-546 (2009)
- [i5]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)
- [i4]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
- [j22]Fatima Boudaoud, Fabrizio Caruso, Marie-Françoise Roy: Certificates of Positivity in the Bernstein Basis. Discrete & Computational Geometry 39(4): 639-655 (2008)
- [j21]Marie-Françoise Roy: Quantitative results on quadratic semi-algebraic sets. Electronic Notes in Discrete Mathematics 31: 129 (2008)
- [j20]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
- [i3]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
- [e1]Thierry Coquand, Henri Lombardi, Marie-Françoise Roy (Eds.): Mathematics, Algorithms, Proofs, 9.-14. January 2005. Dagstuhl Seminar Proceedings 05021, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- [i2]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)
- [i1]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
- [j19]Saugata Basu, Richard Pollack, Marie-Françoise Roy: Computing the euler-poincaré characteristics of sign conditions. Computational Complexity 14(1): 53-71 (2005)
- [j18]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)
- [j17]Arjeh M. Cohen, Gert-Martin Greuel, Marie-Françoise Roy: Preface. J. Symb. Comput. 39(3-4): 257-258 (2005)
- [c16]Thierry Coquand, Henri Lombardi, Marie-Françoise Roy: 05021 Abstracts Collection -- Mathematics, Algorithms, Proofs. Mathematics, Algorithms, Proofs 2005
- [c15]Marie-Françoise Roy: Subdiscriminant of symmetric matrices are sums of squares. Mathematics, Algorithms, Proofs 2005
- [c14]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
- 2001
- [j16]Michel Coste, Henri Lombardi, Marie-Françoise Roy: Dynamical method in algebra: effective Nullstellensätze. Ann. Pure Appl. Logic 111(3): 203-256 (2001)
- [j15]Thomas Lickteig, Marie-Françoise Roy: Sylvester-Habicht Sequences and Fast Cauchy Index Computation. J. Symb. Comput. 31(3): 315-341 (2001)
- 2000
- [j14]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)
- [j13]Henri Lombardi, Marie-Françoise Roy, Mohab Safey El Din: New Structure Theorem for Subresultants. J. Symb. Comput. 29(4-5): 663-689 (2000)
1990 – 1999
- 1998
- [c13]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
- [j12]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
- [j11]Saugata Basu, Richard Pollack, Marie-Françoise Roy: On the Combinatorial and Algebraic Complexity of Quantifier Elimination. J. ACM 43(6): 1002-1045 (1996)
- [j10]Thomas Lickteig, Marie-Françoise Roy: Semi-algebraic Complexity of Quotients and Sign Determination of Remainders. J. Complexity 12(4): 545-571 (1996)
- [c12]Marie-Françoise Roy, Nicolai Vorobjov: Computing the Complexification of a Semi-Algebraic Set. ISSAC 1996: 26-34
- [c11]Saugata Basu, Richard Pollack, Marie-Françoise Roy: Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract). STOC 1996: 168-173
- 1994
- [j9]Marie-Françoise Roy, Nicolai Vorobjov: Finding Irreducible Components of Some Real Transcendental Varieties. Computational Complexity 4: 107-132 (1994)
- [j8]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)
- [j7]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)
- [c10]Saugata Basu, Richard Pollack, Marie-Françoise Roy: On the Combinatorial and Algebraic Complexity of Quantifier Elimination. FOCS 1994: 632-641
- [c9]Ahmed Guergueb, Jean Mainguené, Marie-Françoise Roy: Examples of Automatic Theorem Proving a Real Geometry. ISSAC 1994: 20-24
- 1993
- [j6]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)
- [c8]
- 1992
- [j5]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
- [j4]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)
- [j3]Marie-Françoise Roy, Aviva Szpirglas: Complexity of the Computation on Real Algebraic Numbers. J. Symb. Comput. 10(1): 39-52 (1990)
- [j2]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)
- [c7]Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó: Geometric Problems Solvable in Single Exponential Time. AAECC 1990: 11-23
- [c6]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
1980 – 1989
- 1989
- [c5]Joos Heintz, Pablo Solernó, Marie-Françoise Roy: On the Complexity of Semialgebraic Sets. IFIP Congress 1989: 293-298
- [c4]L. Gonzalez, Henri Lombardi, Tomás Recio, Marie-Françoise Roy: Sturm-Habicht Sequence. ISSAC 1989: 136-146
- 1988
- [j1]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)
- [c3]Dominique Duval, Marie-Françoise Roy: Curves and Computer Algebra. Geometry and Robotics 1988: 28-42
- 1987
- [c2]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
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:53 CEST by the dblp team