The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
J. Maurice Rojas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. J. Maurice Rojas
    Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 2002, pp:506-516 [Conf]
  2. J. Maurice Rojas
    On the Complexity of Diophantine Geometry in Low Dimensions (Abstract). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:3- [Conf]
  3. J. Maurice Rojas
    Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:127-138 [Conf]
  4. John F. Canny, J. Maurice Rojas
    An Optimal Condition for Determining the Exact Number of Roots of a Polynomial System. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1991, pp:96-102 [Conf]
  5. J. Maurice Rojas
    On the Complexity of Diophantine Geometry in Low Dimensions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:527-536 [Conf]
  6. J. Maurice Rojas, Casey E. Stella
    New Complexity Thresholds for Sparse Real Polynomials and A-discriminants [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  7. J. Maurice Rojas
    Solving Degenerate Sparse Polynomial Systems Faster [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  8. J. Maurice Rojas
    A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  9. J. Maurice Rojas
    Uncomputably Large Integral Points on Algebraic Plane Curves? [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  10. Tien-Yien Li, J. Maurice Rojas, Xiaoshen Wang
    Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:3, pp:379-414 [Journal]
  11. J. Maurice Rojas
    Some Speed-Ups and Speed Limits for Real Algebraic Geometry. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:3, pp:552-571 [Journal]
  12. J. Maurice Rojas, Xiaoshen Wang
    Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1996, v:12, n:2, pp:116-133 [Journal]
  13. J. Maurice Rojas, Yinyu Ye
    On solving univariate sparse polynomials in logarithmic time. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:1, pp:87-110 [Journal]
  14. Jerod 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Chemistry, 2005, v:26, n:10, pp:1063-1068 [Journal]
  15. J. Maurice Rojas
    Computational Arithmetic Geometry I. Sentences Nearly in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:216-235 [Journal]
  16. J. Maurice Rojas
    Solving Degenerate Sparse Polynomial Systems Faster. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1999, v:28, n:1-2, pp:155-186 [Journal]
  17. J. Maurice Rojas
    Uncomputably large integral points on algebraic plane curves? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:235, n:1, pp:145-162 [Journal]
  18. J. Maurice Rojas
    A Convex Geometric Approach to Counting the Roots of a Polynomial System. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:105-140 [Journal]
  19. J. Maurice Rojas
    Efficiently Detecting Torsion Points and Subtori [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  20. Joel Gomez, Andrew Niles, J. Maurice Rojas
    New Complexity Bounds for Certain Real Fewnomial Zero Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  21. Faster real feasibility via circuit discriminants. [Citation Graph (, )][DBLP]


  22. Near NP-Completeness for Detecting p-adic Rational Roots in One Variable [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002