Selected Talks

• Balanced Allocation: Patience is not a Virtue

  Speaker: William Moses Jr.
  

• Sums of read-once formulas: How many summands suffice?

  Speaker: Anuj Tawari
  

• Noncommutative Valiant's Classes: Structure and Complete Problems

  Speaker: S. Raja
  

• Subexponential algorithms for Rectilinear Steiner tree and arborescence

  Speaker: S. Kolay
  

• Tree reconstruction using separator queries

  Speaker: Jagadish M.
  

• Limitations of sum of products of Read-Once Polynomials

  Speaker: Ramya Chandrasekar
  

• Complete and Intermediate polynomials in Algebraic Complexity Theory

  Speaker: Nitin Saurabh
  

• Polynomial kernel for Vertex Cover parameterized by small degree modulators

  Speaker: Diptapriyo Majumdar
  

• Characterization and Lower Bounds for Branching Program Size using Projective Dimension

  Speaker: Krishnamoorthy Dinesh
  

• Parameterized Complexity of Red Blue Set Cover for lines

  Speaker: Pradeesha Ashok
  

• Fast Gaussian Process Regression for Big Data

  Speaker: Rajiv Sambasivan
  

• Learning Rotations from Images

  Speaker: Muthuvel Murugan
  

• On Minimum Average Stretch Spanning Trees in Grid Graphs

  Speaker: Pankaj Pundir
  

• On the Limitations of Color-Refinement and Linear-Programming Approaches to Graph Isomorphism

  Speaker: Gaurav Rattan
  

• Limited Set Quantifiers over Countable Linear Orderings

  Speaker: A. V. Sreejith
  

• Factorisations over Orbit-finite Nominal Monoids

  Speaker: Amaldev Manuel
  

• Harmonious Coloring

  Speaker: Prafullakumar P Tale