Daniel Panario - Talks

Seminars:

• ``Polynomials over finite fields: algorithms and randomness'', Institute for Studies in Theoretical Physics and Mathematics IPM, Tehran (Iran), June 2011.
• ``Normal bases in finite fields", Mathematics Department, Penn State University, Pennsylvania (USA), April 2011.
• ``Normal bases in finite fields", Clarkson University, Potsdam (USA), July 2010.
• ``Applications of finite fields and an example of a combinatorial application'' (in Spanish), Institute of Mathematics and Statistics Rafael Laguardia, Universidad de la Republica, Montevideo (Uruguay), August 2009.
• ``Counting Polynomials over Finite Fields: Random Properties and Algorithms'', Mathematics Department, Penn State University, Pennsylvania (USA), April 2009.
• ``Normal bases in finite fields'' (in Portuguese), Departamento de Ciencia da Computacao, Universidade de Sao Paulo, Sao Paulo (Brazil), May 2008.
• ``Interval partitions and polynomial factorization over finite fields'' (in Spanish), Departament of Llenguatges i Sistemes Informatics, University Politecnica of Catalunya, Barcelona (Spain), April 2007.
• ``How to factor a one million degree polynomial in one day'', Dipartimento di Sistemi e Informatica, Universita degli Studi di Firenze, Florence (Italy), February 2007.
• ``How to factor a one million degree polynomial in one day'' (in Portuguese), Institute of Computing, Universidade Estadual de Campinas, Campinas (Brazil), December 2005.
• ``Some asymptotic enumeration results in cryptography'', Faculty of Business Administration, University of Macau, Macau (China), December 2003.
• ``What do random polynomials over finite fields look like?'', Tutte Colloquium, Department of Combinatorics and Optimization, University of Waterloo, Waterloo (Canada), July 2003.
• ``Pairs of coprime smooth polynomials and the Waterloo algorithm'', Department of Computer Science, University of Waterloo, Waterloo (Canada), December 2001.
• ``The index calculus method using non-smooth polynomials'' (in Portuguese), Institute of Computing, Universidade Estadual de Campinas, Campinas (Brazil), April 2000.
• ``Polynomials over finite fields: algorithms, enumeration and randomness'', Department of Mathematics and Statistics, Simon Fraser University, Vancouver (Canada), February 2000.
• ``Polynomials over finite fields: algorithms, enumeration and randomness'', School of Mathematics and Statistics, Carleton University, Ottawa (Canada), January 2000.
• ``Smallest components in random decomposable structures'', Seminaire de Combinatoire, Université Pierre et Marie Curie (Paris VI), Paris (France), June 1999.
• ``Exact largest and smallest size of components in decomposable structures'', INRIA Rocquencourt, Le Chesnay (France), June 1999.
• ``Analysis of algorithms for polynomials over finite fields'', Computer Science Department, University of Western Ontario, London (Canada), May 1999.
• ``Analises de caso medio para algoritmos envolvendo polinomios sobre corpos finitos'' (in Portuguese), Institute of Computing, Universidade Estadual de Campinas, Campinas (Brazil), April 1998.
• ``Analises de caso medio para algoritmos envolvendo polinomios sobre corpos finitos'' (in Portuguese), Department of Mathematics, Universidade Federal de Santa Catarina, Florianopolis (Brazil), April 1998.
• ``Smallest components in random decomposable structures'', INRIA Rocquencourt, Le Chesnay (France), February 1998.
• ``Analysis of Ben-Or's polynomial irreducibility test'', Tutte Colloquium, Department of Combinatorics and Optimization, University of Waterloo, Waterloo (Canada), November 1997.
• ``Counting polynomials over finite fields and analysis of algorithms'', Department of Mathematical Sciences, Clemson University, Clemson (USA), May 1997.
• ``Counting polynomials over finite fields and analysis of algorithms'', INRIA Rocquencourt, Le Chesnay (France), October 1996.
• ``Orders of Gauss periods in finite fields'' Department of Mathematics and Computer Science, Kent State University (USA), November, 1995.
• ``Gauss periods and efficient arithmetic in finite fields'', Department of Computer Science, University of Manitoba, Winnipeg (Canada), September 1995.
• ``A survey on factoring polynomials over finite fields'' INRIA Rocquencourt, Le Chesnay (France), January 1995.
• ``A practical approach to factoring polynomials over finite fields'', Department of Mathematics, University of Geneva (Switzerland), February 1995.

Conferences:

• ``Two new measures for permutations: ambiguity and deficiency'', 10th Finite Fields and their Applications Conference Fq10, Ghent (Belgium), July 2011.
• ``The most important algorithm of Philippe Flajolet'', 2011 International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms AofA'11, Bedlewo (Poland), June 2011.
• ``Combinatorial applications of finite fields'', 3rd Canadian Discrete and Algorithmic Mathematics Conference CanaDAM 2011, Victoria (Canada), May 2011.
• ``Divisibility of polynomials over finite fields and combinatorial applications'', Canadian Mathematical Society Winter 2010 Meeting: Vancouver (Canada), December 2010.
• ``Polynomials over finite fields: algorithms and randomness'', 2010 International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms AofA'10, Vienna (Austria), July 2010.
• ``Self-inverse permutation functions over finite fields and interleavers for turbo codes'', Canadian Mathematical Society Summer 2010 Meeting: Fredericton (Canada), June 2010.
• ``Counting polynomials over finite fields: random properties and algorithms'', A Modern Computer Algebraist Jo60, Bonn (Germany), May 2010.
• ``Normal bases in finite fields'', Antalya Algebra Days XII AAD XII, Antalya (Turkey), May 2010.
• ``Bivariate asymptotics for striped plane partitions'', Workshop on Analytic Algorithms and Combinatorics ANALCO'10, Austin (USA), January 2010.
• ``Interval partitions and polynomial factorization", 9th Finite Fields and their Applications Conference Fq9, Dublin (Ireland), July 2009.
• ``Division of polynomials over finite fields and orthogonal arrays'', British Combinatorial Conference BCC 2009, St Andrews (Scotland), July 2009.
• ``Asymptotics of smallest components sizes in decomposable combinatorial structures of alg-log type'', Canadian Discrete and Algorithmic Mathematics Conference CanaDAM, CRM, Montreal (Canada), May 2009.
• ``Counting polynomials over finite fields: random properties and algorithms'', Ottawa Mathematics Conference, Ottawa University, Ottawa (Canada), May 2009.
• ``The distribution of the number of encryptions in revocation schemes for stateless receivers'', Canadian Mathematical Society Winter 2008 Meeting: Ottawa (Canada), December 2008.
• ``Smallest components and restricted patterns in combinatorial decomposable structures'', AMS Sectional Meeting special session on Algorithmic Probability and Combinatorics: Vancouver (Canada), October, 2008.
• ``The distribution of the number of encryptions in revocation schemes for stateless receivers'', Fifth Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities MathInfo'08, Blaubeuren (Germany), September, 2008.
• ``Smallest components and restricted patterns in combinatorial decomposable structures'', Combinatorics 2008, Costermano (Italy), June 2008.
• ``Analysis of some revocation schemes for stateless receivers'', 2008 Conference on Analysis of Algorithms AofA'08, Maresias (Brazil), April 2008.
• ``Low complexity normal elements'', 8th International Conference on Finite Fields and Applications Fq8, Melbourne (Australia), July 2007.
• ``The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern'', 2007 Conference on Analysis of Algorithms AofA'07, Juan Les Pins (France), June 2007.
• ``Interval partitions and polynomial factorization over finite fields'', 1st Canadian Discrete and Algorithmic Mathematics Conference CanaDAM, Banff (Canada), May 2007.
• ``The trace of an optimal normal element and low complexity normal bases'', Workshop on Coding and Cryptography 2007 WCC'07, Versailles (France), April 2007.
• ``Division of trinomials by pentanomials and orthogonal arrays'', Quinta Jornadas de Matematica Discreta y Algoritmica V JMDA, Soria (Spain), July 2006.
• ``Interval partitions and polynomial factorization over finite fields'', 2006 International Conference on the Analysis of Algorithms AofA'06, Alden Biesen (Belgium), July 2006.
• ``How to factor a one million degree polynomial in one day'', Coloquio Nacional de Codigos, Criptografia y Areas Relacionadas, Toluca (Mexico), June 2006.
• ``Degree distribution of the greatest common divisor of polynomials over finite fields'', Carleton Applied Probability Workshop, Ottawa (Canada), June 2006.
• ``Division of trinomials by pentanomials and orthogonal arrays'', Workshop on Covering Arrays, Ottawa (Canada), May 2006.
• ``Asymptotics of largest and smallest components in combinatorial structures'', CMS Winter 2005 Meeting, Victoria (Canada), December 2005.
• ``Largest and smallest components in combinatorial decomposable structures'', CombinaTexas'05, San Marcos, Texas (USA), February 2005.
• ``Degree distribution of the GCD of several univariate polynomials over finite fields'', Finite Fields: Theory and Applications, Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach (Germany), December 2004.
• ``Polynomials over finite fields: random properties and algorithms'', 10th International Seminar on Analysis of Algorithms, MSRI Berkeley (USA), June 2004.
• ``Adaptive sampling for Quickfind'', SODA'04 (Symposium on Discrete Algorithms), New Orleans (USA), January 2004.
• ``A simple primality test and the rth smallest prime factor'', ANALCO'04 (Analytic Algorithmics and Combinatorics), New Orleans (USA), January 2004.
• ``Mutual irreducibility of polynomials over finite fields'', Special Session of the AMS Annual Joint Meeting on Coding and Design-Theoretic Applications of Polynomials, Phoenix (USA), January 2004.
• ``What do random polynomials over finite fields look like?'', Workshop on Combinatorics, Algorithms, and Applications, Ubatuba (Brazil), September 2003.
• ``Permutation binomials'', Workshop on Combinatorics, Algorithms, and Applications, Ubatuba (Brazil), September 2003.
• ``Asymptotics of combinatorial structures with large smallest component'', 9th International Seminar on Analysis of Algorithms, San Miniato (Italy), June 2003.
• ``What do random polynomials over finite fields look like?'', Finite Fields and Applications: Fq7, Toulouse (France), May 2003.
• ``Adaptive sampling for quickselect'', 2nd Cuban Workshop on Data Structures and Algorithms, La Habana (Cuba), April 2003.
• ``Some asymptotic enumeration results in cryptography'', 11th SIAM Conference on Discrete Mathematics, San Diego (USA), August 2002.
• ``Pairs of coprime smooth polynomials and the Waterloo algorithm'', Seventh Seminar on Analysis of Algorithms, Tatihou (France), July 2001.
• ``Analysis of Rabin's polynomial irreducibility test'', Finite Fields and Applications: Fq6, Oaxaca (Mexico), May 2001.
• Finite Fields: a minicourse (3 hours) at Finite Fields and Applications: Fq6, Oaxaca (Mexico), May 2001.
• ``The index calculus method using non-smooth polynomials'', Algorithms and Number Theory, Schloss Dagstuhl (Germany), May 2001.
• ``Pairs of coprime smooth polynomials and the Waterloo algorithm'', Finite Fields: Theory and Applications, Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach (Germany), January 2001.
• ``The index calculus method using non-smooth polynomials'', Smalefest' 2000: International Conference on Foundations of Computational Mathematics in honor of Prof. Smale's 70th Birthday, Hong Kong (China), July 2000.
• ``Polynomials over finite fields free from large and small degree irreducible factors and cryptographical applications'', Sixth International Seminar on Analysis of Algorithms, Gdansk (Poland), July 2000.
• ``Extremal sizes of components in random combinatorial structures'', 10th SIAM Conference on Discrete Mathematics, Minneapolis (USA), June 2000.
• ``Average case analysis of sorting algorithms'', III Workshop in Combinatorics and Discrete Structures, Ubatuba (Brazil), April 2000.
• ``Exact largest and smallest size of components in decomposable structures'', Probabilistic Graph Theory Workshop, Fields Institute, Toronto (Canada), February 2000.
• ``Polynomials over finite fields free from large and small degree irreducible factors'', in Number Theory and Combinatorics Day, Johannesburg (South Africa), January 2000.
• ``The index calculus method using non-smooth polynomials'', in PACOM'2000 (5th Pan African Congress of Mathematicians), Cape Town (South Africa), January 2000.
• ``Smallest components in random decomposable structures", in Fifth Seminar on the Mathematical Analysis of Algorithms, Barcelona (Spain), June 1999.
• ``Average-case analysis of algorithms for polynomials over finite fields", in Average-Case Analysis of Algorithms, DIMACS Special Year on Massive Data Sets, Princeton University, Princeton (USA), July 1998.
• ``Analysis of polynomial irreducibility tests'', in 9th SIAM Conference on Discrete Mathematics, Toronto (Canada), July 1998.
• ``An analytic approach to smooth polynomials over finite fields'' in ANTS III, Algorithmic Number Theory Symposium, Portland (USA), June 1998.
• ``Analysis of Rabin's polynomial irreducibility test'', LATIN'98, Latin American Theoretical INformatics'98, Campinas (Brazil), April 1998.
• ``Average-case analysis of algorithms for polynomials over finite fields'', Fourth International Conference on Finite Fields and Applications, University of Waterloo, Waterloo (Canada), August 1997.
• ``Analysis of Ben-Or's polynomial irreducibility test'', Random Structures and Algorithms'97, Adam Mickiewicz University, Poznan (Poland), August 1997.
• ``Tests and constructions of irreducible polynomials over finite fields'', 11th Ontario Combinatorics Workshop, Ryerson Polytechnic University, Toronto (Canada), May 1997.
• ``Average-case analysis of algorithms for polynomials over finite fields'', Workshop on Probabilistic Analysis of Algorithms, DIMACS Focus on Discrete Probability, Princeton University (USA), May 1997.
• ``Tests and constructions of irreducible polynomials over finite fields'', Foundations of Computational Mathematics, IMPA, Rio de Janeiro (Brazil), January 1997.
• ``Counting polynomials over finite fields'', 10th Ontario Combinatorics Workshop, Fields Institute, Toronto (Canada), April 1996.
• ``Gauss periods: fast exponentiation, multiplicative orders and pseudorandom generator'', Workshop on Combinatorial Number Theory, DIMACS, Rutgers University (USA), February 1996.
• ``Density of normal elements'', American Mathematical Society session on Foundations and Mathematical Aspects of Computer Science, Kent State University (USA), November 1995.
• ``Density of normal elements'', 25th Manitoba Conference on Combinatorial Math and Computing, University of Manitoba, Winnipeg (Canada), September 1995.