Marc Giusti

According to our database1, Marc Giusti authored at least 31 papers between 1984 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Special issue "International Conference on Coding and Cryptography" Algiers, Algeria, November 2-5, 2015.
Appl. Algebra Eng. Commun. Comput., 2017

2015
Degeneracy Loci and Polynomial Equation Solving.
Found. Comput. Math., 2015

2014
Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity.
Math. Comput., 2014

Intrinsic complexity estimates in polynomial optimization.
J. Complex., 2014

2012
Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces.
Found. Comput. Math., 2012

2011
The evaluation of geometric queries: constraint databases and quantifier elimination
CoRR, 2011

2010
Effective methods in algebraic geometry 2009: Barcelona. Guest editors' foreword.
J. Symb. Comput., 2010

On the geometry of polar varieties.
Appl. Algebra Eng. Commun. Comput., 2010

2009
On the intrinsic complexity of point finding in real singular hypersurfaces.
Inf. Process. Lett., 2009

A Gröbner free alternative to solving and a geometric analogue to Cook's thesis.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008
Foreword.
Int. J. Control, 2008

2007
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One.
Found. Comput. Math., 2007

2005
Generalized polar varieties: geometry and algorithms.
J. Complex., 2005

On Location and Approximation of Clusters of Zeros of Analytic Functions.
Found. Comput. Math., 2005

2004
Generalized polar varieties and an efficient real elimination.
Kybernetika, 2004

2003
Preface.
J. Symb. Comput., 2003

The Hardness of Polynomial Equation Solving.
Found. Comput. Math., 2003

2001
A Gröbner Free Alternative for Polynomial System Solving.
J. Complex., 2001

2000
The Projective Noether Maple Package: Computing the Dimension of a Projective Variety.
J. Symb. Comput., 2000

1999
Solving Some Overdetermined Polynomial Systems.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1997
Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case.
J. Complex., 1997

1995
When Polynomial Equation Systems Can Be "Solved" Fast?.
Proceedings of the Applied Algebra, 1995

1993
On the Efficiency of Effective Nullstellensätze.
Comput. Complex., 1993

1991
The membership problem for unmixed polynomial ideals is solvable in single exponential time.
Discret. Appl. Math., 1991

1990
Complexity of Standard Bases in Projective Dimension Zero II.
Proceedings of the Applied Algebra, 1990

1989
On the Castelnuovo Regularity for Curves.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988
Combinatorial Dimension Theory of Algebraic Varieties.
J. Symb. Comput., 1988

Algebraic Transformations of Polynomial Equations, Symmetric Polynomials and Elimination.
Proceedings of the Symbolic and Algebraic Computation, 1988

1987
Complexity of standard bases in projective dimension zero.
Proceedings of the EUROCAL '87, 1987

1985
A Note on the Complexity of Constructing Standard Bases.
Proceedings of the EUROCAL '85, 1985

1984
Some Effectivity Problems in Polynomial Ideal Theory.
Proceedings of the EUROSAM 84, 1984


  Loading...