This page lists the research symposium conducted by the Department of CSE, IIT Palakkad. The symposium is usually a full day event consisting mainly of research talks on completed or on-going research problems by the research scholars (and occasionally by faculty) of the department.
See here for past instances of the CSE research symposium.
Program schedule for Research Symposium 2025
Coordinates
- When ? - 15th February 2025 (Saturday)
- Where ? - Room 305, Samgatha, Nila Campus
- Coordinators - Pratik Ghosal and Avirup Mandal
Talk Schedule
| Time | Title | Speaker |
|---|---|---|
| 9:30 AM - 9:40 AM | Welcome Talk | |
| 9:40 AM - 10:40 AM | Invited talk - Invitation to some open problems in theory ! | Prof. Venkatesh Raman |
| 10.40 AM - 11.00 AM | Tea Break | |
| 11:00 AM - 12:00 PM | Invited talk - Parallel Graph Algorithms | Prof. Rupesh Nasre |
| 12:00 PM - 12:30 PM | Student Talk 1 | Jishnu Sen |
| 01:00 PM - 02:00 PM | Lunch Break | |
| 02:00 PM - 02:30 PM | Student Talk 2 | Amruta Benny |
| 02:30 PM - 03:00 PM | Student Talk 3 | Kutty Malu |
| 03:00 PM - 03:30 PM | Student Talk 4 | Ayantika Laha |
| 03:30 PM - 03:40 PM | Tea break | |
| 03:40 PM - 04:20 PM | Interactive Session | |
| 04:20 PM - 04:30 PM | Vote of Thanks | |
Invited talk: Invitation to some open problems in theory!
Abstract: I will give a guided tour of some of the problems I have worked on (including some open problems) in
- Selection from read-only memory
- Membership data structures in the bitprobe model
- Finding kings in tournaments, and
- Parameterized and kernelisation complexity of vertex cover, feedback vertex set and odd cycle transversal.
About the speaker: Venkatesh Raman obtained his PhD from the University of Waterloo, Canada, and was a faculty member in the Institute of Mathematical Sciences, Chennai, from 1991-2024. His primary research interests are in the area of data structures and algorithms, in particular in succinct data structures and parameterized and exact algorithms.
He has been on the ACM-India council since 2016, where he served as Vice-President from 2018-20, Secretary/Treasurer from 2020-22 and President from 2022-24. He played key roles in the initiation of ACM-India programs like summer/winter schools, conferences on Computational Thinking in Schools and in the revamped versions of the COMPUTE conference and ARCS symposium for PhD students.
Invited talk: Parallel Graph Algorithms
Abstract: From molecular forces to galactic movement, several natural phenomena can be modeled using graphs. With the growth in unstructured data sizes and advances in parallel hardware, it is inevitable to marry the two. Unfortunately, this marriage has a lot of opposition from irregular memory accesses, unpredictable control flow, and requirement of synchronization, among other villains. In this story, we will learn how to efficiently execute and compile graph algorithms on parallel hardware such as GPUs. The plot revolves around two heroes: data-driven and topology-driven processing, who uncover the secrets of efficient graph analytics with the help of several supporting actors. The climax will be an automated parallel code generator for graph algorithms. I hope to see you there.
About the speaker: Rupesh is a faculty member in the CSE Department at IIT Madras. He completed BE from VRCE Nagpur, MTech from IIT Bombay, PhD from IISc Bangalore, and Post-Doctoral Fellowship from the University of Texas at Austin. His research focus is in Compilers and Parallelization.