Search the dblp DataBase

Publications of Author

1. Lars Langemyr
   An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field. [Citation Graph (0, 0)][DBLP]
   AAECC, 1990, pp:222-233 [Conf]
   
2. Lars Langemyr
   Algorithms for a Multiple Algebraic Extension II. [Citation Graph (0, 0)][DBLP]
   AAECC, 1991, pp:224-233 [Conf]
   
3. Lars Langemyr
   Converting SAC-2 code to LISP. [Citation Graph (0, 0)][DBLP]
   EUROCAL, 1987, pp:50-51 [Conf]
   
4. Lars Langemyr, Scott McCallum
   The computation of polynomial greatest common divisors over an algebraic number field. [Citation Graph (0, 0)][DBLP]
   EUROCAL, 1987, pp:298-299 [Conf]
   
5. Lars Langemyr, Nils Malm
   Application Benefits of Advanced Equation-Based Multiphysics Modeling. [Citation Graph (0, 0)][DBLP]
   International Conference on Computational Science (3), 2005, pp:129-129 [Conf]
   
6. Lars Langemyr
   An Analysis of the Subresultant Algorithm Over an Algebraic Number Field. [Citation Graph (0, 0)][DBLP]
   ISSAC, 1991, pp:167-172 [Conf]
   
7. Joachim Hollman, Lars Langemyr
   Algorithms for Non-linear Constraints. [Citation Graph (0, 0)][DBLP]
   WCLP, 1991, pp:113-131 [Conf]
   
8. Lars Langemyr
   Circuits for Computing the GCD of Two Polynomials Over an Algebraic Number Field. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:3, pp:129-134 [Journal]
   
9. Lars Langemyr, Scott McCallum
   The Computation of Polynomial Greatest Common Divisors Over an Algebraic Number Field. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 1989, v:8, n:5, pp:429-448 [Journal]