J. Maurice Rojas Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Bihan, J. Maurice Rojas, Casey E. Stella: Faster real feasibility via circuit discriminants. ISSAC 2009: 39-46
2008
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Book Review S. Basu, R. Pollack, and M.-F. Roy: Algorithms in Real Algebraic Geometry. Foundations of Computational Mathematics 8(6): 765-771 (2008)
2007
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoel Gomez, Andrew Niles, J. Maurice Rojas: New Complexity Bounds for Certain Real Fewnomial Zero Sets CoRR abs/0709.2405: (2007)
2005
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Efficiently Detecting Torsion Points and Subtori CoRR abs/math/0501388: (2005)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas, Yinyu Ye: On solving univariate sparse polynomials in logarithmic time. J. Complexity 21(1): 87-110 (2005)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJerod Parsons, J. Bradley Holmes, J. Maurice Rojas, Jerry Tsai, Charlie E. M. Strauss: Practical conversion from torsion space to Cartesian space for in silico protein synthesis. Journal of Computational Chemistry 26(10): 1063-1068 (2005)
2004
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas, Casey E. Stella: New Complexity Thresholds for Sparse Real Polynomials and A-discriminants CoRR math.AG/0411107: (2004)
2003
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture CoRR math.NT/0304100: (2003)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTien-Yien Li, J. Maurice Rojas, Xiaoshen Wang: Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces. Discrete & Computational Geometry 30(3): 379-414 (2003)
2002
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields. ANTS 2002: 506-516
2001
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Computational Arithmetic Geometry I. Sentences Nearly in the Polynomial Hierarchy. J. Comput. Syst. Sci. 62(2): 216-235 (2001)
2000
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Some Speed-Ups and Speed Limits for Real Algebraic Geometry. J. Complexity 16(3): 552-571 (2000)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Uncomputably large integral points on algebraic plane curves? Theor. Comput. Sci. 235(1): 145-162 (2000)
1999
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: On the Complexity of Diophantine Geometry in Low Dimensions (Abstract). IEEE Conference on Computational Complexity 1999: 3
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: On the Complexity of Diophantine Geometry in Low Dimensions (Extended Abstract). STOC 1999: 527-536
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Solving Degenerate Sparse Polynomial Systems Faster. J. Symb. Comput. 28(1-2): 155-186 (1999)
1998
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting. ESA 1998: 127-138
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Solving Degenerate Sparse Polynomial Systems Faster CoRR math.AG/9809071: (1998)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: Uncomputably Large Integral Points on Algebraic Plane Curves? CoRR math.NT/9809009: (1998)
1996
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas, Xiaoshen Wang: Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes. J. Complexity 12(2): 116-133 (1996)
1994
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJ. Maurice Rojas: A Convex Geometric Approach to Counting the Roots of a Polynomial System. Theor. Comput. Sci. 133(1): 105-140 (1994)
1991
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn F. Canny, J. Maurice Rojas: An Optimal Condition for Determining the Exact Number of Roots of a Polynomial System. ISSAC 1991: 96-102

Coauthor Index

1Frédéric Bihan [22]
2John F. Canny (John Canny) [1]
3Joel Gomez [20]
4J. Bradley Holmes [17]
5Tien-Yien Li [14]
6Andrew Niles [20]
7Jerod Parsons [17]
8Casey E. Stella [16] [22]
9Charlie E. M. Strauss [17]
10Jerry Tsai [17]
11Xiaoshen Wang [3] [14]
12Yinyu Ye [18]

Colors in the list of coauthors

Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)