Power-laws and weak convergence of the Kingman coalescent STCS Seminar Speaker: Henrik HultOrganisers: Sandeep K JunejaTime: Friday, 29 April 2022, 16:00 to 17:00 Venue: A-201 Seminar Room The Kingman coalescent is an important and well-studied process in population genetics modelling the ancestry of a sample of individuals. Read more about Power-laws and weak convergence of the Kingman coalescent
Towards Verifying AI Systems: Testing of Samplers STCS Seminar Speaker: Kuldeep S. MeelOrganisers: Umang BhaskarTime: Thursday, 20 June 2019, 11:00 to 12:00 Venue: A-201 Seminar Room Webpage: https://www.comp.nus.edu.sg/~meel/Abstract: The modern AI systems significantly differ from traditional systems in their reliance on probabilistic reasoning. Read more about Towards Verifying AI Systems: Testing of Samplers
Trees that contain all small trees STCS Student Seminar Speaker: Anamay Tengse, TIFR Organisers: Gowtham Raghunath KurriTime: Friday, 7 June 2019, 17:15 Venue: A-201 Seminar Room A tree is said to be n-universal if it "contains" all binary trees with at most n leaves. A result of Chung, Graham and Coppersmith from 1981 shows that when this containment is via sub-graphs, an n-universal tree requires size n^Omega(log(n)). Read more about Trees that contain all small trees
Independence Results in Propositional Proof Complexity STCS Seminar Speaker: Rahul SanthanamOrganisers: Arkadev ChattopadhyayTime: Thursday, 11 April 2019, 16:30 to 17:30 Venue: A-201 Seminar Room Abstract: Given the lack of progress on complexity lower bounds, it is natural to ask whether they are hard to prove, in some formal sense. Read more about Independence Results in Propositional Proof Complexity
