Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Daniel Panario
2010 – today
- 2013
[j43]Malihe Aliasgari, Mohammad-Reza Sadeghi, Daniel Panario: Grobner Bases for Lattices and an Algebraic Decoding Algorithm. IEEE Transactions on Communications 61(4): 1222-1230 (2013)- 2012
- [j42]Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond: Interval Partitions and Polynomial Factorization. Algorithmica 63(1-2): 363-397 (2012)
- [j41]Daniel Panario, Murat Sahin, Qiang Wang: Generalized Alcuin's Sequence. Electr. J. Comb. 19(4): P55 (2012)
- [j40]Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson: Gauss periods as constructions of low complexity normal bases. Des. Codes Cryptography 62(1): 43-62 (2012)
- [j39]Daniel Panario, Olga Sosnovski, Brett Stevens, Qiang Wang: Divisibility of polynomials over finite fields and combinatorial applications. Des. Codes Cryptography 63(3): 425-445 (2012)
- [j38]Daniel Panario, Georgios Tzanakis: A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields. Finite Fields and Their Applications 18(2): 303-315 (2012)
- [j37]John T. Ethier, Gary L. Mullen, Daniel Panario, Brett Stevens, David Thomson: Sets of orthogonal hypercubes of class r. J. Comb. Theory, Ser. A 119(2): 430-439 (2012)
- [j36]Mark Giesbrecht, Daniel Panario: In honour of the research and influence of Joachim von zur Gathen at 60. J. Symb. Comput. 47(4): 355-357 (2012)
- [c14]
- [c13]Sartaj Ul Hasan, Daniel Panario, Qiang Wang: Word-Oriented Transformation Shift Registers and Their Linear Complexity. SETA 2012: 190-201
- 2011
- [j35]Zhicheng Gao, Andrew MacFie, Daniel Panario: Counting Words by Number of Occurrences of Some Patterns. Electr. J. Comb. 18(1) (2011)
- [j34]B. Hanson, Daniel Panario, David Thomson: Swan-like results for binomials and trinomials over finite fields of odd characteristic. Des. Codes Cryptography 61(3): 273-283 (2011)
- [j33]Daniel Panario, Amin Sakzad, Brett Stevens, Qiang Wang: Two New Measures for Permutations: Ambiguity and Deficiency. IEEE Transactions on Information Theory 57(11): 7648-7657 (2011)
- [e4]Philippe Flajolet, Daniel Panario (Eds.): Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2011, San Francisco, California, USA, January 22, 2011. SIAM 2011
- [i2]Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario: Turbo Lattices: Construction and Performance Analysis. CoRR abs/1108.1873 (2011)
- 2010
- [j32]Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario: Codes with girth 8 Tanner graph representation. Des. Codes Cryptography 57(1): 71-81 (2010)
- [j31]B. Omidi Koma, Daniel Panario, Qiang Wang: The number of irreducible polynomials of degree n over Fq with given trace and constant terms. Discrete Mathematics 310(8): 1282-1292 (2010)
- [j30]Li Dong, Zhicheng Gao, Daniel Panario, L. Bruce Richmond: Asymptotics of smallest component sizes in decomposable structures of alg-log type. Discrete Mathematics & Theoretical Computer Science 12(2): 197-222 (2010)
- [j29]Juliano B. Lima, Daniel Panario, Ricardo M. Campello de Souza: Public-key encryption based on Chebyshev polynomials over GF(q). Inf. Process. Lett. 111(2): 51-56 (2010)
- [j28]Conrado Martínez, Daniel Panario, Alfredo Viola: Adaptive sampling strategies for quickselects. ACM Transactions on Algorithms 6(3) (2010)
- [j27]Juliano B. Lima, Daniel Panario, Qiang Wang: A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form. IEEE Trans. Computers 59(6): 835-841 (2010)
- [c12]Daniel Panario, L. Bruce Richmond, Benjamin Young: Bivariate Asymptotics for Striped Plane Partitions. ANALCO 2010: 18-26
- [c11]Daniel Panario, Brett Stevens, Qiang Wang: Ambiguity and Deficiency in Costas Arrays and APN Permutations. LATIN 2010: 397-406
- [i1]Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario, Nasim Eshghi: Self-Inverse Interleavers for Turbo Codes. CoRR abs/1011.1539 (2010)
2000 – 2009
- 2009
- [j26]Daniel Panario, David Thomson: Efficient p th root computations in finite fields of characteristic p. Des. Codes Cryptography 50(3): 351-358 (2009)
- [j25]Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens: Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms. SIAM J. Discrete Math. 23(4): 1776-1799 (2009)
- 2008
- [j24]Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson: The trace of an optimal normal element and low complexity normal bases. Des. Codes Cryptography 49(1-3): 199-215 (2008)
- [j23]Ariane M. Masuda, Lucia Moura, Daniel Panario, David Thomson: Low Complexity Normal Elements over Finite Fields of Characteristic Two. IEEE Trans. Computers 57(7): 990-1001 (2008)
- [c10]Juliano B. Lima, Ricardo M. Campello de Souza, Daniel Panario: Security of public-key cryptosystems based on Chebyshev polynomials over prime finite fields. ISIT 2008: 1843-1847
- [c9]Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens: Algorithms to Locate Errors Using Covering Arrays. LATIN 2008: 504-519
- 2007
- [j22]Michael Dewar, Lucia Moura, Daniel Panario, Brett Stevens, Qiang Wang: Division of trinomials by pentanomials and orthogonal arrays. Des. Codes Cryptography 45(1): 1-17 (2007)
- [e3]Daniel Panario, Robert Sedgewick (Eds.): Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2007, New Orleans, Louisiana, USA, January 06, 2007. SIAM 2007
- 2006
- [j21]Philippe Jacquet, Daniel Panario, Wojciech Szpankowski: Preface. Algorithmica 46(3-4): 247-248 (2006)
- [j20]Mohamed Omar, Daniel Panario, L. Bruce Richmond, Jacki Whitely: Asymptotics of Largest Components in Combinatorial Structures. Algorithmica 46(3-4): 493-503 (2006)
- [j19]Philippe Flajolet, Éric Fusy, Xavier Gourdon, Daniel Panario, Nicolas Pouyanne: A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics. Electr. J. Comb. 13(1) (2006)
- [j18]Ariane M. Masuda, Daniel Panario, Qiang Wang: The Number of Permutation Binomials over F4p+1 where p and 4p+1 are Primes. Electr. J. Comb. 13(1) (2006)
- [j17]Zhicheng Gao, Daniel Panario: Degree distribution of the greatest common divisor of polynomials over Fq. Random Struct. Algorithms 29(1): 26-37 (2006)
- [j16]Mohammad-Reza Sadeghi, Amir H. Banihashemi, Daniel Panario: Low-Density Parity-Check Lattices: Construction and Decoding Analysis. IEEE Transactions on Information Theory 52(10): 4481-4495 (2006)
- [e2]Daniel Panario, Robert Sedgewick (Eds.): Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2006, Miami, Florida, USA, January 21, 2006. SIAM 2006
- 2004
- [j15]John D. Dixon, Daniel Panario: The Degree of the Splitting Field of a Random Polynomial over a Finite Field. Electr. J. Comb. 11(1) (2004)
- [j14]Benjamin Young, Daniel Panario: Low complexity normal bases in F22. Finite Fields and Their Applications 10(1): 53-64 (2004)
- [j13]Edward A. Bender, Atefeh Mashatan, Daniel Panario, L. Bruce Richmond: Asymptotics of combinatorial structures with large smallest component. J. Comb. Theory, Ser. A 107(1): 117-125 (2004)
- [c8]Daniel Panario, L. Bruce Richmond, Martha Yip: A Simple Primality Test and th rth Smallest Prime Factor. ALENEX/ANALC 2004: 185-193
- [c7]Conrado Martinez, Daniel Panario, Alfredo Viola: Adaptive sampling for quickselect. SODA 2004: 447-455
- 2003
- [j12]Michael Dewar, Daniel Panario: Linear transformation shift registers. IEEE Transactions on Information Theory 49(8): 2047-2052 (2003)
- [c6]Michael Dewar, Daniel Panario: Mutual Irreducibility of Certain Polynomials. International Conference on Finite Fields and Applications 2003: 59-68
- [c5]Daniel Panario: What Do Random Polynomials over Finite Fields Look Like? International Conference on Finite Fields and Applications 2003: 89-108
- 2002
- [j11]Michael Drmota, Daniel Panario: A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. Des. Codes Cryptography 26(1-3): 229-241 (2002)
- [j10]Theodoulos Garefalakis, Daniel Panario: Polynomials over finite fields free from large and small degree irreducible factors. J. Algorithms 44(1): 98-120 (2002)
- 2001
- [j9]Daniel Panario, L. Bruce Richmond: Smallest Components in Decomposable Structures: Exp-Log Class. Algorithmica 29(1): 205-226 (2001)
- [j8]Daniel Panario, L. Bruce Richmond: Exact Largest and Smallest Size of Components. Algorithmica 31(3): 413-432 (2001)
- [j7]Philippe Flajolet, Xavier Gourdon, Daniel Panario: The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. J. Algorithms 40(1): 37-81 (2001)
- [j6]Joachim von zur Gathen, Daniel Panario: Factoring Polynomials Over Finite Fields: A Survey. J. Symb. Comput. 31(1/2): 3-17 (2001)
- [j5]Theodoulos Garefalakis, Daniel Panario: The index calculus method using non-smooth polynomials. Math. Comput. 70(235): 1253-1264 (2001)
- [j4]Daniel Panario, Boris Pittel, L. Bruce Richmond, Alfredo Viola: Analysis of Rabin's irreducibility test for polynomials over finite fields. Random Struct. Algorithms 19(3-4): 525-551 (2001)
- 2000
- [j3]Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup: Algorithms for Exponentiation in Finite Fields. J. Symb. Comput. 29(6): 879-889 (2000)
- [e1]Gaston H. Gonnet, Daniel Panario, Alfredo Viola (Eds.): LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings. Lecture Notes in Computer Science 1776, Springer 2000, ISBN 3-540-67306-7
1990 – 1999
- 1998
- [j2]Shuhong Gao, Joachim von zur Gathen, Daniel Panario: Gauss periods: orders and cryptographical applications. Math. Comput. 67(221): 343-352 (1998)
- [j1]Daniel Panario, L. Bruce Richmond: Analysis of Ben-Or's polynomial irreducibility test. Random Struct. Algorithms 13(3-4): 439-456 (1998)
- [c4]Daniel Panario, Xavier Gourdon, Philippe Flajolet: An Analytic Approach to Smooth Polynominals over Finite Fields. ANTS 1998: 226-236
- [c3]
- 1996
- [c2]Philippe Flajolet, Xavier Gourdon, Daniel Panario: Random Polynomials and Polynomial Factorization. ICALP 1996: 232-243
- 1995
- [c1]Shuhong Gao, Joachim von zur Gathen, Daniel Panario: Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). LATIN 1995: 311-322
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-13 22:22 CEST by the dblp team