Остановите войну!
for scientists:
default search action
Elias P. Tsigaridas
- > Home > Persons > Elias P. Tsigaridas
Publications
- 2021
- [j35]Evangelos Bartzos, Ioannis Z. Emiris, Jan Legerský, Elias P. Tsigaridas:
On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2. J. Symb. Comput. 102: 189-208 (2021) - [j33]Ioannis Z. Emiris, Angelos Mantzaflaris, Elias P. Tsigaridas:
Multilinear polynomial systems: Root isolation and bit complexity. J. Symb. Comput. 105: 145-164 (2021) - 2020
- [j25]Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas:
Separation bounds for polynomial systems. J. Symb. Comput. 101: 128-151 (2020) - [i31]Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos, Panagiotis Repouskos, Elias P. Tsigaridas:
Efficient Sampling from Feasible Sets of SDPs and Volume Approximation. CoRR abs/2010.03817 (2020) - 2018
- [c33]Evangelos Bartzos, Ioannis Z. Emiris, Jan Legerský, Elias P. Tsigaridas:
On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs. ISSAC 2018: 55-62 - 2016
- [c26]Ioannis Z. Emiris, Angelos Mantzaflaris, Elias P. Tsigaridas:
On the Bit Complexity of Solving Bilinear Polynomial Systems. ISSAC 2016: 215-222 - 2014
- [p3]Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas:
Algebraic Algorithms. Computing Handbook, 3rd ed. (1) 2014: 10: 1-30 - 2013
- [j18]Ioannis Z. Emiris, Elias P. Tsigaridas, George M. Tzoumas:
Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses. Comput. Aided Geom. Des. 30(8): 760-777 (2013) - [p2]Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios Varvitsiotis:
Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs. Distance Geometry 2013: 23-45 - [i16]Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas:
Chapter 10: Algebraic Algorithms. CoRR abs/1311.3731 (2013) - 2012
- [i14]Dimitrios I. Diochnos, Ioannis Z. Emiris, Elias P. Tsigaridas:
On the asymptotic and practical complexity of solving bivariate systems over the reals. CoRR abs/1203.1017 (2012) - 2010
- [c16]Ioannis Z. Emiris, André Galligo, Elias P. Tsigaridas:
Random polynomials and expected complexity of bisection methods for real solving. ISSAC 2010: 235-242 - [c15]Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas:
The DMM bound: multivariate (aggregate) separation bounds. ISSAC 2010: 243-250 - [i9]Ioannis Z. Emiris, André Galligo, Elias P. Tsigaridas:
Random polynomials and expected complexity of bisection methods for real solving. CoRR abs/1005.2001 (2010) - [i8]Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas:
The DMM bound: multivariate (aggregate) separation bounds. CoRR abs/1005.5610 (2010) - 2009
- [j6]Dimitrios I. Diochnos, Ioannis Z. Emiris, Elias P. Tsigaridas:
On the asymptotic and practical complexity of solving bivariate systems over the reals. J. Symb. Comput. 44(7): 818-835 (2009) - [c12]Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios Varvitsiotis:
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs. GD 2009: 195-200 - [c11]Ioannis Z. Emiris, Elias P. Tsigaridas, George M. Tzoumas:
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses. Symposium on Solid and Physical Modeling 2009: 211-222 - [c10]Michael Hemmer, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos, Ioannis Z. Emiris, Menelaos I. Karavelas, Bernard Mourrain:
Experimental evaluation and cross-benchmarking of univariate real solvers. SNC 2009: 45-54 - [i4]Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios Varvitsiotis:
Algebraic methods for counting Euclidean embeddings of rigid graphs. CoRR abs/0906.1437 (2009) - 2008
- [j4]Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas:
Computing a rational in between. ACM Commun. Comput. Algebra 42(3): 160-161 (2008) - [j3]Ioannis Z. Emiris, Elias P. Tsigaridas, George M. Tzoumas:
The Predicates for the Exact Voronoi Diagram of Ellipses under the Euclidiean Metric. Int. J. Comput. Geom. Appl. 18(6): 567-597 (2008) - [j2]Elias P. Tsigaridas, Ioannis Z. Emiris:
On the complexity of real root isolation using continued fractions. Theor. Comput. Sci. 392(1-3): 158-173 (2008) - [j1]Ioannis Z. Emiris, Elias P. Tsigaridas:
Real algebraic numbers and polynomial systems of small degree. Theor. Comput. Sci. 409(2): 186-199 (2008) - [c7]Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas:
Real Algebraic Numbers: Complexity Analysis and Experimentation. Reliable Implementation of Real Number Algorithms 2008: 57-82 - 2007
- [c6]Dimitrios I. Diochnos, Ioannis Z. Emiris, Elias P. Tsigaridas:
On the complexity of real solving bivariate systems. ISSAC 2007: 127-134 - 2006
- [c5]Ioannis Z. Emiris, Elias P. Tsigaridas, George M. Tzoumas:
The predicates for the Voronoi diagram of ellipses. SCG 2006: 227-236 - [c4]Elias P. Tsigaridas, Ioannis Z. Emiris:
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited. ESA 2006: 817-828 - [p1]Ioannis Z. Emiris, Elias P. Tsigaridas:
Minkowski decomposition of convex lattice polygons. Algebraic Geometry and Geometric Modeling 2006: 217-236 - [i2]Elias P. Tsigaridas, Ioannis Z. Emiris:
Univariate polynomial real root isolation: Continued Fractions revisited. CoRR abs/cs/0604066 (2006) - 2005
- [c3]Ioannis Z. Emiris, Elias P. Tsigaridas:
Real Solving of Bivariate Polynomial Systems. CASC 2005: 150-161 - [i1]Ioannis Z. Emiris, Elias P. Tsigaridas:
Computations with one and two real algebraic numbers. CoRR abs/cs/0512072 (2005) - 2004
- [c2]Ioannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, Elias P. Tsigaridas:
Towards and open curved kernel. SCG 2004: 438-446 - [c1]Ioannis Z. Emiris, Elias P. Tsigaridas:
Comparing Real Algebraic Numbers of Small Degree. ESA 2004: 652-663
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-11 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint