The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alan G. B. Lauder: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alan G. B. Lauder
    Homotopy Methods for Equations over Finite Fields. [Citation Graph (0, 0)][DBLP]
    AAECC, 2003, pp:18-23 [Conf]
  2. Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder
    Factoring polynomials via polytopes. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2004, pp:4-11 [Conf]
  3. Shuhong Gao, Alan G. B. Lauder
    Decomposition of Polytopes and Polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:1, pp:89-104 [Journal]
  4. Alan G. B. Lauder
    Computing Zeta Functions of Kummer Curves via Multiplicative Characters. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2003, v:3, n:3, pp:273-295 [Journal]
  5. Alan G. B. Lauder
    Counting Solutions to Equations in Many Variables over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2004, v:4, n:3, pp:221-267 [Journal]
  6. Alan G. B. Lauder, Daqing Wan
    Computing zeta functions of Artin-Schreier curves over finite fields II. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:331-349 [Journal]
  7. Alan G. B. Lauder
    Zero-patterns of polynomials and Newton polytopes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:102, n:1, pp:10-15 [Journal]
  8. Shuhong Gao, Erich Kaltofen, Alan G. B. Lauder
    Deterministic distinct-degree factorization of polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2004, v:38, n:6, pp:1461-1470 [Journal]
  9. Shuhong Gao, Alan G. B. Lauder
    Hensel lifting and bivariate polynomial factorisation over finite fields. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2002, v:71, n:240, pp:1663-1676 [Journal]
  10. Richard P. Brent, Shuhong Gao, Alan G. B. Lauder
    Random Krylov Spaces over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:276-287 [Journal]
  11. Alan G. B. Lauder, Kenneth G. Paterson
    Computing the error linear complexity spectrum of a binary sequence of period 2n. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:1, pp:273-280 [Journal]

Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002