I am delighted to share that our paper has been accepted to 𝗙𝗢𝗖𝗦 𝟮𝟬𝟮𝟲! My wonderful coauthors: Kailash Gopal (Then a BTech student at IIT Madras and just joined predoc at Google DeepMind), Samyak Jha, RA at IISc (soon joining UW-Madison for PhD), and KVN Sreeniva (PhD student at IISc). #FOCS

𝗣𝗿𝗮𝗰𝘁𝗶𝗰𝗮𝗹 𝘄𝗮𝘆𝘀 𝘀𝘁𝘂𝗱𝗲𝗻𝘁𝘀 𝗰𝗮𝗻 𝘂𝘀𝗲 LLM as 𝘳𝘦𝘴𝘦𝘢𝘳𝘤𝘩 𝘤𝘰𝘭𝘭𝘢𝘣𝘰𝘳𝘢𝘵𝘰𝘳s -- www.linkedin.com/posts/arinda... #LLM #Research

#research | Arindam Khan

𝗣𝗿𝗮𝗰𝘁𝗶𝗰𝗮𝗹 𝘄𝗮𝘆𝘀 𝘀𝘁𝘂𝗱𝗲𝗻𝘁𝘀 𝗰𝗮𝗻 𝘂𝘀𝗲 LLM as 𝘳𝘦𝘴𝘦𝘢𝘳𝘤𝘩 𝘤𝘰𝘭𝘭𝘢𝘣𝘰𝘳𝘢𝘵𝘰𝘳s -- 𝟏. 𝐃𝐨𝐧’𝐭 𝐚𝐬𝐤 𝐨𝐧𝐞 𝐡𝐮𝐠𝐞 𝐪𝐮𝐞𝐬𝐭𝐢𝐨𝐧. ❌ Bad prompt: “Can you solve this open problem?” ✅ Better workflow: First brainstorm 20 ideas. Then r...

linkedin.com

𝗕𝗶𝗽𝗮𝗿𝘁𝗶𝘁𝗲 𝗺𝗮𝘁𝗰𝗵𝗶𝗻𝗴 𝗶𝘀 𝗶𝗻 𝗡𝗖 -- 𝗲𝘅𝗰𝗶𝘁𝗶𝗻𝗴 𝗕𝗮𝗻𝗴𝗮𝗹𝗼𝗿𝗲 𝗧𝗵𝗲𝗼𝗿𝘆 𝗦𝗲𝗺𝗶𝗻𝗮𝗿 𝘁𝗮𝗹𝗸 𝗯𝘆 𝗥𝗼𝗵𝗶𝘁 𝗚𝘂𝗿𝗷𝗮𝗿 𝘁𝗵𝗶𝘀 𝗧𝘂𝗲𝘀𝗱𝗮𝘆 (𝟰𝗽𝗺 𝗜𝗻𝗱𝗶𝗮 𝘁𝗶𝗺𝗲)! Tuesday, 23 June 2026 16:00-17:00 India time. Teams Link: teams.microsoft.com/l/meetup-joi...

Join conversation

teams.microsoft.com

Prof. Subir Kumar Ghosh (1953–2026) passed away last week. A former Prof at TIFR, Bombay, he launched the conference CALDAM and organized over 20 research workshops on algorithms across Indian universities. He is also known for his book on visibility algorithms. Rest in peace, Sir.

𝗘𝘅𝗰𝗶𝘁𝗶𝗻𝗴 𝘁𝗶𝗺𝗲𝘀. 𝗛𝘂𝗺𝗮𝗻𝘀 + 𝗔𝗜. Erdős Unit Distance Problem: among n points in the plane, how many pairs can be distance 1 apart? After 80 years, OpenAI researchers gave a new lower-bound construction. Within hours, Will Sawin improved it to (n^{1.014}): arxiv.org/pdf/2605.20579 #Math #Geometry

The whole 5-part series on "how AI is impacting Research" in a single blog. #AI #Research #Math #TheoryCS www.linkedin.com/pulse/theory...

Theory CS Research in the age of GenAI

𝗣𝗮𝗿𝘁 𝟭: 𝗧𝗵𝗲 𝗔𝗜 𝗥𝗲𝘃𝗼𝗹𝘂𝘁𝗶𝗼𝗻 𝗶𝗻 𝗠𝗮𝘁𝗵 𝗛𝗮𝘀 𝗔𝗿𝗿𝗶𝘃𝗲𝗱 A recent article in Quanta Magazine (Link) mentions a current trend: AI is no longer a computational assistant in mathematics. It is becoming an active pa...

linkedin.com

Today Jose Correa from the University of Chile will deliver an (online) survey talk at Bangalore Theory Seminar on "Prophet inequalities". Last week, Christian Coester (Oxford) gave a tutorial on mirror descent (and applications in online algorithms) Link: www.csa.iisc.ac.in/theorysemina...

Bangalore Theory Seminars

A Research Seminar Series in Theoretical Computer Science brough to you by various research institutions in Bangalore

csa.iisc.ac.in

📢 Call for Papers: APPROX 2026 Serving on the PC of APPROX 2026, one of my favorite conferences. Will be held at Boston University (Aug 19–21, 2026), co-located with RANDOM and WOLA. 👉 Submissions are due May 6, 2026 More info: approxconference.wordpress.com

APPROX CONFERENCE

Visit the post for more.

approxconference.wordpress.com

𝐓𝐡𝐞 𝐦𝐚𝐧 𝐰𝐡𝐨 𝐢𝐧𝐯𝐞𝐧𝐭𝐞𝐝 𝐐𝐮𝐢𝐜𝐤𝐬𝐨𝐫𝐭 𝐩𝐚𝐬𝐬𝐞𝐝 𝐚𝐰𝐚𝐲 𝐥𝐚𝐬𝐭 𝐰𝐞𝐞𝐤. Turing Award winner Sir Tony Hoare passed away last Thursday at the age of 92. At age 26, he invented Quicksort -- Taught in UG algorithms and still one of the most elegant and widely used algorithms. #CS #Algorithms #Quicksort

Most of us can trace our journeys back to a few people who shaped how we think & what we work on. For me, two of them are Prof. Prasad Tetali (Carnegie Mellon University) & Prof. Mark de Berg (TU Eindhoven) -- both visiting us this week. This week also marks the start of Mark's sabbatical at IISc!

Sandor Fekete visited IISc and gave an awesome talk on "Hard in Theory, Easy in Practice?"

𝗖𝗮𝗹𝗹 𝗳𝗼𝗿 𝗣𝗼𝘀𝘁𝗱𝗼𝗰𝘁𝗼𝗿𝗮𝗹 𝗙𝗲𝗹𝗹𝗼𝘄𝘀 𝗶𝗻 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 & 𝗧𝗵𝗲𝗼𝗿𝘆 𝗜𝗻𝗱𝗶𝗮𝗻 𝗜𝗻𝘀𝘁𝗶𝘁𝘂𝘁𝗲 𝗼𝗳 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 (𝗜𝗜𝗦𝗰), 𝗕𝗲𝗻𝗴𝗮𝗹𝘂𝗿𝘂 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

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.

linkedin.com

🚨 𝗣𝗮𝗽𝗲𝗿 𝗶𝗻 𝗦𝗧𝗢𝗖 𝟮𝟬𝟮𝟲 | 𝗔 𝗵𝗶𝘀𝘁𝗼𝗿𝗶𝗰 𝗳𝗶𝗿𝘀𝘁! (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.

𝐈𝐂𝐋𝐑 𝟐𝟎𝟐𝟔 𝐚𝐜𝐜𝐞𝐩𝐭𝐚𝐧𝐜𝐞: 𝐀𝐝𝐬 𝐭𝐡𝐚𝐭 𝐒𝐭𝐢𝐜𝐤 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

𝗙𝗦𝗧𝗧𝗖𝗦 𝗴𝗼𝗲𝘀 𝗶𝗻𝘁𝗲𝗿𝗻𝗮𝘁𝗶𝗼𝗻𝗮𝗹! 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

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

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

🚀 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/

Had a wonderful time visiting Université libre de Bruxelles (ULB), Brussels. Photo with ALGO group (John Iacono, Stefan Langerman, and Jean Cardinal). #Algo #Geometry

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

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...

⚔️ 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)

Accept more papers! 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

NeurIPS (and large AI conferences) are becoming a joke 😅 forum.cspaper.org/topic/140/wh...

🚀 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/

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).