default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor Pak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j64]Swee Hong Chan, Igor Pak:
Linear extensions and continued fractions. Eur. J. Comb. 122: 104018 (2024)- [j63]Swee Hong Chan
, Igor Pak:
Computational complexity of counting coincidences. Theor. Comput. Sci. 1015: 114776 (2024) - [c20]Swee Hong Chan, Igor Pak:
Equality Cases of the Alexandrov-Fenchel Inequality Are Not in the Polynomial Hierarchy. STOC 2024: 875-883 - [i25]Igor Pak, Colleen Robichaux:
Signed combinatorial interpretations in algebraic combinatorics. CoRR abs/2406.13902 (2024) - [i24]Swee Hong Chan, Igor Pak:
Equality cases of the Stanley-Yan log-concave matroid inequality. CoRR abs/2407.19608 (2024) - 2023
- [j62]Swee Hong Chan, Igor Pak, Greta Panova:
Effective Poset Inequalities. SIAM J. Discret. Math. 37(3): 1842-1880 (2023) - [c19]Christian Ikenmeyer, Igor Pak, Greta Panova:
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. SODA 2023: 3573-3586 - [i23]Swee Hong Chan, Igor Pak:
Computational complexity of counting coincidences. CoRR abs/2308.10214 (2023) - [i22]Swee Hong Chan, Igor Pak:
Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy. CoRR abs/2309.05764 (2023) - [i21]Swee Hong Chan, Igor Pak:
Linear extensions of finite posets. CoRR abs/2311.02743 (2023) - 2022
- [j61]Swee Hong Chan, Igor Pak, Greta Panova:
Log-Concavity in Planar Random Walks. Comb. 42(6): 1011-1026 (2022) - [j60]Alejandro H. Morales, Igor Pak, Martin Tassy:
Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings. Comb. Probab. Comput. 31(4): 550-573 (2022) - [j59]Danny Nguyen, Igor Pak:
Short Presburger Arithmetic Is Hard. SIAM J. Comput. 51(2): 1-31 (2022) - [c18]Christian Ikenmeyer, Igor Pak:
What is in #P and what is not? FOCS 2022: 860-871 - [i20]Christian Ikenmeyer, Igor Pak:
What is in #P and what is not? CoRR abs/2204.13149 (2022) - [i19]Swee Hong Chan, Igor Pak, Greta Panova:
Effective poset inequalities. CoRR abs/2205.02798 (2022) - [i18]Christian Ikenmeyer, Igor Pak, Greta Panova:
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. CoRR abs/2207.05423 (2022) - [i17]Igor Pak:
What is a combinatorial interpretation? CoRR abs/2209.06142 (2022) - 2021
- [j58]Swee Hong Chan, Igor Pak, Greta Panova:
Sorting probability of Catalan posets. Adv. Appl. Math. 129: 102221 (2021) - [j57]Danny Nguyen, Igor Pak:
On the Number of Integer Points in Translated and Expanded Polyhedra. Discret. Comput. Geom. 65(2): 405-424 (2021) - [j56]Philipp Hieronymi, Danny Nguyen, Igor Pak:
Presburger Arithmetic with algebraic scalar multiplications. Log. Methods Comput. Sci. 17(3) (2021) - [i16]Swee Hong Chan, Igor Pak:
Log-concave poset inequalities. CoRR abs/2110.10740 (2021) - 2020
- [j55]Igor Pak, Fedor Petrov:
Hidden Symmetries of Weighted Lozenge Tilings. Electron. J. Comb. 27(3): 3 (2020) - [j54]Samuel J. Dittmer, Igor Pak:
Counting Linear Extensions of Restricted Posets. Electron. J. Comb. 27(4): 4 (2020) - [j53]Danny Nguyen, Igor Pak:
The Computational Complexity of Integer Programming with Alternations. Math. Oper. Res. 45(1): 191-204 (2020)
2010 – 2019
- 2019
- [j52]Danny Nguyen, Igor Pak:
VC-Dimensions of Short Presburger Formulas. Comb. 39(4): 923-932 (2019) - [j51]Stephen Desalvo, Igor Pak:
Limit Shapes via Bijections. Comb. Probab. Comput. 28(2): 187-240 (2019) - [j50]Nishant Chandgotia, Igor Pak, Martin Tassy:
Kirszbraun-type theorems for graphs. J. Comb. Theory B 137: 10-24 (2019) - [j49]Igor Pak, Greta Panova, Damir Yeliussizov:
On the largest Kronecker and Littlewood-Richardson coefficients. J. Comb. Theory A 165: 44-77 (2019) - [i15]Igor Pak:
Combinatorial inequalities. CoRR abs/1904.01656 (2019) - 2018
- [j48]Alejandro H. Morales, Igor Pak, Greta Panova:
Asymptotics of the number of standard Young tableaux of skew shape. Eur. J. Comb. 70: 26-49 (2018) - [j47]Alejandro H. Morales, Igor Pak, Greta Panova:
Hook formulas for skew shapes I. q-analogues and bijections. J. Comb. Theory A 154: 350-405 (2018) - [j46]Danny Nguyen, Igor Pak:
Enumerating Projections of Integer Points in Unbounded Polyhedra. SIAM J. Discret. Math. 32(2): 986-1002 (2018) - [j45]Alejandro H. Morales, Igor Pak, Greta Panova:
Why Is Pi Less Than Twice Phi? Am. Math. Mon. 125(8): 715-723 (2018) - [i14]Igor Pak:
Complexity problems in enumerative combinatorics. CoRR abs/1803.06636 (2018) - [i13]Philipp Hieronymi, Danny Nguyen, Igor Pak:
Presburger Arithmetic with algebraic scalar multiplications. CoRR abs/1805.03624 (2018) - [i12]Danny Nguyen, Igor Pak:
On the number of integer points in translated and expanded polyhedra. CoRR abs/1805.03685 (2018) - 2017
- [j44]Igor Pak, Greta Panova:
On the complexity of computing Kronecker coefficients. Comput. Complex. 26(1): 1-36 (2017) - [j43]Anton Malyshev, Igor Pak:
Lifts, derandomization, and diameters of Schreier graphs of Mealy automata. Comb. 37(4): 733-765 (2017) - [j42]Igor Pak, Stedman Wilson:
Skyscraper polytopes and realizations of plane triangulations. J. Comb. Theory B 127: 82-110 (2017) - [j41]Igor Pak, Greta Panova:
Bounds on certain classes of Kronecker and q-binomial coefficients. J. Comb. Theory A 147: 1-17 (2017) - [j40]Alejandro H. Morales, Igor Pak, Greta Panova:
Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications. SIAM J. Discret. Math. 31(3): 1953-1989 (2017) - [c17]Danny Nguyen, Igor Pak:
The Computational Complexity of Integer Programming with Alternations. CCC 2017: 6:1-6:18 - [c16]Danny Nguyen, Igor Pak:
Short Presburger Arithmetic Is Hard. FOCS 2017: 37-48 - [c15]Danny Nguyen, Igor Pak:
Enumeration of Integer Points in Projections of Unbounded Polyhedra. IPCO 2017: 417-429 - [c14]Danny Nguyen, Igor Pak:
Complexity of short Presburger arithmetic. STOC 2017: 812-820 - [i11]Danny Nguyen, Igor Pak:
Complexity of short generating functions. CoRR abs/1702.08660 (2017) - [i10]Danny Nguyen, Igor Pak:
The computational complexity of integer programming with alternations. CoRR abs/1702.08662 (2017) - [i9]Danny Nguyen, Igor Pak:
Complexity of short Presburger arithmetic. CoRR abs/1704.00249 (2017) - [i8]Danny Nguyen, Igor Pak:
Short Presburger arithmetic is hard. CoRR abs/1708.08179 (2017) - [i7]Danny Nguyen, Igor Pak:
VC-dimension of short Presburger formulas. CoRR abs/1710.04171 (2017) - 2016
- [j39]Assaf Oren, Igor Pak, Rom Pinchasi:
On the Odd Area of Planar Sets. Discret. Comput. Geom. 55(3): 715-724 (2016) - [j38]Igor Pak, Adam Sheffer, Martin Tassy:
Fast Domino Tileability. Discret. Comput. Geom. 56(2): 377-394 (2016) - [c13]Scott Garrabrant, Igor Pak:
Permutation patterns are hard to count. SODA 2016: 923-936 - [i6]Danny Nguyen, Igor Pak:
Enumeration of integer points in projections of unbounded polyhedra. CoRR abs/1612.08030 (2016) - 2015
- [j37]Igor Pak, Robin Pemantle:
On the Longest $k$-Alternating Subsequence. Electron. J. Comb. 22(1): 1 (2015) - [i5]Scott Garrabrant, Igor Pak:
Pattern avoidance is not P-recursive. CoRR abs/1505.06508 (2015) - 2014
- [j36]Sam Miner, Igor Pak:
The shape of random pattern-avoiding permutations. Adv. Appl. Math. 55: 86-130 (2014) - [j35]Matjaz Konvalinka, Igor Pak:
Cayley compositions, partitions, polytopes, and geometric bijections. J. Comb. Theory A 123(1): 86-91 (2014) - [j34]Igor Gorodezky, Igor Pak:
Generalized loop-erased random walks and approximate reachability. Random Struct. Algorithms 44(2): 201-223 (2014) - [i4]Igor Pak, Greta Panova:
On the complexity of computing Kronecker coefficients. CoRR abs/1404.0653 (2014) - 2013
- [j33]Igor Pak, Jed Yang:
The Complexity of Generalized Domino Tilings. Electron. J. Comb. 20(4): 12 (2013) - [j32]Igor Pak, Dan Vilenchik:
Constructing Uniquely Realizable Graphs. Discret. Comput. Geom. 50(4): 1051-1071 (2013) - [j31]Igor Pak, Jed Yang:
Tiling simply connected regions with rectangles. J. Comb. Theory A 120(7): 1804-1816 (2013) - [i3]Igor Pak, Jed Yang:
The complexity of generalized domino tilings. CoRR abs/1305.2154 (2013) - [i2]Igor Pak, Jed Yang:
Tiling simply connected regions with rectangles. CoRR abs/1305.2796 (2013) - [i1]Igor Pak, Stedman Wilson:
A Quantitative Steinitz Theorem for Plane Triangulations. CoRR abs/1311.0558 (2013) - 2012
- [j30]Eryk Kopczynski, Igor Pak, Piotr Przytycki:
Acute triangulations of polyhedra and ℝ N. Comb. 32(1): 85-110 (2012) - [j29]Igor Pak:
Testing commutativity of a group and the power of randomization. LMS J. Comput. Math. 15: 38-43 (2012) - [j28]Igor Pak, Rom Pinchasi:
Collapsing Walls Theorem. Am. Math. Mon. 119(2): 156-160 (2012) - 2011
- [j27]Ionut Ciocan-Fontanine, Matjaz Konvalinka, Igor Pak:
The weighted hook length formula. J. Comb. Theory A 118(6): 1703-1717 (2011) - 2010
- [j26]Igor Pak, Ernesto Vallejo:
Reductions of Young Tableau Bijections. SIAM J. Discret. Math. 24(1): 113-145 (2010) - [c12]Matjaz Konvalinka, Igor Pak:
Complexity of O'Hara's Algorithm. CTW 2010 - [c11]Eryk Kopczynski, Igor Pak, Piotr Przytycki:
Acute triangulations of polyhedra and the Euclidean space. SCG 2010: 307-313
2000 – 2009
- 2009
- [j25]Matjaz Konvalinka, Igor Pak:
Geometry and complexity of O'Hara's algorithm. Adv. Appl. Math. 42(2): 157-175 (2009) - [j24]Igor Pak, Rados Radoicic:
Hamiltonian paths in Cayley graphs. Discret. Math. 309(17): 5501-5508 (2009) - 2008
- [j23]Ezra Miller, Igor Pak:
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings. Discret. Comput. Geom. 39(1-3): 339-388 (2008) - [j22]Igor Pak:
Inflating the Cube Without Stretching. Am. Math. Mon. 115(5): 443-445 (2008) - 2006
- [j21]Alexander Gamburd, Igor Pak:
Expansion Of Product Replacement Graphs. Comb. 26(4): 411-429 (2006) - [j20]Christopher Malon, Igor Pak:
Percolation on Finite Cayley Graphs. Comb. Probab. Comput. 15(4): 571-588 (2006) - [j19]Cilanne Boulet, Igor Pak:
A combinatorial proof of the Rogers-Ramanujan and Schur identities. J. Comb. Theory A 113(6): 1019-1030 (2006) - 2005
- [j18]Igor Pak:
The area of cyclic polygons: Recent progress on Robbins' conjectures. Adv. Appl. Math. 34(4): 690-696 (2005) - [j17]Igor Pak, Ernesto Vallejo:
Combinatorics and geometry of Littlewood-Richardson cones. Eur. J. Comb. 26(6): 995-1008 (2005) - 2004
- [j16]Igor Pak:
The nature of partition bijections I. Involutions. Adv. Appl. Math. 33(2): 263-289 (2004) - [j15]Christine Bessenrodt, Igor Pak:
Partition congruences by involutions. Eur. J. Comb. 25(8): 1139-1149 (2004) - [j14]László Babai, Igor Pak:
Strong bias of group generators: an obstacle to the "product replacement algorithm". J. Algorithms 50(2): 215-231 (2004) - [j13]Sergi Elizalde, Igor Pak:
Bijections for refined restricted permutations. J. Comb. Theory A 105(2): 207-219 (2004) - [j12]Michael Korn, Igor Pak:
Tilings of rectangles with T-tetrominoes. Theor. Comput. Sci. 319(1-3): 3-27 (2004) - 2003
- [j11]Igor Pak:
Tile invariants: new horizons. Theor. Comput. Sci. 303(2-3): 303-331 (2003) - 2002
- [j10]Cristopher Moore, Igor Pak:
Ribbon Tile Invariants from the Signed Area. J. Comb. Theory A 98(1): 1-16 (2002) - [c10]Christopher Malon, Igor Pak:
Percolation on Finite Cayley Graphs. RANDOM 2002: 91-104 - [c9]Igor Pak:
Mixing time and long paths in graphs. SODA 2002: 321-328 - [c8]Alexander Gamburd, Igor Pak:
Expansion of product replacement graphs. SODA 2002: 691-696 - 2001
- [j9]Igor Pak, Van H. Vu:
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes. Discret. Appl. Math. 110(2-3): 251-272 (2001) - [j8]Roman Muchnik, Igor Pak:
On Growth of Grigorchuk Groups. Int. J. Algebra Comput. 11(1): 1-18 (2001) - 2000
- [j7]Igor Pak:
On the Number of Faces of Certain Transportation Polytopes. Eur. J. Comb. 21(5): 689-694 (2000) - [j6]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) - [c7]Igor Pak:
The product replacement algorithm is polynomial. FOCS 2000: 476-485 - [c6]László Babai, Igor Pak:
Strong bias of group generators: an obstacle to the "product replacement algorithm". SODA 2000: 627-635
1990 – 1999
- 1999
- [j5]Igor Pak:
Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees. Discret. Math. 204(1-3): 329-335 (1999) - [j4]Roman Muchnik, Igor Pak:
On Tilings by Ribbon Tetrominoes. J. Comb. Theory A 88(1): 188-193 (1999) - [c5]Igor Pak:
Random Cayley Graphs with O(log[G]) Generators Are Expanders. ESA 1999: 521-526 - [c4]Igor Pak, Sergey Bratus:
On Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract). ISSAC 1999: 91-96 - [c3]Igor Pak:
Using Stopping Times to Bound Mixing Times. SODA 1999: 953-954 - [c2]Fang Chen, László Lovász, Igor Pak:
Lifting Markov Chains to Speed up Mixing. STOC 1999: 275-281 - 1998
- [j3]Igor Pak, Alexander Postnikov:
A generalization of Sylvester's identity. Discret. Math. 178(1-3): 277-281 (1998) - 1997
- [j2]Jean-Christophe Novelli, Igor Pak, Alexander V. Stoyanovskii:
A direct bijective proof of the hook-length formula. Discret. Math. Theor. Comput. Sci. 1(1): 53-67 (1997) - [c1]Igor Pak:
When and how n choose k. Randomization Methods in Algorithm Design 1997: 191-238 - 1996
- [j1]Alexander Kuznetsov, Igor Pak, Alexander Postnikov:
Trees Associated with the Motzkin Numbers. J. Comb. Theory A 76(1): 145-147 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
