Combinatorics, Groups, Algorithms, and Complexity

List of talks

The following is a list of the talk titles.

• Scott Aaronson (MIT): Arthur-Merlin and Black-Box Groups in Quantum Computing (Or, How Laci Did Quantum Stuff Without Knowing It)
• Miklós Abért (Rényi Inst., Budapest): On the geometry of Ramanujan graphs
• László Babai (U Chicago): Some of my favorite problems
• Robert Bailey (Regina, Canada): Metric Dimension of Distance-regular Graphs pdf file
• Robert Beals (CCR - Princeton): Polynomial-time Theory of Matrix Groups
• Robert Burns (York U, Canada): Transforming normal-generating n-tuples of a group into generating n-tuples
• Steven Butler (UCLA): Shuffling with ordered cards pdf file
• Peter J. Cameron (Queen Mary, London): Bases for permutation groups and combinatorial structures pdf file
• Sourav Chakraborty (CWI, Amsterdam): Query Complexity Lower Bounds for Reconstruction
• Paolo Codenotti (Chicago): Isomorphism of Hypergraphs of Low Rank in Moderately Exponential Time pdf file
• Éva Czabarka (South Carolina): Sperner-type problems and results pdf file
• Alla Detinko (Galway, Ireland): Towards efficient computing with matrix groups over infinite domains pdf file
• Oren Dinai (Geneva): Growth in Some Finite Simple Groups of Lie Type of Rank One
• John Dixon (Carleton, Ottawa): Finite Group Representations: from Approximate to Exact
• Lance Fortnow (Northwestern): Babai, the Wizard, and the Power of Local Interaction
• Zoltán Füredi (UIUC and Rényi Inst., Budapest): Partition-critical hypergraphs pdf file
• Martin Fürer (Penn State): Combinatorial Methods for the Graph Isomorphism Problem pdf file
• Shelly Garion (MPI, Bonn): The product replacement algorithm graph of finite simple groups pdf file
• Anna Gál (U Texas - Austin): On the limitations of 3-query linear locally decodable codes
• Chris Godsil (Waterloo): Quantum Physics and Graph Spectra
• Igor Gorodezky (Cornell): Towards an approximation algorithm for the directed all-terminal network reliability problem
• Shonda Gosselin (Winnipeg): Paley-like uniform hypergraphs pdf file
• Ronald L. Graham (UCSD): Descents and Drops of a Permutation
• Uzy Hadad (Weizmann and The Open University, Israel): On the Shortest Identity in Finite Simple Groups of Lie Type
• Péter Hajnal (Szeged, Hungary): On long alternating non-crossing paths in 2-equicolored convex sets
• Tom Hayes (U New Mexico): Liftings of Tree-Structured Markov Chains
• Harald Helfgott (Bristol, U.K.): Growth of Small Sets in SL_n
• Gábor Hetyei (Charlotte NC): Bernoulli Type Truncation Games and Connected Permutations pdf file
• Wilfried Imrich (Leoben, Austria): Products of Finite and Infinite Graphs
• Gábor Ivanyos (SzTAKI, Budapest): Modules and maximum rank matrix completion pdf file
• Delaram Kahrobaei (CUNY): Aspects of Nonabelian Group Based Cryptography
• William M. Kantor (U Oregon): Short Presentations of Finite Simple Groups
• Martin Kassabov (Cornell): Spectral gap of Cayley graphs of Coxeter groups pdf file
• Subhash Khot (NYU): Sharp kernel clustering algorithms and their associated Grothendieck inequalities
• Shiva Kintali (GA Tech): Complexity of Scarf's Lemma and Fractional Stability Problems
• Raghav Kulkarni (Chicago): Decision tree complexity, solvable groups, and the distribution of prime numbers
• Gábor Kun (DIMACS and IAS, Princeton): Proof of the Bollobás-Catlin-Eldridge conjecture
• Sandy Kutin (CCR - Princeton): Quantum Interpolation of Polynomials
• Gábor Lippner (Harvard): Parameter testing with Borel Oracles
• Satya V. Lokam (MS Research - Bangalore): Matrix Rigidity and Complexity of Linear Transformations pdf file
• Alex Lubotzky (Hebrew U): Short Presentations of Finite Simple Groups
• Eugene M. Luks (U Oregon): Permutation groups in parallel: canonical forms pdf file
• Bojan Mohar (Simon Fraser, BC, Canada): Rough Structure Theorem For Symmetric Graphs with Small Separations
• Dhruv Mubayi (U Illinois, Chicago): Coloring Simple Hypergraphs
• Jaroslav Nešetřil (Charles U, Prague): Small and simple representations
• Yared Nigussie (East Tennessee St U): Finite dualities by forbidding a clique minor
• Lale Ozkahya (UIUC): On Extremal Cycle-free Subgraphs of the Hypercube
• Péter P. Pach (Eötvös U, Budapest): On the minimal distance of polynomial near-ring codes
• Igor Pak (UCLA): Generating random trees
• Péter P. Pálfy (Rényi Inst., Budapest): On the isomorphism problem of Cayley graphs pdf file
• Toniann Pitassi (Toronto): Multiparty Communication Complexity since Babai-Nisan-Szegedy
• Gabriella Pluhár (Eötvös U, Budapest): Islands on rectangular and triangular grids
• András Pongrácz (CEU, Budapest): Compatible functions on permtation groups
• Cheryl E. Praeger (Western Australia): Serendipity, involutions and regular semisimple matrices pdf file
• László Pyber (Rényi Inst., Budapest): Growth in finite simple groups of Lie type of bounded rank
• Alexander Razborov (Chicago): A Product Theorem in Free Groups
• Lajos Rónyai (SzTAKI, Budapest): Polynomial functions on finite point sets
• Alex Russell (U Connecticut): Approximating the Permanent with Nonabelian Determinants
• Paul Schupp (UIUC): Cellular Automata on Cayley Graphs and Amenability
• Gábor Somlai (Eötvös U, Budapest): Cayley graphs of elementary abelian p-groups
• Daniel Štefankovič (Rochester, N.Y.): A graph polynomial for independent sets of bipartite graphs powerpoint file
• Madhu Sudan (MIT): Invariance in Property Testing
• Zoran Sunic (Texas A&M): Paired Hanoi Towers Problem
• Csaba Szabó (Eötvös U, Budapest): On the computational complexity of solving equations over finite groups
• Éva Tardos (Cornell): Price of Anarchy and Adword Auctions
• Gábor Tardos (Simon Fraser & Rényi): An Algorithmic Proof of the Lovász Local Lemma powerpoint file
• György Turán (UIC & Szeged): Horn Formulas or Directed Hypergraphs: Combinatorics and Complexity
• Emanuele Viola (Northeastern U, Boston): On the Complexity of Generating Distributions
• Yan Wang (Yan Tai U, China): Self-dual and Self-Petrie-dual Maps
• Avi Wigderson (IAS, Princeton): Groups and Expanders powerpoint file
• James B. Wilson (Ohio State): Finding Direct Products of Permutation Groups is in P pdf file
• Jing Xu (Beijing): Vertex transitive tournaments of order pq
• Sükrü Yalcinkaya (Western Australia): The generalization of siskebap theorem and black box groups
• Taoye Zhang (Penn State): Group Connectivity of Cayley Graphs