Algorithms/Theory Group Meeting

College of Information and Computer Sciences
University of Massachusetts

The webpage contains the upcoming talk schedule and past presentations for our weekly group meeting. The meetings are held every Wednesday from 12 to 1pm in CS 305. If you are interested in attending or speaking, please reach out to [[ray, cnmusco] at cs dot umass dot edu].

Group Meetings Schedule

02.07.2022 Introductory meeting
02.14.2022 Archan Ray Sublinear time approximation of text similarity matrices
02.21.2022 Presidents' day. No meeting
02.28.2022 Aarshvi Gajjar Leverage score sampling for function fitting
03.07.2022 Rajarshi Bhattacharjee and Adam Lechowicz Expanders: overview and applications
03.14.2022 Spring break. No meeting
03.21.2022 Rajarshi Bhattacharjee Expanders: applications
03.28.2022 Weronika Nguyen Sketching techniques for hinge loss
04.04.2022 Sudhanshu Chanpuriya A unifying generative model for graph learning algorithms
04.11.2022 Kyle Doney Super Turing machines
04.18.2022 Easter Monday. No meeting
04.25.2022 Adam Lechowicz Edge dynamics and opinion polarization in social networks (Honors Thesis talk)
06.13.2022 Gregory Dexter Randomized linear algebra for interior point methods
06.27.2022 Cuong Than Greedy spanners in euclidean spaces admit sublinear separators
09.26.2022 Rik Sengupta Graph reconstruction from random subgraphs
02.01.2023 Justin Payan Algorithms for reviewer assignment
02.08.2023 Weronika Nguyen Johnson–Lindenstrauss lemma
02.15.2023 Rajarshi Bhattacharjee Chebyshev Polynomials
02.22.2023 Rajarshi Bhattacharjee Chebyshev Polynomials (Continued)
03.01.2023 Zongchen Chen Candidate Talk
03.08.2023 Adam Lechowicz Online pause & resume algorithms

Acknowledgement

The theme is borrowed from the Autonomous Learning Lab website.