Skip to content
cs-conference-ranking.org

Igor Pak

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

16

Venues

6

Active years

1999–2025

Best venue rank

A*

Where they publish

Papers

16 indexed papers, newest first.

YearVenueTitleAuthors
2025STOCVanishing of Schubert Coefficients.Igor Pak, Colleen Robichaux
2024STOCEquality Cases of the Alexandrov-Fenchel Inequality Are Not in the Polynomial Hierarchy.Swee Hong Chan, Igor Pak
2023SODAPositivity of the symmetric group characters is as hard as the polynomial time hierarchy.Christian Ikenmeyer, Igor Pak, Greta Panova
2022FOCSWhat is in #P and what is not?Christian Ikenmeyer, Igor Pak
2017FOCSShort Presburger Arithmetic Is Hard.Danny Nguyen, Igor Pak
2017IPCOEnumeration of Integer Points in Projections of Unbounded Polyhedra.Danny Nguyen, Igor Pak
2017STOCComplexity of short Presburger arithmetic.Danny Nguyen, Igor Pak
2016SODAPermutation patterns are hard to count.Scott Garrabrant, Igor Pak
2002SODAExpansion of product replacement graphs.Alexander Gamburd, Igor Pak
2002SODAMixing time and long paths in graphs.Igor Pak
2000FOCSThe product replacement algorithm is polynomial.Igor Pak
2000SODAStrong bias of group generators: an obstacle to the "product replacement algorithm".Lszl Babai, Igor Pak
1999ESARandom Cayley Graphs with O(log[G]) Generators Are Expanders.Igor Pak
1999ISSACOn Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract).Igor Pak, Sergey Bratus
1999SODAUsing Stopping Times to Bound Mixing Times.Igor Pak
1999STOCLifting Markov Chains to Speed up Mixing.Fang Chen, Lszl Lovsz, Igor Pak