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

Kuldeep Meel visited us today and gave a nice talk on a theory of computing based on SAT solvers.

#IISc #CSA #CS #TheoryCS

CodEx Seminar CodEx Seminar

Harm Derksen will be talking about "Invariant Theory and [Computational] Complexity" in tomorrow's online CodEx Seminar: www.math.colostate.edu/~king/codex/

Tue Jan 28, 2025 10am Pacific
Sign up on the website for the zoom link

#MathSky #CSTheory #TheoryCS #TCS #ComputationalComplexity

Resources for Learning Computational Complexity Theory Computational complexity theory studies the feasibility of solving and resources required to solve computational problems and is useful to any field that thinks about the analysis and design of algori...

Here's a guide I put together a few years ago for learning computational complexity theory. Are there any new books or lecture videos I should add?

#compsci #theorycs #AcademicSky

TCS+ talk: Wednesday, December 4 — Martín Costa, University of Warwick The next TCS+ talk (and the last of 2024!) will take place this coming Wednesday, December 4th at 10:30 AM Eastern Time (7:30 AM Pacific Time, 16:30 Central European Time, 15:30 UTC — note the unus…

This week on TCS+, Martín Costa from the University of Warwick will tell us about "Vizing’s Theorem in Near-Linear Time" (last TCS+ talk of 2024!)

Details and (free) registration: tcsplus.wordpress.com/2024/11/28/t... #TCSSky #TheoryCS

Workshop in memory of Luca Trevisan on Dec 2 at Bocconi
See here for program: andrejb.net/lucaworkshop...
#TCS #TheoryCS #CS #CompSci

Online Matching with High Probability We study the classical, randomized Ranking algorithm which is known to be $(1 - \frac{1}{e})$-competitive in expectation for the Online Bipartite Matching Problem. We give a tail inequality bound, nam...

Online Matching with High Probability. SAGT 2024: 21-34
Earlier version here arxiv.org/abs/2112.07228
#TCS #TheoryCS #CS #CompSci

TCS+ talk: Wednesday, November 20 — Divyarthi Mohan, Boston University The next TCS+ talk will take place this coming Wednesday, November 20th at 1:00 PM Eastern Time (10:00 AM Pacific Time, 19:00 Central European Time, 18:00 UTC). Divyarthi Mohan from Boston Universi…

Next week on TCS+, Divyarthi Mohan (@divyarthi.bsky.social) from Boston University will speak about "Optimal Stopping with Interdependent Values"

Details and (free) registration: tcsplus.wordpress.com/2024/11/13/t... #TCSSky #TheoryCS #EconSky

I made a starter pack for Theoretical Computer Science (broadly construed)!

#TheoryCS #TCSSky #MathSky #AcademicSky 🧪

go.bsky.app/2jS2SGw

Three World-Leading Mathematicians Join IAS Faculty The Institute for Advanced Study has named three new permanent Faculty to the School of Mathematics in the fields of pure mathematics and computer science. Irit Dveer Dinur (theoretical computer scien...

Irit Dinur will start as new permanent faculty at IAS this summer, making it even more of a powerhouse in TCS.
(Also joined by Elon Lindenstrauss in dynamical systems, and Aaron Naber in geometric analysis.)

www.ias.edu/news/three-w...

#TCS #TheoryCS #CS #CompSci 🧮🧪

(h/t @boazbaraktcs@x.com)

Fall Jobs Post 2023 In the 2022 Fall Jobs Post  I talked about the effect of generative AI and that was two weeks before Open AI released ChatGPT to the public....

Fall #TheoryCS jobs post, by @fortnow.bsky.social (who's not active here yet, it seems):

blog.computationalcomplexity.org/2023/10/fall...

Places to look for jobs, and places for job-seekers to post their CVs, plus thoughts about how AI is affecting the market (spoiler: not that much *yet*).

#🧮