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

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

Let him coook!

Please make one for Karp reductions

Linear Programming, or: How I Learnt to Stop Worryjng and Relax (Fractionally)

Augmenting Paths Gonna Augment

Had fun making these slides for yesterdays lecture on bipartite matching and linear programming

If you will complete your PhD requirements by 7 May 2026, there are a couple of postdoc opportunities at Melbourne sites.research.unimelb.edu.au/research-fun...

Feel free to email me for more info!

The Probably Approximately Correct Learning Model in Computational Learning Theory This survey paper gives an overview of various known results on learning classes of Boolean functions in Valiant's Probably Approximately Correct (PAC) learning model and its commonly studied variants...

How did I miss this?! A recent (2025) survey by Rocco Servedio on PAC learning and its variants, and recent results in these learning models:

arxiv.org/abs/2511.08791

(Anything by Rocco is worth reading!)

APPROX CONFERENCE Visit the post for more.

📢 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

I poured my soul into building this course last fall:

📚 Graph Algorithms via Graph Decomposition 📚

Graph decomposition has been a powerful framework in graph algorithms for over 20 years, but the literature is scattered and technical.

Thus, I tried to organize part of it into one coherent story.

Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book Narrowing the gap between theory and practice is a longstanding goal of the algorithm analysis community. To further progress our understanding of how algorithms work in practice, we propose a new alg...

Excited for today’s @optima-arc.bsky.social seminar by Eleon Bach (TU Munich) on their STOC26 paper arxiv.org/abs/2510.21613 (w/ Alexander Black, @sophie.huiberts.me and Sean Kafer). This is happening at 5-6 pm Melbourne time. See optima.org.au/events/semin... for zoom link and more info.

FRANCE: we're fancy
WORLD: ok
FRANCE: a fried ham sandwich is our national lunch
WORLD:
FRANCE: a fried ham sandwich with an egg is its wife

Think about the zoom lag!

I am teaching the Ph.D. Job Search class for Northwestern CS students, postdocs. It aims to get students prepared for searching for a variety of jobs including academic, teaching, and industry research. Details: www.mccormick.northwestern.edu/computer-sci...

Pls. share materials, references, etc?

Quantization from the ground up | ngrok blog A complete guide to what quantization is, how it works, and how it's used to compress large language models

I spent 2 months learning about quantization and am extremely proud of the post I've written about it. I think these are some of the nicest visuals I've ever made, and I love how this compression technique invented in 1898 is being used on the bleeding edge in 2026.

ngrok.com/blog/quantiz...

Best paper I’ve read in a while pmc.ncbi.nlm.nih.gov/articles/PMC...

Don’t leave us hanging! What DOES Vin Diesel know about theoretical computer science? I don’t see anything about it in the arxiv paper

When you lose money on the blokechain, you can move on to the brokechain

Postdoctoral Research Associate in Theoretical Computer Science and Algorithms Full time, fixed term for two years (with the possibility of extension) Located on the Camperdown Campus, University of Sydney Base Salary Academic Level A $109,263 - $121,054 + 17% superannuation Abo...

On the postdoc job market? "As foretold" some time ago, the Sydney Algorithms and Computing Theory group at @sydneycompsci.bsky.social is hiring postdocs (2 years, renewable) in Theoretical Computer Science and Algorithms!

usyd.wd105.myworkdayjobs.com/en-GB/USYD_E... #TCSSky

It’s almost impossible to memorize that it’s supposed to be memoize

at the World Finals for bringing teams to World Finals 5 times.

Fun fact: University of Melbourne won the 1992 World Finals 🥇, beating out Stanford (3rd) and Harvard (6th). 🧵(2/2)

Context: I have recently taken on a role overseeing competitive programming, taking over the reins from the amazing Junhao Gan (sites.google.com/site/junhogan/). Junhao has brought us to the World Finals 5 times in the last 6 years, ending a decade-long drought, and will receive a Coach Award 🧵(1/2)

We are grateful to CIS (Antonette Mendoza, Annaliese McPharlin) and FEIT (Andrew Ooi, Shainie Holt) for generously supporting the team's travels!

Congratulations as well to the University of New South Wales team for finishing 16th, and to the National University of Singapore team for taking first place.

Next stop: 2026 ICPC World Finals!

It was a highly competitive invite-only contest featuring teams from top universities across the region, and is part of the ICPC - International Collegiate Programming Contest, the Olympics of University-level competitive programming. Our team was only 1 of 2 from Australia to be invited.

UniMelb team members (left to right): David Wang, Edge Wang, and Jeffrey Song. Photo credit: Tim French https://sppcontests.org/2026-apac-results/

The Australian contingent. Left to right: UNSW coach Raveen de Silva and team, UniMelb team, Tim French, President of South Pacific Competitive Programming Association. Photo credit: Tim French https://sppcontests.org/2026-asia-pacific-championships/

UniMelb team receiving Bronze medal at the awards ceremony Photo credit: Tim French https://sppcontests.org/2026-apac-results/

🎉 The University of Melbourne team solved 7 problems and finished 25th overall to earn a Bronze Medal at the 2026 ICPC Asia Pacific Championship! Congratulations to team members David Wang, Jeffrey Song and Edge Wang!

Postdoc position for Algebraic Complexity Theory and Theoretical Computer Science at the IT University of Copenhagen The IT University of Copenhagen invites highly motivated individuals to apply for a Postdoc position starting in September 2026 or soon thereafter. The position

Postdoc position(s) in my section. Exciting opportunity to work as a postdoc in a Danish university with fantastic colleagues and enriching research atmosphere! Please spread the word.

candidate.hr-manager.net/ApplicationI...

Best Google Scholar profile ever

The kickoff workshop for IDEAL's

"Special Program on Data Science with Strategic Agents"

is Fri. Feb. 27 at UIC. If you are in Chicago and interested in this topic, I hope to see you there! (Registration info in link.)

www.ideal-institute.org/2026/01/09/w...