Elias P. Tsigaridas

Orcid: 0009-0003-5015-3988

According to our database1, Elias P. Tsigaridas authored at least 104 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Segre-driven radicality testing.
J. Symb. Comput., May, 2024

Randomized Control in Performance Analysis and Empirical Asset Pricing.
CoRR, 2024

2023
On the Complexity of Chow and Hurwitz Forms.
ACM Commun. Comput. Algebra, December, 2023

Truncated Log-concave Sampling for Convex Bodies with Reflective Hamiltonian Monte Carlo.
ACM Trans. Math. Softw., June, 2023

Trifocal Relative Pose From Lines at Points.
IEEE Trans. Pattern Anal. Mach. Intell., June, 2023

Condition numbers for the cube. I: Univariate polynomials and hypersurfaces.
J. Symb. Comput., 2023

PTOPO: Computing the geometry and the topology of parametric curves.
J. Symb. Comput., 2023

Semidefinite network games: multiplayer minimax and semidefinite complementarity problems.
CoRR, 2023

Randomized geometric tools for anomaly detection in stock markets.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
The Multivariate Schwartz-Zippel Lemma.
SIAM J. Discret. Math., 2022

Semidefinite games.
CoRR, 2022

The Boolean complexity of computing Chow forms.
CoRR, 2022

A Near-Optimal Expected Boolean Complexity Bound for Descartes Solver.
CoRR, 2022

Beyond Worst-Case Analysis for Root Isolation Algorithms.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

GPU-Based Homotopy Continuation for Minimal Problems in Computer Vision.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021
Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems.
SIAM J. Appl. Algebra Geom., 2021

Multilinear polynomial systems: Root isolation and bit complexity.
J. Symb. Comput., 2021

A nearly optimal algorithm to decompose binary forms.
J. Symb. Comput., 2021

On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and <i>S</i><sup>2</sup>.
J. Symb. Comput., 2021

Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo.
CoRR, 2021

PTOPO: Computing the Geometry and the Topology of Parametric Curves.
CoRR, 2021

Geometric Algorithms for Sampling the Flux Space of Metabolic Networks.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Separation bounds for polynomial systems.
J. Symb. Comput., 2020

Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials.
J. Symb. Comput., 2020

The complexity of subdivision for diameter-distance tests.
J. Symb. Comput., 2020

Lower Bounds on the Number of Realizations of Rigid Graphs.
Exp. Math., 2020

Efficient Sampling from Feasible Sets of SDPs and Volume Approximation.
CoRR, 2020

PTOPO: a maple package for the topology of parametric curves.
ACM Commun. Comput. Algebra, 2020

Sampling the feasible sets of SDPs and volume approximation.
ACM Commun. Comput. Algebra, 2020

Computing the topology of a plane or space hyperelliptic curve.
Comput. Aided Geom. Des., 2020

On the geometry and the topology of parametric curves.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

TRPLP - Trifocal Relative Pose From Lines at Points.
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

2019
Univariate real root isolation in an extension field and applications.
J. Symb. Comput., 2019

Trifocal Relative Pose from Lines at Points and its Efficient Solution.
CoRR, 2019

Gr{ö}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems.
CoRR, 2019

Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Improving root separation bounds.
J. Symb. Comput., 2018

Computing the topology of a planar or space hyperelliptic curve.
CoRR, 2018

Towards Mixed Gr{ö}bner Basis Algorithms: the Multihomogeneous and Sparse Case.
CoRR, 2018

Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Bilinear Systems with Two Supports: Koszul Resultant Matrices, Eigenvalues, and Eigenvectors.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017
Accelerated approximation of the complex roots and factors of a univariate polynomial.
Theor. Comput. Sci., 2017

Nearly optimal computations with structured matrices.
Theor. Comput. Sci., 2017

Resultants and Discriminants for Bivariate Tensor-Product Polynomials.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Sparse Rational Univariate Representation.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

The Complexity of an Adaptive Subdivision Method for Approximating Real Curves.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
Nearly optimal refinement of real roots of a univariate polynomial.
J. Symb. Comput., 2016

SLV: a software for real root isolation.
ACM Commun. Comput. Algebra, 2016

On the Bit Complexity of Solving Bilinear Polynomial Systems.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

A Superfast Randomized Algorithm to Decompose Binary Forms.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Bounds for the Condition Number of Polynomials Systems with Integer Coefficients - (Invited Talk).
Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

2014
Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract).
CoRR, 2014

Accelerated approximation of the complex roots of a univariate polynomial.
Proceedings of the Symbolic-Numeric Computation 2014, 2014

Algebraic Algorithms.
Proceedings of the Computing Handbook, 2014

2013
Improved bounds for the CF algorithm.
Theor. Comput. Sci., 2013

On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications.
SIAM J. Optim., 2013

A polynomial approach for extracting the extrema of a spherical function and its application in diffusion MRI.
Medical Image Anal., 2013

Patience of matrix games.
Discret. Appl. Math., 2013

A probabilistic algorithm to compute the real dimension of a semi-algebraic set
CoRR, 2013

Chapter 10: Algebraic Algorithms.
CoRR, 2013

Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses.
Comput. Aided Geom. Des., 2013

On the boolean complexity of real root refinement.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs.
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

2012
Exact Algorithms for Solving Stochastic Games
CoRR, 2012

Univariate real root isolation in multiple extension fields.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Local Generic Position for Root Isolation of Zero-Dimensional Triangular Polynomial Systems.
Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

2011
On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers.
Theor. Comput. Sci., 2011

An algorithm for addressing the real interval eigenvalue problem.
J. Comput. Appl. Math., 2011

Characterizing and approximating eigenvalue sets of symmetric interval matrices.
Comput. Math. Appl., 2011

A filtering method for the interval eigenvalue problem.
Appl. Math. Comput., 2011

Exact algorithms for solving stochastic games: extended abstract.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Univariate real root isolation in an extension field.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010
Bounds on Real Eigenvalues and Singular Values of Interval Matrices.
SIAM J. Matrix Anal. Appl., 2010

On the Topology of Real Algebraic Plane Curves.
Math. Comput. Sci., 2010

Improved complexity bounds for real root isolation using Continued Fractions
CoRR, 2010

The DMM bound: multivariate (aggregate) separation bounds.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Random polynomials and expected complexity of bisection methods for real solving.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Decomposing tensors with structured matrix factors reduces to rank-1 approximations.
Proceedings of the IEEE International Conference on Acoustics, 2010

2009
On the asymptotic and practical complexity of solving bivariate systems over the reals.
J. Symb. Comput., 2009

Guarding curvilinear art galleries with vertex or point guards.
Comput. Geom., 2009

Univariate Algebraic Kernel and Application to Arrangements.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Continued fraction expansion of real roots of polynomial systems.
Proceedings of the Symbolic Numeric Computation, 2009

Experimental evaluation and cross-benchmarking of univariate real solvers.
Proceedings of the Symbolic Numeric Computation, 2009

Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses.
Proceedings of the 2009 ACM Symposium on Solid and Physical Modeling, 2009

Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Symmetric tensor decomposition.
Proceedings of the 17th European Signal Processing Conference, 2009

On the topology of planar algebraic curves.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
On the complexity of real root isolation using continued fractions.
Theor. Comput. Sci., 2008

Real algebraic numbers and polynomial systems of small degree.
Theor. Comput. Sci., 2008

The Predicates for the Exact Voronoi Diagram of Ellipses under the Euclidiean Metric.
Int. J. Comput. Geom. Appl., 2008

Guarding curvilinear art galleries with vertex or point guards
CoRR, 2008

Algebraic computations and applications to geometry (abstract only).
ACM Commun. Comput. Algebra, 2008

Computing a rational in between.
ACM Commun. Comput. Algebra, 2008

Real Algebraic Numbers: Complexity Analysis and Experimentation.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 2008

2007
On the complexity of real solving bivariate systems.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006
Αλγεβρικοί αλγόριθμοι και εφαρμογές στη γεωμετρία
PhD thesis, 2006

Univariate Polynomial Real Root Isolation: Continued Fractions Revisited.
Proceedings of the Algorithms, 2006

The predicates for the Voronoi diagram of ellipses.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Minkowski decomposition of convex lattice polygons.
Proceedings of the Algebraic Geometry and Geometric Modeling, 2006

2005
Computations with one and two real algebraic numbers
CoRR, 2005

Real Solving of Bivariate Polynomial Systems.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004
Comparing Real Algebraic Numbers of Small Degree.
Proceedings of the Algorithms, 2004

Towards and open curved kernel.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004


  Loading...