CS 594 Final Presentation: Spring 2022
Schedule
April 19
- Kumar Chandrasekhar, Ragavee Poosappagounder Kandavel, Smrithi Balki
- Chinmay Tarwate, Tanmay Kelkar
- Xing Gao
- Tianyu Zhu
April 21
- Mingquan Ye
- Venkata Likith Ayyagari, Kushal Palvai
- Arvind Gupta, Gnanamanickam Arumugaperumal
- Pranavi Alle, Adeem Shaik
- Wenyu Jin
April 26
- Goutham Reddy Inturi, Jahnavi Reddy Ega
- Jesse Coultas
- Rishi Advani, Nima Shahbazi, Ian Swift
- Jake Maranzatto
- Shivali Singh
April 28
- Alluri Manoj Kumar, Sai Anish Garapati
- Sriman Cherukuru, Siddarth Menon, Shashwath Jawaharlal Sathyanarayan
- Parth Deshpande, Shahrukh Haider
- Robert Finedore
Overview of Presentation Expectations and Requirements
The purpose of the final presentation of this course is to encourage students to exchange their ideas about representations in computer science from both theoretical and practical
viewpoints, although most of this course focuses on theoretical results.
The presentation can be a solo presention or a group presentation with at most three people in each group.
The presentation time is 10 minutes per person (if your group has two (or three) people, then the presentation time of your group is 20 (or 30) minutes.
You can choose between the following three kinds of research presentation:
(a) What are the representations used in your research? You are supposed to show the representations used in your research project.
(b) New research project. Choose a topic that is related to representations in computer science, and study the algorithms that make use of the representations.
(c) Research survey. You are suppose to choose a topic that use representations to solve some problem, read several (usually two or three) research papers related to this topic,
and give a long presentation about your survey.
The timetable for final presentations will be as follows:
-
Thur March 31: Turn in a brief (1-2 paragraph) presentation proposal to
me by email, describing your chosen topic, the sources you will use, and the group members (if it is a group presentation).
-
Tue April 19, Thur April 21, Tue April 26, Thur April 28:
Presentations.
Possible Presentation Topics
I strongly encourage you to propose the topic by yourself based on your own research interests.
Both theoretical and practial presentaions are welcome.
Below are some potential presentation topics with associated references to the literature (mostly from theoretical side).
(topic means the topic has been taken by other students.)
-
Short cycle decomposition
- [CGP+18] Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions
- [LSY18] Short Cycles via Low-Diameter Decompositions
-
Spanner:
-
[PS89] Graph spanners
-
[ADD+93] On sparse spanners of weighted graphs
-
[ACM96] Fast Estimation of Diameter and Shortest Paths
-
[AB20] The 4/3 Additive Spanner Exponent is Tight
-
Expander and error correcting codes:
-
[SS96] Expander codes
-
[LR97] Spectral techniques for expander codes
-
[Zemor01] On expander codes
-
[BZ02] Error exponents of expander codes
-
Graph clustering:
-
[DFK+99] Clustering in Large Graphs and Matrices
-
[KVV20] On Clusterings - Good, Bad and Spectral
-
[Vempala07] Spectral Algorithms for Learning and Clustering
-
Laplacian solver:
-
[ST14] Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
-
[KLP10] Approaching optimality for solving SDD systems
-
[KS16] Approximate Gaussian Elimination for Laplacians: Fast,
Sparse, and Simple
-
Spectral sparsification of graphs:
-
[ST10] Spectral Sparsification of Graphs
-
[SS11] Graph sparsification by effective resistances
-
Dynamic spectral sparsification:
-
[DGG19] Fully dynamic spectral vertex sparsifiers and applications
-
[LGH20] Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
-
Laplacian based max flow algorithms:
-
[CKM+10] Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
-
[GLP21] Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
-
[CKL+22] Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
-
Oblivious routings:
-
[Madry10] Fast approximation algorithms for cut-based problems
in undirected graphs
-
[BKK+16] Approximate undirected transshipment and shortest paths
via gradient descent
-
Dynamic transitive closure:
-
[KS99] A fully dynamic algorithm for maintaining the transitive closure
-
[DI00] Trade-offs for Fully Dynamic Transitive Closure on DAGs
-
Matrix multiplication:
-
[Williams12] Multiplying matrices faster than Coppersmith-Winograd
-
[AW18] Further limitations of the known approaches for matrix multiplication
-
[AW18] Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
-
Graph isomorphism:
-
[Spielman96] Faster Isomorphism Testing of Strongly Regular Graphs
-
[Babai16] Graph Isomorphism in Quasipolynomial Time