Scope:

We are pleased to announce an ICM-2010 satellite conference on Algebraic and Probabilistic Aspects of Combinatorics and Computing, organized jointly by Indian Instiute of Science (IISc, Bangalore) and Microsoft Research India (Bangalore) on behalf of The Institute of Mathematical Sciences (IMSc, Chennai), Tata Institute of Fundamental Research (TIFR, Mumbai) and Indian Institute of Technology (IIT, Kanpur) under the auspices of the ICM-2010 and the IISc Mathematics Initiative (IMI) at IISc.

This conference plans to provide an exposure to the latest developments in Combinatorics and Theory of Computing where ideas and tools from Algebra and Probability Theory play an important role. In particular, we plan to focus on Algebra and Computation , Communication Complexity , and Probabilistic Combinatorics.

Speakers :

  • Dimitris Achlioptas (University of California, Santa Cruz) // abstract // Algorithmic barriers from phase transitions
  • Manindra Agrawal (IIT, Kanpur) // abstract // On the Arithmetic Complexity of Euler Function
  • Amit Chakrabarti (Dartmouth College, Hanover) // abstract // An optimal lower bound for the Gap-Hamming-Distance problem
  • Venkatesan Guruswami (Carnegie Mellon University) // abstract // List-decodability of random linear codes
  • Ragesh Jaiswal ( Columbia University, New York ) // abstract // A survey on threshold direct product theorems
  • Ravi Kannan (Microsoft Research, Bangalore) // abstract // Two probability inequalities and concentration results
  • Neeraj Kayal (Microsoft Research, Bangalore) // abstract // Complexity of obtaining a polynomial from another via a linear projection
  • Michael Krivelevich (Tel Aviv University) // abstract // Hamiltonicity games
  • Tomasz Luczak (Adam Mickiewicz University, Poland and Emory University, Atlanta) // abstract // On the structure of dense $H$-free graphs
  • Dhruv Mubayi (University of Illinois, Chicago) // abstract // Coloring simple hypergraphs
  • Alex Samorodnitsky (The Hebrew University of Jerusalem) // abstract // Lower bounds for designs in symmetric spaces
  • Rahul Santhanam (University of Edinburgh) // abstract // New upper bounds for formula satisfiability based on random restrictions
  • Nitin Saxena (Hausdorff Center for Mathematics, Bonn) // abstract // Polynomial identities and Sylvester-Gallai configurations
  • Alexander Sherstov (Microsoft Research, New England) // abstract // Duality in communication complexity
  • Nikhil Srivastava (presently at Microsoft Research, Bangalore ) // abstract // Twice Ramanujan Sparcifiers
  • C.R. Subramanian ( Institute of Mathematical Sciences, Chennai) // abstract // Random digraphs : some concentration results

    Registration and Accommodation :

  • Registration and the conference are over !!!

    Programme Organisers: