# Igor Pak

According to our database

Collaborative distances:

^{1}, Igor Pak authored at least 75 papers between 1996 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

Discret. Comput. Geom., 2021

2020

Math. Oper. Res., 2020

Electron. J. Comb., 2020

Electron. J. Comb., 2020

2019

J. Comb. Theory, Ser. A, 2019

J. Comb. Theory, Ser. B, 2019

Comb. Probab. Comput., 2019

CoRR, 2019

Comb., 2019

2018

Am. Math. Mon., 2018

SIAM J. Discret. Math., 2018

J. Comb. Theory, Ser. A, 2018

Eur. J. Comb., 2018

CoRR, 2018

CoRR, 2018

2017

Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications.

SIAM J. Discret. Math., 2017

J. Comb. Theory, Ser. B, 2017

J. Comb. Theory, Ser. A, 2017

CoRR, 2017

CoRR, 2017

Comb., 2017

Comput. Complex., 2017

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Discret. Comput. Geom., 2016

Discret. Comput. Geom., 2016

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

CoRR, 2015

Electron. J. Comb., 2015

2014

Random Struct. Algorithms, 2014

J. Comb. Theory, Ser. A, 2014

Adv. Appl. Math., 2014

2013

J. Comb. Theory, Ser. A, 2013

Discret. Comput. Geom., 2013

CoRR, 2013

Electron. J. Comb., 2013

2012

Am. Math. Mon., 2012

Comb., 2012

2011

J. Comb. Theory, Ser. A, 2011

2010

SIAM J. Discret. Math., 2010

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Complexity of O'Hara's Algorithm.

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

Discret. Math., 2009

Adv. Appl. Math., 2009

2008

Am. Math. Mon., 2008

Discret. Comput. Geom., 2008

2006

J. Comb. Theory, Ser. A, 2006

Comb. Probab. Comput., 2006

Comb., 2006

2005

Eur. J. Comb., 2005

Adv. Appl. Math., 2005

2004

Theor. Comput. Sci., 2004

J. Comb. Theory, Ser. A, 2004

Strong bias of group generators: an obstacle to the "product replacement algorithm".

J. Algorithms, 2004

Eur. J. Comb., 2004

Adv. Appl. Math., 2004

2003

Theor. Comput. Sci., 2003

2002

J. Comb. Theory, Ser. A, 2002

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Int. J. Algebra Comput., 2001

On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.

Discret. Appl. Math., 2001

2000

Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture.

J. Symb. Comput., 2000

Eur. J. Comb., 2000

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

J. Comb. Theory, Ser. A, 1999

Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees.

Discret. Math., 1999

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract).

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

Proceedings of the Algorithms, 1999

1998

Discret. Math., 1998

1997

Discret. Math. Theor. Comput. Sci., 1997

Proceedings of the Randomization Methods in Algorithm Design, 1997

1996

J. Comb. Theory, Ser. A, 1996