Daniel Panario
Daniel Panario
School of Mathematics and Statistics, Carleton university
Verified email at - Homepage
Cited by
Cited by
Handbook of finite fields
GL Mullen, D Panario
CRC press, 2013
Factoring polynomials over finite fields: A survey
J Von Zur Gathen, D Panario
Journal of Symbolic Computation 31 (1-2), 3-17, 2001
Algorithms for exponentiation in finite fields
S Gao, D Panario, V Shoup
Journal of Symbolic Computation 29 (6), 879-889, 2000
Low-density parity-check lattices: Construction and decoding analysis
MR Sadeghi, AH Banihashemi, D Panario
IEEE Transactions on Information Theory 52 (10), 4481-4495, 2006
Finite Fields and Applications: Eighth International Conference on Finite Fields and Applications, July 9-13, 2007, Melbourne, Australia
GL Mullen, D Panario, IE Shparlinski
American Mathematical Soc., 2008
Locating errors using ELAs, covering arrays, and adaptive testing algorithms
C Martínez, L Moura, D Panario, B Stevens
SIAM Journal on Discrete Mathematics 23 (4), 1776-1799, 2010
Gauss periods and fast exponentiation in finite fields
S Gao, J Gathen, D Panario
Latin American Symposium on Theoretical Informatics, 311-322, 1995
Tests and constructions of irreducible polynomials over finite fields
S Gao, D Panario
Foundations of computational mathematics, 346-361, 1997
The complete analysis of a polynomial factorization algorithm over finite fields
P Flajolet, X Gourdon, D Panario
Journal of Algorithms 40 (1), 37-81, 2001
Gauss periods: orders and cryptographical applications
S Gao, J Von Zur Gathen, D Panario
Mathematics of Computation 67 (221), 343-352, 1998
An analytic approach to smooth polynomials over finite fields
D Panario, X Gourdon, P Flajolet
International Algorithmic Number Theory Symposium, 226-236, 1998
Existence and properties of k-normal elements over finite fields
S Huczynska, GL Mullen, D Panario, D Thomson
Finite Fields and Their Applications 24, 170-183, 2013
A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics
P Flajolet, E Fusy, X Gourdon, D Panario, N Pouyanne
arXiv preprint math/0606370, 2006
Smallest components in decomposable structures: exp-log class
D Panario, B Richmond
Algorithmica 29 (1), 205-226, 2001
Construction of turbo lattices
A Sakzad, MR Sadeghi, D Panario
2010 48th Annual Allerton Conference on Communication, Control, and …, 2010
The trace of an optimal normal element and low complexity normal bases
M Christopoulou, T Garefalakis, D Panario, D Thomson
Designs, Codes and Cryptography 49 (1), 199-215, 2008
Two new measures for permutations: ambiguity and deficiency
D Panario, A Sakzad, B Stevens, Q Wang
IEEE transactions on information theory 57 (11), 7648-7657, 2011
Efficient pth root computations in finite fields of characteristic p
D Panario, D Thomson
Designs, Codes and Cryptography 50 (3), 351-358, 2009
Irreducible polynomials of given forms
S Gao, J Howell, D Panario
Contemporary Mathematics 225, 43-54, 1999
Analysis of Ben‐Or's polynomial irreducibility test
D Panario, B Richmond
Random Structures & Algorithms 13 (3‐4), 439-456, 1998
The system can't perform the operation now. Try again later.
Articles 1–20