The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel Panario: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Panario, L. Bruce Richmond, Martha Yip
    A Simple Primality Test and th rth Smallest Prime Factor. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:185-193 [Conf]
  2. Daniel Panario, Xavier Gourdon, Philippe Flajolet
    An Analytic Approach to Smooth Polynominals over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1998, pp:226-236 [Conf]
  3. Michael Dewar, Daniel Panario
    Mutual Irreducibility of Certain Polynomials. [Citation Graph (0, 0)][DBLP]
    International Conference on Finite Fields and Applications, 2003, pp:59-68 [Conf]
  4. Daniel Panario
    What Do Random Polynomials over Finite Fields Look Like? [Citation Graph (0, 0)][DBLP]
    International Conference on Finite Fields and Applications, 2003, pp:89-108 [Conf]
  5. Philippe Flajolet, Xavier Gourdon, Daniel Panario
    Random Polynomials and Polynomial Factorization. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:232-243 [Conf]
  6. Shuhong Gao, Joachim von zur Gathen, Daniel Panario
    Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:311-322 [Conf]
  7. Daniel Panario, Alfredo Viola
    Analysis of Rabin's Polynomial Irreducability Test. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:1-10 [Conf]
  8. Conrado Martinez, Daniel Panario, Alfredo Viola
    Adaptive sampling for quickselect. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:447-455 [Conf]
  9. Daniel Panario, L. Bruce Richmond
    Smallest Components in Decomposable Structures: Exp-Log Class. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:1, pp:205-226 [Journal]
  10. Daniel Panario, L. Bruce Richmond
    Exact Largest and Smallest Size of Components. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:3, pp:413-432 [Journal]
  11. Michael Drmota, Daniel Panario
    A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:26, n:1-3, pp:229-241 [Journal]
  12. Philippe Flajolet, Xavier Gourdon, Daniel Panario
    The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:40, n:1, pp:37-81 [Journal]
  13. Theodoulos Garefalakis, Daniel Panario
    Polynomials over finite fields free from large and small degree irreducible factors. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:44, n:1, pp:98-120 [Journal]
  14. Edward A. Bender, Atefeh Mashatan, Daniel Panario, L. Bruce Richmond
    Asymptotics of combinatorial structures with large smallest component. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:107, n:1, pp:117-125 [Journal]
  15. Joachim von zur Gathen, Daniel Panario
    Factoring Polynomials Over Finite Fields: A Survey. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:31, n:1/2, pp:3-17 [Journal]
  16. Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup
    Algorithms for Exponentiation in Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2000, v:29, n:6, pp:879-889 [Journal]
  17. Theodoulos Garefalakis, Daniel Panario
    The index calculus method using non-smooth polynomials. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2001, v:70, n:235, pp:1253-1264 [Journal]
  18. Shuhong Gao, Joachim von zur Gathen, Daniel Panario
    Gauss periods: orders and cryptographical applications. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1998, v:67, n:221, pp:343-352 [Journal]
  19. Zhicheng Gao, Daniel Panario
    Degree distribution of the greatest common divisor of polynomials over Fq. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:1, pp:26-37 [Journal]
  20. Daniel Panario, Boris Pittel, L. Bruce Richmond, Alfredo Viola
    Analysis of Rabin's irreducibility test for polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:3-4, pp:525-551 [Journal]
  21. Daniel Panario, L. Bruce Richmond
    Analysis of Ben-Or's polynomial irreducibility test. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:439-456 [Journal]
  22. Michael Dewar, Daniel Panario
    Linear transformation shift registers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:8, pp:2047-2052 [Journal]
  23. M.-R. Sadeghi, Amir H. Banihashemi, Daniel Panario
    Low-Density Parity-Check Lattices: Construction and Decoding Analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:10, pp:4481-4495 [Journal]
  24. Mohamed Omar, Daniel Panario, L. Bruce Richmond, Jacki Whitely
    Asymptotics of Largest Components in Combinatorial Structures. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:3-4, pp:493-503 [Journal]
  25. Philippe Jacquet, Daniel Panario, Wojciech Szpankowski
    Preface. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:3-4, pp:247-248 [Journal]
  26. Michael Dewar, Lucia Moura, Daniel Panario, Brett Stevens, Qiang Wang
    Division of trinomials by pentanomials and orthogonal arrays. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:45, n:1, pp:1-17 [Journal]

  27. Ambiguity and Deficiency in Costas Arrays and APN Permutations. [Citation Graph (, )][DBLP]


  28. Algorithms to Locate Errors Using Covering Arrays. [Citation Graph (, )][DBLP]


  29. A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics. [Citation Graph (, )][DBLP]


  30. The Number of Permutation Binomials over F4p+1 where p and 4p+1 are Primes. [Citation Graph (, )][DBLP]


  31. The trace of an optimal normal element and low complexity normal bases. [Citation Graph (, )][DBLP]


  32. Efficient p th root computations in finite fields of characteristic p. [Citation Graph (, )][DBLP]


  33. The number of irreducible polynomials of degree n over Fq with given trace and constant terms. [Citation Graph (, )][DBLP]


Search in 0.080secs, Finished in 0.082secs
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