This workshop aims to bring together researchers interested in problems that can benefit from a combination of geometric, probabilistic and algorithmic approaches. The interplay between geometry, probability and algorithms has been quite fruitful; particularly so in theoretical computer science. Some broad directions that serve as an example are the success of spectral, and more generally, convex programming approaches to combinatorial optimization, the development and application of expanders (and more recently, high-dimensional expanders), and random walk based approaches to sampling and counting (along with their connections to geometric notions such as isoperimetry). In this workshop, we propose to focus on a selection of recent and upcoming research directions arising from this interplay.
Accommodation will be provided for outstation participants at our on campus guest house.
Eligiblity criteria:
- Students in the following years of study in any quantitative field (engineering, mathematics, statistics, physics, etc.) programs of study, with some exposure to computer science.
- B. Tech. or B. Sc. : 3rd year or higher
- M. Tech. or M. Sc. : any year
- Ph.D. : any year
2. Postdoctoral researchers and faculty members
ICTS is committed to building an environment that is inclusive, non discriminatory and welcoming of diverse individuals. We especially encourage the participation of women and other under-represented groups.
- Application
- Other links