Daniel Panario - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Swan-like results for binomials and trinomials over finite fields of odd characteristicB. Hanson, Daniel Panario, David Thomson. dcc, 61(3):273-283, 2011. [doi]

2010

Asymptotics of smallest component sizes in decomposable structures of alg-log typeLi Dong, Zhicheng Gao, Daniel Panario, L. Bruce Richmond. dmtcs, 12(2):197-222, 2010. [doi]

The number of irreducible polynomials of degree n over F::q:: with given trace and constant termsB. Omidi Koma, Daniel Panario, Qiang Wang. DM, 310(8):1282-1292, 2010. [doi]

A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev FormJuliano B. Lima, Daniel Panario, Qiang Wang. TC, 59(6):835-841, 2010. [doi]

Public-key encryption based on Chebyshev polynomials over GF(q)Juliano B. Lima, Daniel Panario, Ricardo M. Campello de Souza. ipl, 111(2):51-56, 2010. [doi]

Adaptive sampling strategies for quickselectsConrado Martínez, Daniel Panario, Alfredo Viola. talg, 6(3), 2010. [doi]

Ambiguity and Deficiency in Costas Arrays and APN PermutationsDaniel Panario, Brett Stevens, Qiang Wang. latin 2010: 397-406 [doi]

Codes with girth 8 Tanner graph representationAmin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario. dcc, 57(1):71-81, 2010. [doi]

2009

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing AlgorithmsConrado MartÃnez, Lucia Moura, Daniel Panario, Brett Stevens. siamdm, 23(4):1776-1799, 2009. [doi]

Efficient ::::p:::: th root computations in finite fields of characteristic ::::p::::Daniel Panario, David Thomson. dcc, 50(3):351-358, 2009. [doi]

2008

2007

Division of trinomials by pentanomials and orthogonal arraysMichael Dewar, Lucia Moura, Daniel Panario, Brett Stevens, Qiang Wang. dcc, 45(1):1-17, 2007. [doi]

2006

A Hybrid of Darboux s Method and Singularity Analysis in Combinatorial AsymptoticsPhilippe Flajolet, Éric Fusy, Xavier Gourdon, Daniel Panario, Nicolas Pouyanne. combinatorics, 13(1), 2006. [doi]

Degree distribution of the greatest common divisor of polynomials over F::::::q::::::Zhicheng Gao, Daniel Panario. rsa, 29(1):26-37, 2006. [doi]

PrefacePhilippe Jacquet, Daniel Panario, Wojciech Szpankowski. algorithmica, 46(3-4):247-248, 2006. [doi]

The Number of Permutation Binomials over F4p+1 where p and 4p+1 are PrimesAriane M. Masuda, Daniel Panario, Qiang Wang. combinatorics, 13(1), 2006. [doi]

Asymptotics of Largest Components in Combinatorial StructuresMohamed Omar, Daniel Panario, L. Bruce Richmond, Jacki Whitely. algorithmica, 46(3-4):493-503, 2006. [doi]

Low-Density Parity-Check Lattices: Construction and Decoding AnalysisM.-R. Sadeghi, Amir H. Banihashemi, Daniel Panario. TIT, 52(10):4481-4495, 2006. [doi]

2004

2003

Mutual Irreducibility of Certain PolynomialsMichael Dewar, Daniel Panario. fqas 2004: 59-68 [doi]

Linear transformation shift registersMichael Dewar, Daniel Panario. TIT, 49(8):2047-2052, 2003.

What Do Random Polynomials over Finite Fields Look Like?Daniel Panario. fqas 2004: 89-108 [doi]

2002

A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm ProblemMichael Drmota, Daniel Panario. dcc, 26(1-3):229-241, 2002.

Polynomials over finite fields free from large and small degree irreducible factorsTheodoulos Garefalakis, Daniel Panario. jal, 44(1):98-120, 2002. [doi]

2001

The Complete Analysis of a Polynomial Factorization Algorithm over Finite FieldsPhilippe Flajolet, Xavier Gourdon, Daniel Panario. jal, 40(1):37-81, 2001.

The index calculus method using non-smooth polynomialsTheodoulos Garefalakis, Daniel Panario. moc, 70(235):1253-1264, 2001.

Exact Largest and Smallest Size of ComponentsDaniel Panario, L. Bruce Richmond. algorithmica, 31(3):413-432, 2001. [doi]

Smallest Components in Decomposable Structures: Exp-Log ClassDaniel Panario, L. Bruce Richmond. algorithmica, 29(1):205-226, 2001. [doi]

Analysis of Rabin s irreducibility test for polynomials over finite fieldsDaniel Panario, Boris Pittel, L. Bruce Richmond, Alfredo Viola. rsa, 19(3-4):525-551, 2001.

Factoring Polynomials Over Finite Fields: A SurveyJoachim von zur Gathen, Daniel Panario. JSC, 31(1/2):3-17, 2001.

2000

Algorithms for Exponentiation in Finite FieldsShuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup. JSC, 29(6):879-889, 2000.

LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, ProceedingsGaston H. Gonnet, Daniel Panario, Alfredo Viola, editors, Volume 1776 of Lecture Notes in Computer Science, Springer, 2000.

1998

1996

Random Polynomials and Polynomial FactorizationPhilippe Flajolet, Xavier Gourdon, Daniel Panario. icalp 1996: 232-243

1995

Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract)Shuhong Gao, Joachim von zur Gathen, Daniel Panario. latin 1995: 311-322