Hu X, Yi K and Tao Y.
(2019). Output-Optimal Massively Parallel Algorithms for Similarity Joins. ACM Transactions on Database Systems. 44:2. (1-36). Online publication date: 30-Jun-2019.
Dautrich J and Ravishankar C.
(2019). Inferring Insertion Times and Optimizing Error Penalties in Time-decaying Bloom Filters. ACM Transactions on Database Systems. 44:2. (1-32). Online publication date: 8-Apr-2019.
Ju X, Jamjoom H and Shin K.
(2017). Hieroglyph. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 1:1. (1-25). Online publication date: 13-Jun-2017.
Alcázar J, Hermoso C and Muntingh G.
(2015). Symmetry detection of rational space curves from their curvature and torsion. Computer Aided Geometric Design. 33:C. (51-65). Online publication date: 1-Feb-2015.
Weimann M.
(2012). Algebraic Osculation and Application to Factorization of Sparse Polynomials. Foundations of Computational Mathematics. 12:2. (173-201). Online publication date: 1-Apr-2012.
Weimann M.
(2012). Algebraic Osculation and Application to Factorization of Sparse Polynomials. Foundations of Computational Mathematics. 10.1007/s10208-012-9114-z. 12:2. (173-201). Online publication date: 1-Apr-2012.
Adrovic D and Verschelde J.
(2011). Tropical algebraic geometry in Maple. Journal of Symbolic Computation. 46:7. (755-772). Online publication date: 1-Jul-2011.
Bertone C, Chèze G and Galligo A.
(2010). Modular Las Vegas algorithms for polynomial absolute factorization. Journal of Symbolic Computation. 45:12. (1280-1295). Online publication date: 1-Dec-2010.
Lichtblau D. Polynomial GCD and Factorization via Approximate Gröbner Bases. Proceedings of the 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. (29-36).
Bertone C, Chéze G and Galligo A.
(2010). Probabilistic algorithms for polynomial absolute factorization. ACM Communications in Computer Algebra. 43:3/4. (77-78). Online publication date: 24-Jun-2010.
Elkadi M, Galligo A and Weimann M.
(2009). Towards toric absolute factorization. Journal of Symbolic Computation. 44:9. (1194-1211). Online publication date: 1-Sep-2009.
Leykin A and Verschelde J.
(2009). Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm. International Journal of Computational Science and Engineering. 4:2. (94-101). Online publication date: 1-Jul-2009.
Li Z, Ondera M and Wang H.
(2009). Simplifying skew fractions modulo differential and difference relations. ACM Communications in Computer Algebra. 42:3. (164-165). Online publication date: 6-Feb-2009.
Chen C, Li L, Maza M, Pan W and Xie Y.
(2009). On the representation of constructible sets. ACM Communications in Computer Algebra. 42:3. (162-163). Online publication date: 6-Feb-2009.
Cuyt A and Lee W.
(2009). Sparse multivariate polynomial interpolation via the quotient-difference algorithm. ACM Communications in Computer Algebra. 42:3. (154-155). Online publication date: 6-Feb-2009.
Chèze G, Elkadi M, Galligo A and Weimann M.
(2009). Absolute factoring of bidegree bivariate polynomials. ACM Communications in Computer Algebra. 42:3. (151-153). Online publication date: 6-Feb-2009.
Gao X and Huang Z.
(2009). A characteristic set method for equation solving over finite fields. ACM Communications in Computer Algebra. 42:3. (149-150). Online publication date: 6-Feb-2009.
Kaltofen E, May J, Yang Z and Zhi L.
(2008). Approximate factorization of multivariate polynomials using singular value decomposition. Journal of Symbolic Computation. 43:5. (359-376). Online publication date: 1-May-2008.
Nagasaka K. Ruppert matrix as subresultant mapping. Proceedings of the 10th international conference on Computer Algebra in Scientific Computing. (316-327).
Moreno Maza M, Reid G, Scott R and Wu W. On Approximate Linearized Triangular Decompositions. Symbolic-Numeric Computation. 10.1007/978-3-7643-7984-1_17. (279-298).
Chèze G and Galligo A.
(2006). From an approximate to an exact absolute polynomial factorization. Journal of Symbolic Computation. 41:6. (682-696). Online publication date: 1-Jun-2006.
Flynn M.
(1978). A canonic interpretive program form for measuring "ideal" HLL architectures. ACM SIGARCH Computer Architecture News. 6:8. (6-15). Online publication date: 1-Apr-1978.