| 2008 |
|---|
| 29 | EE | Ezra Miller,
Igor Pak:
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings.
Discrete & Computational Geometry 39(1-3): 339-388 (2008) |
| 2006 |
|---|
| 28 | EE | Alexander Gamburd,
Igor Pak:
Expansion Of Product Replacement Graphs.
Combinatorica 26(4): 411-429 (2006) |
| 27 | EE | Christopher Malon,
Igor Pak:
Percolation on Finite Cayley Graphs.
Combinatorics, Probability & Computing 15(4): 571-588 (2006) |
| 26 | EE | Cilanne Boulet,
Igor Pak:
A combinatorial proof of the Rogers-Ramanujan and Schur identities.
J. Comb. Theory, Ser. A 113(6): 1019-1030 (2006) |
| 2005 |
|---|
| 25 | EE | Igor Pak,
Ernesto Vallejo:
Combinatorics and geometry of Littlewood-Richardson cones.
Eur. J. Comb. 26(6): 995-1008 (2005) |
| 2004 |
|---|
| 24 | EE | Christine Bessenrodt,
Igor Pak:
Partition congruences by involutions.
Eur. J. Comb. 25(8): 1139-1149 (2004) |
| 23 | EE | László Babai,
Igor Pak:
Strong bias of group generators: an obstacle to the "product replacement algorithm".
J. Algorithms 50(2): 215-231 (2004) |
| 22 | EE | Sergi Elizalde,
Igor Pak:
Bijections for refined restricted permutations.
J. Comb. Theory, Ser. A 105(2): 207-219 (2004) |
| 21 | EE | Michael Korn,
Igor Pak:
Tilings of rectangles with T-tetrominoes.
Theor. Comput. Sci. 319(1-3): 3-27 (2004) |
| 2003 |
|---|
| 20 | EE | Igor Pak:
Tile invariants: new horizons.
Theor. Comput. Sci. 2-3(303): 303-331 (2003) |
| 2002 |
|---|
| 19 | EE | Christopher Malon,
Igor Pak:
Percolation on Finite Cayley Graphs.
RANDOM 2002: 91-104 |
| 18 | EE | Igor Pak:
Mixing time and long paths in graphs.
SODA 2002: 321-328 |
| 17 | EE | Alexander Gamburd,
Igor Pak:
Expansion of product replacement graphs.
SODA 2002: 691-696 |
| 16 | EE | Cristopher Moore,
Igor Pak:
Ribbon Tile Invariants from the Signed Area.
J. Comb. Theory, Ser. A 98(1): 1-16 (2002) |
| 2001 |
|---|
| 15 | | Igor Pak,
Van H. Vu:
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.
Discrete Applied Mathematics 110(2-3): 251-272 (2001) |
| 14 | EE | Roman Muchnik,
Igor Pak:
On Growth of Grigorchuk Groups.
IJAC 11(1): 1-18 (2001) |
| 2000 |
|---|
| 13 | | Igor Pak:
The product replacement algorithm is polynomial.
FOCS 2000: 476-485 |
| 12 | EE | László Babai,
Igor Pak:
Strong bias of group generators: an obstacle to the ``product replacement algorithm''.
SODA 2000: 627-635 |
| 11 | EE | Igor Pak:
On the Number of Faces of Certain Transportation Polytopes.
Eur. J. Comb. 21(5): 689-694 (2000) |
| 10 | | Sergey Bratus,
Igor Pak:
Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture.
J. Symb. Comput. 29(1): 33-57 (2000) |
| 1999 |
|---|
| 9 | EE | Igor Pak:
Random Cayley Graphs with O(log[G]) Generators Are Expanders.
ESA 1999: 521-526 |
| 8 | EE | Igor Pak,
Sergey Bratus:
On Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract).
ISSAC 1999: 91-96 |
| 7 | EE | Igor Pak:
Using Stopping Times to Bound Mixing Times.
SODA 1999: 953-954 |
| 6 | EE | Fang Chen,
László Lovász,
Igor Pak:
Lifting Markov Chains to Speed up Mixing.
STOC 1999: 275-281 |
| 5 | EE | Igor Pak:
Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees.
Discrete Mathematics 204(1-3): 329-335 (1999) |
| 4 | EE | Roman Muchnik,
Igor Pak:
On Tilings by Ribbon Tetrominoes.
J. Comb. Theory, Ser. A 88(1): 188-193 (1999) |
| 1998 |
|---|
| 3 | EE | Igor Pak,
Alexander Postnikov:
A generalization of Sylvester's identity.
Discrete Mathematics 178(1-3): 277-281 (1998) |
| 1997 |
|---|
| 2 | EE | Jean-Christophe Novelli,
Igor Pak,
Alexander V. Stoyanovskii:
A direct bijective proof of the hook-length formula.
Discrete Mathematics & Theoretical Computer Science 1(1): 53-67 (1997) |
| 1996 |
|---|
| 1 | EE | Alexander Kuznetsov,
Igor Pak,
Alexander Postnikov:
Trees Associated with the Motzkin Numbers.
J. Comb. Theory, Ser. A 76(1): 145-147 (1996) |
