The following pages link to Ioannis Z. Emiris (Q384998):
Displaying 50 items.
- Implicitization of curves and (hyper)surfaces using predicted support (Q385002) (← links)
- Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants (Q548599) (← links)
- Computing the Newton polygon of the implicit equation (Q626973) (← links)
- Hybrid sparse resultant matrices for bivariate polynomials (Q697484) (← links)
- The m-Bézout bound and distance geometry (Q831957) (← links)
- \(\beta\)-barrel transmembrane proteins: geometric modelling, detection of transmembrane region, and structural properties (Q884267) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
- Modular arithmetic for linear algebra computations in the real field (Q1264434) (← links)
- Sign determination in residue number systems (Q1274813) (← links)
- How to count efficiently all affine roots of a polynomial system (Q1289017) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Polytope membership in high dimension (Q1661856) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Multihomogeneous resultant formulae by means of complexes (Q1878475) (← links)
- Efficient incremental algorithms for the sparse resultant and the mixed volume (Q1911937) (← links)
- High-dimensional approximate \(r\)-nets (Q1987244) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Implicit representations of high-codimension varieties (Q2010333) (← links)
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs (Q2025442) (← links)
- Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises (Q2096364) (← links)
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\) (Q2110372) (← links)
- An asymptotic upper bound for graph embeddings (Q2112663) (← links)
- Efficient sampling in spectrahedra and volume approximation (Q2144244) (← links)
- New upper bounds for the number of embeddings of minimally rigid graphs (Q2172653) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\) (Q2200306) (← links)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
- Real algebraic numbers and polynomial systems of small degree (Q2378492) (← links)
- Exact Voronoi diagram of smooth convex pseudo-circles: general predicates, and implementation for ellipses (Q2443072) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- Molecular conformation search by distance matrix perturbations (Q2485885) (← links)
- On the complexity of sparse elimination (Q2565194) (← links)
- The predicates of the Apollonius diagram: algorithmic analysis and implementation (Q2575585) (← links)
- (Q2738480) (← links)
- Implicitization of curves and surfaces using predicted support (Q2819628) (← links)
- Minkowski Decomposition and Geometric Predicates in Sparse Implicitization (Q2819753) (← links)
- Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs (Q2841696) (← links)
- An output-sensitive algorithm for computing projections of resultant polytopes (Q2874580) (← links)
- AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES (Q2875648) (← links)
- Random polynomials and expected complexity of bisection methods for real solving (Q2946544) (← links)
- The DMM bound (Q2946545) (← links)
- Hybrid sparse resultant matrices for bivariate systems (Q2958910) (← links)
- Combinatorics of 4-dimensional resultant polytopes (Q2963231) (← links)
- Compact Formulae in Sparse Elimination (Q2985799) (← links)
- On the Bit Complexity of Solving Bilinear Polynomial Systems (Q2985830) (← links)
