Elias Tsigaridas
20
Documents
Publications
- 20
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 3
- 1
- 3
- 1
- 1
- 1
|
On the Maximal Number of Real Embeddings of Spatial Minimally Rigid GraphsISSAC '18 International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. pp.55-62, ⟨10.1145/3208976.3208994⟩
Communication dans un congrès
hal-01710518v2
|
|
On the Bit Complexity of Solving Bilinear Polynomial SystemsISSAC '16 - 41st International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. pp.215-222, ⟨10.1145/2930889.2930919⟩
Communication dans un congrès
hal-01401134v1
|
|
The DMM bound: multivariate (aggregate) separation boundsProceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, Jul 2010, Munich, Germany. pp.243-250, ⟨10.1145/1837934.1837981⟩
Communication dans un congrès
inria-00393833v4
|
|
Random polynomials and expected complexity of bisection methods for real solvingISSAC, Jul 2010, Munich, Germany. pp.235-242, ⟨10.1145/1837934.1837980⟩
Communication dans un congrès
inria-00482722v2
|
|
Experimental evaluation and cross-benchmarking of univariate real solversInternational Workshop SNC, ACM, Aug 2009, Kyoto, Japan. pp.85-94, ⟨10.1145/1577190.1577202⟩
Communication dans un congrès
inria-00340887v2
|
|
Real Algebraic Numbers: Complexity Analysis and ExperimentationsReliable Implementations of Real Number Algorithms: Theory and Practice, 2008, Dagsthul, Germany. pp.57-82
Communication dans un congrès
inria-00071370v1
|
Calibration of parallel robots : on the Elimination of Pose-Dependent ParametersEuropean Conference on Mechanism Science, (EuCoMeS), Feb 2006, Obergurgl, Austria
Communication dans un congrès
hal-00989995v1
|
|
|
Towards an Open Curved KernelACM Symposium on Computational Geometry, Jun 2004, New York, United States. pp.438-446
Communication dans un congrès
inria-00344433v1
|
|
Mixed volume and distance geometry techniques for counting Euclidean embeddings of rigid graphsC. Lavor and L. Liberti and N. Maculan and A. Mucherino. Distance Geometry: With Applications to Molecular Conformation and Sensor Networks, Springer-Verlag, pp.23-45, 2012, 978-1-4614-5128-0. ⟨10.1007/978-1-4614-5128-0_2⟩
Chapitre d'ouvrage
hal-00776252v1
|
|
Algebraic AlgorithmsTeofilo Gonzalez. Computing Handbook Set - Computer Science, I, CRC Press, 2012
Chapitre d'ouvrage
hal-00776270v1
|
|
Efficient Sampling from Feasible Sets of SDPs and Volume Approximation2020
Pré-publication, Document de travail
hal-02953124v2
|
|
On the complexity of real solving bivariate systems[Research Report] RR-6116, INRIA. 2007
Rapport
inria-00129309v5
|
|
On the complexity of real root isolation using Continued Fractions[Research Report] RR-6059, INRIA. 2006, pp.22
Rapport
inria-00116990v6
|
|
A note on the complexity of univariate root isolation[Research Report] RR-6043, INRIA. 2006, pp.18
Rapport
inria-00116985v5
|