Arindam Khan
@arindamkhan.bsky.social
Algorithmist | CS Prof. @ IISc Bangalore | Past: Georgia Tech, IIT Kharagpur
Algo-rindam Youtube: https://www.youtube.com/@ArindamKhan
LinkedIn: https://www.linkedin.com/in/arindam-khan-445ab615/
Algo-rindam Youtube: https://www.youtube.com/@ArindamKhan
LinkedIn: https://www.linkedin.com/in/arindam-khan-445ab615/
𝗖𝗮𝗹𝗹 𝗳𝗼𝗿 𝗣𝗼𝘀𝘁𝗱𝗼𝗰𝘁𝗼𝗿𝗮𝗹 𝗙𝗲𝗹𝗹𝗼𝘄𝘀 𝗶𝗻 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 & 𝗧𝗵𝗲𝗼𝗿𝘆
𝗜𝗻𝗱𝗶𝗮𝗻 𝗜𝗻𝘀𝘁𝗶𝘁𝘂𝘁𝗲 𝗼𝗳 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 (𝗜𝗜𝗦𝗰), 𝗕𝗲𝗻𝗴𝗮𝗹𝘂𝗿𝘂
The Algorithms group at IISc invites applications for multiple 𝗣𝗼𝘀𝘁-𝗗𝗼𝗰𝘁𝗼𝗿𝗮𝗹 𝗙𝗲𝗹𝗹𝗼𝘄𝘀𝗵𝗶𝗽𝘀 in Algorithms & Theory.
𝗔𝗽𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻 𝗟𝗶𝗻𝗸: forms.gle/moz2vx7tiNFC...
𝗗𝗲𝗮𝗱𝗹𝗶𝗻𝗲: 28 February
#postdocs
(1/n)
𝗜𝗻𝗱𝗶𝗮𝗻 𝗜𝗻𝘀𝘁𝗶𝘁𝘂𝘁𝗲 𝗼𝗳 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 (𝗜𝗜𝗦𝗰), 𝗕𝗲𝗻𝗴𝗮𝗹𝘂𝗿𝘂
The Algorithms group at IISc invites applications for multiple 𝗣𝗼𝘀𝘁-𝗗𝗼𝗰𝘁𝗼𝗿𝗮𝗹 𝗙𝗲𝗹𝗹𝗼𝘄𝘀𝗵𝗶𝗽𝘀 in Algorithms & Theory.
𝗔𝗽𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻 𝗟𝗶𝗻𝗸: forms.gle/moz2vx7tiNFC...
𝗗𝗲𝗮𝗱𝗹𝗶𝗻𝗲: 28 February
#postdocs
(1/n)
LinkedIn
This link will take you to a page that’s not on LinkedIn
lnkd.in
February 11, 2026 at 9:50 AM
𝗖𝗮𝗹𝗹 𝗳𝗼𝗿 𝗣𝗼𝘀𝘁𝗱𝗼𝗰𝘁𝗼𝗿𝗮𝗹 𝗙𝗲𝗹𝗹𝗼𝘄𝘀 𝗶𝗻 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 & 𝗧𝗵𝗲𝗼𝗿𝘆
𝗜𝗻𝗱𝗶𝗮𝗻 𝗜𝗻𝘀𝘁𝗶𝘁𝘂𝘁𝗲 𝗼𝗳 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 (𝗜𝗜𝗦𝗰), 𝗕𝗲𝗻𝗴𝗮𝗹𝘂𝗿𝘂
The Algorithms group at IISc invites applications for multiple 𝗣𝗼𝘀𝘁-𝗗𝗼𝗰𝘁𝗼𝗿𝗮𝗹 𝗙𝗲𝗹𝗹𝗼𝘄𝘀𝗵𝗶𝗽𝘀 in Algorithms & Theory.
𝗔𝗽𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻 𝗟𝗶𝗻𝗸: forms.gle/moz2vx7tiNFC...
𝗗𝗲𝗮𝗱𝗹𝗶𝗻𝗲: 28 February
#postdocs
(1/n)
𝗜𝗻𝗱𝗶𝗮𝗻 𝗜𝗻𝘀𝘁𝗶𝘁𝘂𝘁𝗲 𝗼𝗳 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 (𝗜𝗜𝗦𝗰), 𝗕𝗲𝗻𝗴𝗮𝗹𝘂𝗿𝘂
The Algorithms group at IISc invites applications for multiple 𝗣𝗼𝘀𝘁-𝗗𝗼𝗰𝘁𝗼𝗿𝗮𝗹 𝗙𝗲𝗹𝗹𝗼𝘄𝘀𝗵𝗶𝗽𝘀 in Algorithms & Theory.
𝗔𝗽𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻 𝗟𝗶𝗻𝗸: forms.gle/moz2vx7tiNFC...
𝗗𝗲𝗮𝗱𝗹𝗶𝗻𝗲: 28 February
#postdocs
(1/n)
New Blog:
www.linkedin.com/pulse/how-ha...
Some problems don’t yield to quick tricks.
They demand patience and the humility to fail repeatedly.
If you're working on a hard problem & wondering whether it’s worth it: 𝗧𝗵𝗲 𝗽𝗮𝘆𝗼𝗳𝗳 𝗶𝘀 𝗼𝗳𝘁𝗲𝗻 𝗮 𝗱𝗲𝗰𝗮𝗱𝗲 𝗮𝘄𝗮𝘆. 𝗧𝗵𝗮𝘁’𝘀 𝗼𝗸𝗮𝘆.
#Research #CS #Theory #Algorithms
www.linkedin.com/pulse/how-ha...
Some problems don’t yield to quick tricks.
They demand patience and the humility to fail repeatedly.
If you're working on a hard problem & wondering whether it’s worth it: 𝗧𝗵𝗲 𝗽𝗮𝘆𝗼𝗳𝗳 𝗶𝘀 𝗼𝗳𝘁𝗲𝗻 𝗮 𝗱𝗲𝗰𝗮𝗱𝗲 𝗮𝘄𝗮𝘆. 𝗧𝗵𝗮𝘁’𝘀 𝗼𝗸𝗮𝘆.
#Research #CS #Theory #Algorithms
How hard problems slowly give way -- Sometimes the payoff takes a decade.
Some problems don’t yield to quick tricks. They demand patience, structural understanding, and the humility to fail repeatedly.
www.linkedin.com
February 4, 2026 at 6:08 AM
New Blog:
www.linkedin.com/pulse/how-ha...
Some problems don’t yield to quick tricks.
They demand patience and the humility to fail repeatedly.
If you're working on a hard problem & wondering whether it’s worth it: 𝗧𝗵𝗲 𝗽𝗮𝘆𝗼𝗳𝗳 𝗶𝘀 𝗼𝗳𝘁𝗲𝗻 𝗮 𝗱𝗲𝗰𝗮𝗱𝗲 𝗮𝘄𝗮𝘆. 𝗧𝗵𝗮𝘁’𝘀 𝗼𝗸𝗮𝘆.
#Research #CS #Theory #Algorithms
www.linkedin.com/pulse/how-ha...
Some problems don’t yield to quick tricks.
They demand patience and the humility to fail repeatedly.
If you're working on a hard problem & wondering whether it’s worth it: 𝗧𝗵𝗲 𝗽𝗮𝘆𝗼𝗳𝗳 𝗶𝘀 𝗼𝗳𝘁𝗲𝗻 𝗮 𝗱𝗲𝗰𝗮𝗱𝗲 𝗮𝘄𝗮𝘆. 𝗧𝗵𝗮𝘁’𝘀 𝗼𝗸𝗮𝘆.
#Research #CS #Theory #Algorithms
🚨 𝗣𝗮𝗽𝗲𝗿 𝗶𝗻 𝗦𝗧𝗢𝗖 𝟮𝟬𝟮𝟲 | 𝗔 𝗵𝗶𝘀𝘁𝗼𝗿𝗶𝗰 𝗳𝗶𝗿𝘀𝘁! (1/n)
🎉 Huge congratulations to my PhD student Debajyoti Kar and collaborator Andreas Wiese 🎉
Our joint work has been accepted at STOC 2026 on approximation schemes for geometric knapsack with rotations.
🎉 Huge congratulations to my PhD student Debajyoti Kar and collaborator Andreas Wiese 🎉
Our joint work has been accepted at STOC 2026 on approximation schemes for geometric knapsack with rotations.
February 2, 2026 at 6:13 AM
🚨 𝗣𝗮𝗽𝗲𝗿 𝗶𝗻 𝗦𝗧𝗢𝗖 𝟮𝟬𝟮𝟲 | 𝗔 𝗵𝗶𝘀𝘁𝗼𝗿𝗶𝗰 𝗳𝗶𝗿𝘀𝘁! (1/n)
🎉 Huge congratulations to my PhD student Debajyoti Kar and collaborator Andreas Wiese 🎉
Our joint work has been accepted at STOC 2026 on approximation schemes for geometric knapsack with rotations.
🎉 Huge congratulations to my PhD student Debajyoti Kar and collaborator Andreas Wiese 🎉
Our joint work has been accepted at STOC 2026 on approximation schemes for geometric knapsack with rotations.
𝐈𝐂𝐋𝐑 𝟐𝟎𝟐𝟔 𝐚𝐜𝐜𝐞𝐩𝐭𝐚𝐧𝐜𝐞: 𝐀𝐝𝐬 𝐭𝐡𝐚𝐭 𝐒𝐭𝐢𝐜𝐤
Most ad systems still do something very simple.
They space ads uniformly, or impose crude caps, and hope for the best.
Humans, unfortunately, are not uniform.
This paper asks a basic question:
What if ad scheduling actually respected how human attention works?
Most ad systems still do something very simple.
They space ads uniformly, or impose crude caps, and hope for the best.
Humans, unfortunately, are not uniform.
This paper asks a basic question:
What if ad scheduling actually respected how human attention works?
January 27, 2026 at 3:16 AM
𝐈𝐂𝐋𝐑 𝟐𝟎𝟐𝟔 𝐚𝐜𝐜𝐞𝐩𝐭𝐚𝐧𝐜𝐞: 𝐀𝐝𝐬 𝐭𝐡𝐚𝐭 𝐒𝐭𝐢𝐜𝐤
Most ad systems still do something very simple.
They space ads uniformly, or impose crude caps, and hope for the best.
Humans, unfortunately, are not uniform.
This paper asks a basic question:
What if ad scheduling actually respected how human attention works?
Most ad systems still do something very simple.
They space ads uniformly, or impose crude caps, and hope for the best.
Humans, unfortunately, are not uniform.
This paper asks a basic question:
What if ad scheduling actually respected how human attention works?
Unwavering Grit -- Lunch with "UG" Interns!
Over the past seven years, I have mentored around 40 UG interns, and 20-25 of them joined PhD programs at top universities around the world.
With curious and bright students, learning and enthusiasm flow both ways.
#Internship #TheoryCS
Over the past seven years, I have mentored around 40 UG interns, and 20-25 of them joined PhD programs at top universities around the world.
With curious and bright students, learning and enthusiasm flow both ways.
#Internship #TheoryCS
December 24, 2025 at 3:04 PM
Unwavering Grit -- Lunch with "UG" Interns!
Over the past seven years, I have mentored around 40 UG interns, and 20-25 of them joined PhD programs at top universities around the world.
With curious and bright students, learning and enthusiasm flow both ways.
#Internship #TheoryCS
Over the past seven years, I have mentored around 40 UG interns, and 20-25 of them joined PhD programs at top universities around the world.
With curious and bright students, learning and enthusiasm flow both ways.
#Internship #TheoryCS
𝗙𝗦𝗧𝗧𝗖𝗦 𝗴𝗼𝗲𝘀 𝗶𝗻𝘁𝗲𝗿𝗻𝗮𝘁𝗶𝗼𝗻𝗮𝗹!
FSTTCS is a nearly 50-year-old flagship venue of IARCS (Indian Association for Research in Com Science).
This week, FSTTCS is underway at BITS Pilani, Goa. This edition is the largest ever, with 50 accepted papers, 8 workshops, and 350+ participants from 18+ countries.
FSTTCS is a nearly 50-year-old flagship venue of IARCS (Indian Association for Research in Com Science).
This week, FSTTCS is underway at BITS Pilani, Goa. This edition is the largest ever, with 50 accepted papers, 8 workshops, and 350+ participants from 18+ countries.
December 19, 2025 at 4:14 PM
𝗙𝗦𝗧𝗧𝗖𝗦 𝗴𝗼𝗲𝘀 𝗶𝗻𝘁𝗲𝗿𝗻𝗮𝘁𝗶𝗼𝗻𝗮𝗹!
FSTTCS is a nearly 50-year-old flagship venue of IARCS (Indian Association for Research in Com Science).
This week, FSTTCS is underway at BITS Pilani, Goa. This edition is the largest ever, with 50 accepted papers, 8 workshops, and 350+ participants from 18+ countries.
FSTTCS is a nearly 50-year-old flagship venue of IARCS (Indian Association for Research in Com Science).
This week, FSTTCS is underway at BITS Pilani, Goa. This edition is the largest ever, with 50 accepted papers, 8 workshops, and 350+ participants from 18+ countries.
𝗜𝗱𝗲𝗮𝘀 𝗢𝘃𝗲𝗿 𝗖𝗼𝗺𝗽𝘂𝘁𝗲. 𝗦𝗶𝗺𝗽𝗹𝗶𝗰𝗶𝘁𝘆 𝗢𝘃𝗲𝗿 𝗤𝘂𝗮𝗻𝘁𝗶𝘁𝘆.
Happy Theorists during Panel Discussions on Future of Graph Algorithms at the Department of Computer Science and Automation, Indian Institute of Science (IISc), Bangalore.
#IISc #India #Algorithms #Graphs
Happy Theorists during Panel Discussions on Future of Graph Algorithms at the Department of Computer Science and Automation, Indian Institute of Science (IISc), Bangalore.
#IISc #India #Algorithms #Graphs
December 15, 2025 at 6:24 AM
𝗜𝗱𝗲𝗮𝘀 𝗢𝘃𝗲𝗿 𝗖𝗼𝗺𝗽𝘂𝘁𝗲. 𝗦𝗶𝗺𝗽𝗹𝗶𝗰𝗶𝘁𝘆 𝗢𝘃𝗲𝗿 𝗤𝘂𝗮𝗻𝘁𝗶𝘁𝘆.
Happy Theorists during Panel Discussions on Future of Graph Algorithms at the Department of Computer Science and Automation, Indian Institute of Science (IISc), Bangalore.
#IISc #India #Algorithms #Graphs
Happy Theorists during Panel Discussions on Future of Graph Algorithms at the Department of Computer Science and Automation, Indian Institute of Science (IISc), Bangalore.
#IISc #India #Algorithms #Graphs
A fun-filled week of 𝗴𝗿𝗮𝗽𝗵 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 at IISc, a truly 𝗻𝗲𝘁𝘄𝗼𝗿𝗸𝗲𝗱 and 𝗱𝘆𝗻𝗮𝗺𝗶𝗰 event 𝗱𝗶𝘀𝘁𝗿𝗶𝗯𝘂𝘁𝗲𝗱 over five days, 𝘀𝘁𝗿𝗲𝗮𝗺𝗲𝗱 𝗼𝗻𝗹𝗶𝗻𝗲 and 𝗰𝗼𝗻𝗻𝗲𝗰𝘁𝗶𝗻𝗴 over 150 in-person participants from multiple countries. By many 𝗽𝗮𝗿𝗮𝗺𝗲𝘁𝗲𝗿𝘀, the 𝗯𝗶𝗴𝗴𝗲𝘀𝘁 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 𝗲𝘃𝗲𝗻𝘁 ever in India!
#IISc #India #Algorithms #Graph
#IISc #India #Algorithms #Graph
December 13, 2025 at 8:36 AM
A fun-filled week of 𝗴𝗿𝗮𝗽𝗵 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 at IISc, a truly 𝗻𝗲𝘁𝘄𝗼𝗿𝗸𝗲𝗱 and 𝗱𝘆𝗻𝗮𝗺𝗶𝗰 event 𝗱𝗶𝘀𝘁𝗿𝗶𝗯𝘂𝘁𝗲𝗱 over five days, 𝘀𝘁𝗿𝗲𝗮𝗺𝗲𝗱 𝗼𝗻𝗹𝗶𝗻𝗲 and 𝗰𝗼𝗻𝗻𝗲𝗰𝘁𝗶𝗻𝗴 over 150 in-person participants from multiple countries. By many 𝗽𝗮𝗿𝗮𝗺𝗲𝘁𝗲𝗿𝘀, the 𝗯𝗶𝗴𝗴𝗲𝘀𝘁 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 𝗲𝘃𝗲𝗻𝘁 ever in India!
#IISc #India #Algorithms #Graph
#IISc #India #Algorithms #Graph
With some of the brightest minds I admire.
At my office during Graph Algorithms Workshop!
Debmalya Panigrahi (Duke), Anupam Gupta (NYU), Amit Kumar (IITD), @Sujoy Bhore (IITB), Madhusudhan Reddy Pittu (NYU), and Debajyoti Kar (IISc)!
With Erdős and Prasad Tetali in the background 🙂
#Algorithms
At my office during Graph Algorithms Workshop!
Debmalya Panigrahi (Duke), Anupam Gupta (NYU), Amit Kumar (IITD), @Sujoy Bhore (IITB), Madhusudhan Reddy Pittu (NYU), and Debajyoti Kar (IISc)!
With Erdős and Prasad Tetali in the background 🙂
#Algorithms
December 11, 2025 at 5:23 PM
With some of the brightest minds I admire.
At my office during Graph Algorithms Workshop!
Debmalya Panigrahi (Duke), Anupam Gupta (NYU), Amit Kumar (IITD), @Sujoy Bhore (IITB), Madhusudhan Reddy Pittu (NYU), and Debajyoti Kar (IISc)!
With Erdős and Prasad Tetali in the background 🙂
#Algorithms
At my office during Graph Algorithms Workshop!
Debmalya Panigrahi (Duke), Anupam Gupta (NYU), Amit Kumar (IITD), @Sujoy Bhore (IITB), Madhusudhan Reddy Pittu (NYU), and Debajyoti Kar (IISc)!
With Erdős and Prasad Tetali in the background 🙂
#Algorithms
🚀 Biggest-ever Algorithms event in India -- starts tomorrow!
Thrilled to share that we are organizing the Frontiers of Graph Algorithms Workshop, happening from December 8–12, 2025, at the IISc! 🎓
Streaming Link: www.youtube.com/playlist?lis...
Details:
algo.csa.iisc.ac.in/graphworkshop/
Thrilled to share that we are organizing the Frontiers of Graph Algorithms Workshop, happening from December 8–12, 2025, at the IISc! 🎓
Streaming Link: www.youtube.com/playlist?lis...
Details:
algo.csa.iisc.ac.in/graphworkshop/
December 7, 2025 at 7:43 AM
🚀 Biggest-ever Algorithms event in India -- starts tomorrow!
Thrilled to share that we are organizing the Frontiers of Graph Algorithms Workshop, happening from December 8–12, 2025, at the IISc! 🎓
Streaming Link: www.youtube.com/playlist?lis...
Details:
algo.csa.iisc.ac.in/graphworkshop/
Thrilled to share that we are organizing the Frontiers of Graph Algorithms Workshop, happening from December 8–12, 2025, at the IISc! 🎓
Streaming Link: www.youtube.com/playlist?lis...
Details:
algo.csa.iisc.ac.in/graphworkshop/
Excited to be at Dagstuhl this week for the seminar on 𝐎𝐧𝐥𝐢𝐧𝐞 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦𝐬 𝐁𝐞𝐲𝐨𝐧𝐝 𝐂𝐨𝐦𝐩𝐞𝐭𝐢𝐭𝐢𝐯𝐞 𝐀𝐧𝐚𝐥𝐲𝐬𝐢𝐬!
Key themes include learning-augmented algorithms, stochastic input models (random-order, IID, prophet), online algorithms with recourse, etc.
#Algorithms #Beyond-Competitive-Analysis
Key themes include learning-augmented algorithms, stochastic input models (random-order, IID, prophet), online algorithms with recourse, etc.
#Algorithms #Beyond-Competitive-Analysis
November 19, 2025 at 12:55 PM
Excited to be at Dagstuhl this week for the seminar on 𝐎𝐧𝐥𝐢𝐧𝐞 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦𝐬 𝐁𝐞𝐲𝐨𝐧𝐝 𝐂𝐨𝐦𝐩𝐞𝐭𝐢𝐭𝐢𝐯𝐞 𝐀𝐧𝐚𝐥𝐲𝐬𝐢𝐬!
Key themes include learning-augmented algorithms, stochastic input models (random-order, IID, prophet), online algorithms with recourse, etc.
#Algorithms #Beyond-Competitive-Analysis
Key themes include learning-augmented algorithms, stochastic input models (random-order, IID, prophet), online algorithms with recourse, etc.
#Algorithms #Beyond-Competitive-Analysis
Registration Open: Ajit Diwan Memorial Workshop on Geometry, Graph, and Combinatorics.
📅 Dates: January 19–20, 2026
📍 Venue: RKMVERI, Belur
- No registration fee.
- Free boarding and lodging for participants.
cs.rkmvu.ac.in/ADMemorialWo...
📅 Dates: January 19–20, 2026
📍 Venue: RKMVERI, Belur
- No registration fee.
- Free boarding and lodging for participants.
cs.rkmvu.ac.in/ADMemorialWo...
Ajit Diwan Memorial Workshop
cs.rkmvu.ac.in
October 16, 2025 at 1:07 PM
Registration Open: Ajit Diwan Memorial Workshop on Geometry, Graph, and Combinatorics.
📅 Dates: January 19–20, 2026
📍 Venue: RKMVERI, Belur
- No registration fee.
- Free boarding and lodging for participants.
cs.rkmvu.ac.in/ADMemorialWo...
📅 Dates: January 19–20, 2026
📍 Venue: RKMVERI, Belur
- No registration fee.
- Free boarding and lodging for participants.
cs.rkmvu.ac.in/ADMemorialWo...
⚔️ Divide and Conquer: Not just for empires, but also for matchmaking!
📢 New lecture on the Closest Pair Problem — a cornerstone of computational geometry and an elegant example of the divide-and-conquer paradigm.
(1/n)
📢 New lecture on the Closest Pair Problem — a cornerstone of computational geometry and an elegant example of the divide-and-conquer paradigm.
(1/n)
October 11, 2025 at 2:51 PM
⚔️ Divide and Conquer: Not just for empires, but also for matchmaking!
📢 New lecture on the Closest Pair Problem — a cornerstone of computational geometry and an elegant example of the divide-and-conquer paradigm.
(1/n)
📢 New lecture on the Closest Pair Problem — a cornerstone of computational geometry and an elegant example of the divide-and-conquer paradigm.
(1/n)
Reposted by Arindam Khan
Accept more papers!
sarielhp.org/misc/bloge/2...
sarielhp.org/misc/bloge/2...
Accept more papers!
sarielhp.org
October 1, 2025 at 8:42 AM
Accept more papers!
sarielhp.org/misc/bloge/2...
sarielhp.org/misc/bloge/2...
🎒 Knapsack — We understand what's truly important when we pack our bags!
📢 I’ve just rolled out a comprehensive 7-part lecture series on the Knapsack Problem — one of the cornerstone problems in algorithms.
📺 Watch the full series on my channel:
👉 Algo-rindam lnkd.in/gBxPtkCq
📢 I’ve just rolled out a comprehensive 7-part lecture series on the Knapsack Problem — one of the cornerstone problems in algorithms.
📺 Watch the full series on my channel:
👉 Algo-rindam lnkd.in/gBxPtkCq
September 26, 2025 at 8:44 AM
🎒 Knapsack — We understand what's truly important when we pack our bags!
📢 I’ve just rolled out a comprehensive 7-part lecture series on the Knapsack Problem — one of the cornerstone problems in algorithms.
📺 Watch the full series on my channel:
👉 Algo-rindam lnkd.in/gBxPtkCq
📢 I’ve just rolled out a comprehensive 7-part lecture series on the Knapsack Problem — one of the cornerstone problems in algorithms.
📺 Watch the full series on my channel:
👉 Algo-rindam lnkd.in/gBxPtkCq
When Acceptance Isn’t Enough: NeurIPS 2025 rejects 400 accepted papers due to venue crisis?
A Shock to the AI Research Community NeurIPS 2025, the 39th iteration of the world’s premier AI conference, finds itself embroiled in controversy. Despite pr...
forum.cspaper.org
September 18, 2025 at 1:32 PM
🚀 Biggest Graph Algorithms Workshop in India!
Walmart Center for Tech Excellence (WACE) at CSA, IISc is organizing the Frontiers of Graph Algorithms Workshop, happening during December 8–12, 2025 at the Indian Institute of Science (IISc), Bengaluru! 🎓
Details: algo.csa.iisc.ac.in/graphworkshop/
Walmart Center for Tech Excellence (WACE) at CSA, IISc is organizing the Frontiers of Graph Algorithms Workshop, happening during December 8–12, 2025 at the Indian Institute of Science (IISc), Bengaluru! 🎓
Details: algo.csa.iisc.ac.in/graphworkshop/
September 16, 2025 at 6:55 AM
🚀 Biggest Graph Algorithms Workshop in India!
Walmart Center for Tech Excellence (WACE) at CSA, IISc is organizing the Frontiers of Graph Algorithms Workshop, happening during December 8–12, 2025 at the Indian Institute of Science (IISc), Bengaluru! 🎓
Details: algo.csa.iisc.ac.in/graphworkshop/
Walmart Center for Tech Excellence (WACE) at CSA, IISc is organizing the Frontiers of Graph Algorithms Workshop, happening during December 8–12, 2025 at the Indian Institute of Science (IISc), Bengaluru! 🎓
Details: algo.csa.iisc.ac.in/graphworkshop/
Had a fun and productive week in Germany, participating in the Dagstuhl seminar on Precision in Geometric Algorithms.
Photo: with my "packing" team: Anders Aamand (Rice University), Eunjin Oh (POSTECH), Linda Kleist (U Hamburg), Csaba Toth (CalState), and Mikkel Vind Abrahamsen (U Copenhagen).
Photo: with my "packing" team: Anders Aamand (Rice University), Eunjin Oh (POSTECH), Linda Kleist (U Hamburg), Csaba Toth (CalState), and Mikkel Vind Abrahamsen (U Copenhagen).
September 11, 2025 at 11:35 AM
Had a fun and productive week in Germany, participating in the Dagstuhl seminar on Precision in Geometric Algorithms.
Photo: with my "packing" team: Anders Aamand (Rice University), Eunjin Oh (POSTECH), Linda Kleist (U Hamburg), Csaba Toth (CalState), and Mikkel Vind Abrahamsen (U Copenhagen).
Photo: with my "packing" team: Anders Aamand (Rice University), Eunjin Oh (POSTECH), Linda Kleist (U Hamburg), Csaba Toth (CalState), and Mikkel Vind Abrahamsen (U Copenhagen).
✨ Magic of Algorithms: Scheduling for Muggles ✨
Remember Hermione in Prisoner of Azkaban?
She wanted to attend all her classes—Care of Magical Creatures, Arithmancy, Muggle Studies … but schedules overlapped. Her secret weapon? The time-turner. ⏳
For us mere muggles, we dn’t have time-turners. 1/n
Remember Hermione in Prisoner of Azkaban?
She wanted to attend all her classes—Care of Magical Creatures, Arithmancy, Muggle Studies … but schedules overlapped. Her secret weapon? The time-turner. ⏳
For us mere muggles, we dn’t have time-turners. 1/n
September 2, 2025 at 2:26 PM
✨ Magic of Algorithms: Scheduling for Muggles ✨
Remember Hermione in Prisoner of Azkaban?
She wanted to attend all her classes—Care of Magical Creatures, Arithmancy, Muggle Studies … but schedules overlapped. Her secret weapon? The time-turner. ⏳
For us mere muggles, we dn’t have time-turners. 1/n
Remember Hermione in Prisoner of Azkaban?
She wanted to attend all her classes—Care of Magical Creatures, Arithmancy, Muggle Studies … but schedules overlapped. Her secret weapon? The time-turner. ⏳
For us mere muggles, we dn’t have time-turners. 1/n
🚀 What connects Mohan Bhargava (SRK) in Swades and Otakar Borůvka in Moravia?
👉 Minimum Spanning Tree (MST).
In Swades, SRK faced the challenge of connecting all village homes to the power plant at min cost. Borůvka solved the same for electrification of Moravia in 1926 —the first MST algorithm.
👉 Minimum Spanning Tree (MST).
In Swades, SRK faced the challenge of connecting all village homes to the power plant at min cost. Borůvka solved the same for electrification of Moravia in 1926 —the first MST algorithm.
August 27, 2025 at 11:58 AM
🚀 What connects Mohan Bhargava (SRK) in Swades and Otakar Borůvka in Moravia?
👉 Minimum Spanning Tree (MST).
In Swades, SRK faced the challenge of connecting all village homes to the power plant at min cost. Borůvka solved the same for electrification of Moravia in 1926 —the first MST algorithm.
👉 Minimum Spanning Tree (MST).
In Swades, SRK faced the challenge of connecting all village homes to the power plant at min cost. Borůvka solved the same for electrification of Moravia in 1926 —the first MST algorithm.
🚀 Dynamic Programming through "Lord of the Rings".
🪄 Gandalf’s Memoization: Top-Down strategy, uses a memo to avoid repeated work.
🧝♂️ Frodo’s Bottom-Up Journey: Start from foothills & climb up to reach Mount Doom.
English: www.youtube.com/watch?v=16t5...
Bengali: www.youtube.com/watch?v=Ap55...
🪄 Gandalf’s Memoization: Top-Down strategy, uses a memo to avoid repeated work.
🧝♂️ Frodo’s Bottom-Up Journey: Start from foothills & climb up to reach Mount Doom.
English: www.youtube.com/watch?v=16t5...
Bengali: www.youtube.com/watch?v=Ap55...
August 22, 2025 at 12:33 PM
🚀 Dynamic Programming through "Lord of the Rings".
🪄 Gandalf’s Memoization: Top-Down strategy, uses a memo to avoid repeated work.
🧝♂️ Frodo’s Bottom-Up Journey: Start from foothills & climb up to reach Mount Doom.
English: www.youtube.com/watch?v=16t5...
Bengali: www.youtube.com/watch?v=Ap55...
🪄 Gandalf’s Memoization: Top-Down strategy, uses a memo to avoid repeated work.
🧝♂️ Frodo’s Bottom-Up Journey: Start from foothills & climb up to reach Mount Doom.
English: www.youtube.com/watch?v=16t5...
Bengali: www.youtube.com/watch?v=Ap55...
🚀 How can Sanskrit poetry connect to computer science?
The challenge of generating poetry in Varnavrutta (syllable-based metres) gave rise to the discovery of binary numbers.
The exploration of Mātrāvṛtta led to the ideas of recursion & DP.
Video links below.
#Algorithms #Prosody #Sanskrit
The challenge of generating poetry in Varnavrutta (syllable-based metres) gave rise to the discovery of binary numbers.
The exploration of Mātrāvṛtta led to the ideas of recursion & DP.
Video links below.
#Algorithms #Prosody #Sanskrit
August 22, 2025 at 12:26 PM
🚀 How can Sanskrit poetry connect to computer science?
The challenge of generating poetry in Varnavrutta (syllable-based metres) gave rise to the discovery of binary numbers.
The exploration of Mātrāvṛtta led to the ideas of recursion & DP.
Video links below.
#Algorithms #Prosody #Sanskrit
The challenge of generating poetry in Varnavrutta (syllable-based metres) gave rise to the discovery of binary numbers.
The exploration of Mātrāvṛtta led to the ideas of recursion & DP.
Video links below.
#Algorithms #Prosody #Sanskrit
🚀 Stable Marriage & Nobel Prize!
Memes: Stable matchings using Bollywood -- from Kabhi Alvida Naa Kehna, Dil To Pagal Hai, Hum Saath Saath Hai, Raanjhanaa, and Style. HIMYM gets an entry, too.
🎬 English video: www.youtube.com/watch?v=lazg...
🎬 Bengali video: www.youtube.com/watch?v=DtVT...
Memes: Stable matchings using Bollywood -- from Kabhi Alvida Naa Kehna, Dil To Pagal Hai, Hum Saath Saath Hai, Raanjhanaa, and Style. HIMYM gets an entry, too.
🎬 English video: www.youtube.com/watch?v=lazg...
🎬 Bengali video: www.youtube.com/watch?v=DtVT...
August 22, 2025 at 12:24 PM
🚀 Stable Marriage & Nobel Prize!
Memes: Stable matchings using Bollywood -- from Kabhi Alvida Naa Kehna, Dil To Pagal Hai, Hum Saath Saath Hai, Raanjhanaa, and Style. HIMYM gets an entry, too.
🎬 English video: www.youtube.com/watch?v=lazg...
🎬 Bengali video: www.youtube.com/watch?v=DtVT...
Memes: Stable matchings using Bollywood -- from Kabhi Alvida Naa Kehna, Dil To Pagal Hai, Hum Saath Saath Hai, Raanjhanaa, and Style. HIMYM gets an entry, too.
🎬 English video: www.youtube.com/watch?v=lazg...
🎬 Bengali video: www.youtube.com/watch?v=DtVT...
📚 Algorithms in Bengali – A New Lecture Series 🎥
I’m launching a new lecture series on Algorithms – entirely in Bengali.
Let’s make computer science learning more inclusive and more accessible for vernacular medium students.
www.youtube.com/watch?v=4JR0...
#IISc #CSA #Bengali #English
I’m launching a new lecture series on Algorithms – entirely in Bengali.
Let’s make computer science learning more inclusive and more accessible for vernacular medium students.
www.youtube.com/watch?v=4JR0...
#IISc #CSA #Bengali #English
বাংলা ভাষায় বিজ্ঞান চর্চা: Algorithms in Bengali -- Lecture 1: Introduction
YouTube video by Algo-rindam
www.youtube.com
August 13, 2025 at 2:41 PM
📚 Algorithms in Bengali – A New Lecture Series 🎥
I’m launching a new lecture series on Algorithms – entirely in Bengali.
Let’s make computer science learning more inclusive and more accessible for vernacular medium students.
www.youtube.com/watch?v=4JR0...
#IISc #CSA #Bengali #English
I’m launching a new lecture series on Algorithms – entirely in Bengali.
Let’s make computer science learning more inclusive and more accessible for vernacular medium students.
www.youtube.com/watch?v=4JR0...
#IISc #CSA #Bengali #English