AITHYRA is recruiting an AI/ML STARTING PI

Generative Models, Large Language Models, Agentic AI, Active & Reinforcement Learning, AI-driven Scientific Discovery & Lab Automation, ML-driven molecular simulations...

Job Ad: aithyra.at/fileadmin/do...

Apply by 30.4.2026
#StartingPI #AI/ML #AITHYRA

I got interviewed for my podcast in Bulletin of the EATCS! I am really delighted by this so, sharing it with you.
eatcs.org/images/bulle...
Thank you @eatcs.bsky.social and @neumannstefan.com.
Here is a link to one of the episodes of my podcast. open.spotify.com/episode/3RNO...

Welcome to BlueSky, @eatcs.bsky.social!

I suggest everyone to follow the new account to stay up to the date with news from the European Association for Theoretical Computer Science.

It was my pleasure speaking with @nutanlimaye.bsky.social about her podcast "Life of a Researcher". Check out the interview in the post below and listen to her great podcast.

podcastaddict.com/podcast/life-of-a-researcher/4111736

4 Mar, Wed 1pm TCS+ Talk: Sophie Huiberts (CNRS) 18 Mar, Wed 1pm TCS+ Talk: Christopher Gartland (UNC Charlotte) 8 Apr, Wed 1pm TCS+ Talk: Rahul Ilango (MIT) 22 Apr, Wed 1pm TCS+ Talk: Yichuan Wang (UC Berkeley)

The schedule for the upcoming talks (stay tuned for the May speakers!) can be found on our website: exciting times ahead!
sites.google.com/view/tcsplus/

Listening to My Students at Scale: Exit Tickets, NotebookLM, and the Tightest Feedback Loop I've Ever Built It started at a teaching workshop, last semester: Craig Kapp and Rob Egan presented a seminar at the NYU Center for Teaching and Learning ...

Panos Ipeirotis (NYU): "How I started using exit tickets (short feedback surveys after every class) and processing them through NotebookLM to generate follow-up materials before the next session. The feedback loop went from one semester to a few hours." www.behind-the-enemy-lines.com/2026/02/list...

You can now use ipe in the browser!
ipe-web.otfried.org/index.html

Professor Nutan Limaye receives DKK 12.8 million for research on algebraic complexity The project explores fundamental limits of efficient computation, linking algebraic methods with randomness and parallelism to advance complexity theory.

My awesome BARC colleague @nutanlimaye.bsky.social is starting a major research project in algebraic complexity. Anyone interested in joining as a PhD student should check out the call (deadline March 1).
barc.ku.dk/news/profess...

Same. Wow.

There is a third-party app for this, you can find it here: bsky-follow-finder.theo.io

My impression with bluesky is that a lot of things exist but there is just no way of finding them.

@nkgarg.bsky.social

TU Wien is now on the 5th place among all computer science departments at German-speaking universities in the Times Higher Education ranking. Excellent news!

@informatics.tuwien.ac.at @tuwien.at

🚀 I’m very excited to share that I’ve joined TU Wien as Assistant Professor, and that I've received a €1.8M Vienna Research Group (WWTF) grant for Multi-Player Artificial Intelligence. I’m hiring interns, PhD students & postdocs in Game Theory × ML.
🔗 Apply: forms.gle/k6xkkF4jse58...

Jenseits fester Pole: Was Netzwerke über Polarisierung verraten Forschende der TU Wien entwickeln ein Modell, das Meinungen nicht als diametral entgegensetzte Pole interpretiert, sondern als überlappende Bereiche auf Gruppenebene.

Meinungen und Einstellungen sind selten schwarz-weiß. Ein Forschungsteam der TU Wien zeigt, dass sich Positionen in gesellschaftlichen Debatten oft überschneiden und nicht klaren Lagern zuordnen lassen. Das neue Modell analysiert dafür Interaktionen zwischen Gruppen. 💬📊
#TechnikfürMenschen

Save the date: @katta.bsky.social and me are organizing the Austrian Computer Science Day #ACSD on June 1, 2026 at TU Wien with the motto CS in Modern Society: a Sign of the Times!

More info and program coming soon here:
informatics.tuwien.ac.at/acsd

(CC) @tuwien.at & @informatics.tuwien.ac.at

Petition Restore Fully Free and Open Access to the ACM Digital Library Restore Fully Free and Open Access to the ACM Digital Library

Consider signing this petition regarding restoring free access to the ACM digital library: www.ipetitions.com/petition/res...

2: Summer employee positions at the Department of Computer Science: www.aalto.fi/en/departmen...

Aalto University is hiring summer interns!

1: Aalto Science Institute International Summer Research Program: www.aalto.fi/en/aalto-sci...

The deadline for BARC's annual call for PhD positions is soon (January 10)!

Reminder: we are hiring an Assistant Professor in computer science! All areas of computer science will be considered. We are in particular interested in candidates whose research is on datacenter-scale computing systems. Deadline: Monday, February 2nd, 2026. www.aalto.fi/en/open-posi...

I enjoyed reading this. I agree that throughout the last 10 years or so, CS has become a lot more empirical.

This also means that there is a lot of work for theoretical computer scientists out there.

We are hiring an Assistant Professor in computer science! This is a broad call, all areas of computer science will be considered! We are in particular interested in datacenter-scale computing systems.
www.aalto.fi/en/open-posi...

Frontiers of Graph Algorithms | Day 1 | 8th Dec 2025 YouTube video by CSAChannel IISc

I just gave a tutorial on Design Templates for Dynamic Graph Algorithms at IISc in Bangalore.

The kindest words I received were "best tutorial I have listened to in the last 10 years." Hope it interests you.

Video: www.youtube.com/live/L8ev24g...
Slides: tinyurl.com/yetx3vxu

Optimal Smoothed Analysis of the Simplex Method YouTube video by FOCS 2025

smoothed analysis is dead. i gave a eulogy

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs Given a graph and a pair of terminals $s$, $t$, the next-to-shortest path problem asks for an $s\!\to \!t$ (simple) path that is shortest among all not shortest $s\!\to \!t$ paths (if one exists). Thi...

The directed next-to-shortest path problem was solved by 2 undergrads! arxiv.org/abs/2511.04345 Look out for Kuowen Chen and Yiran Zhang this PhD application cycle.

Want to join the ambitious, creative, collaborative, and fun environment at BARC? Our annual call for PhD or integrated MSc + PhD fellowship in Algorithms has been posted! Apply by January 10. employment.ku.dk/phd/?show=15...

Full Professor of Parallel Computing We invite applications for this full-time professorship until January 22, 2026.

TU Wien Informatics is hiring for a Full Professor of Parallel Computing.

Come and join our faculty! We are among the Top 13 CS departments in Europe according to CSRankings and it's a lot of fun to work here.

Find more information here: informatics.tuwien.ac.at/news/3050

Save-the-Date: AI Festival at TU Wien Join us from December 1-3 at TU Wien for a three-day festival revolving around Artificial Intelligence!

Save-the-Date: AI Festival an der TU Wien
Die TU Wien Informatics lädt zum AI Festival, einem dreitägigen Event zum Thema KI

1.-3. Dezember 2025
TU Wien, Campus Gußhaus
Kontaktraum

Mehr Info und Anmeldung ⬇️

Turing Centennial – in theory Posts about Turing Centennial written by luca

Luca Trevisan series of posts from gay
and lesbian computer scientists:
lucatrevisan.wordpress.com/tag/turing-c...

Luca Trevisan's own story:
lucatrevisan.wordpress.com/2012/07/02/t...

Gil Kalai’s blog “Combinatorics and More": gilkalai.wordpress.com

Research-Life Stories – Windows On Theory Posts about Research-Life Stories written by Boaz Barak, Omer Reingold, and Raghu Meka

Omer Reingold series on research-life stories: windowsontheory.org/tag/research...

Bobby Kleinberg's story: windowsontheory.org/2013/03/21/r...

We uploaded a new version with links to Omer Reingold's "Research Life Stories", to Luca Trevisan's series of posts about gay and lesbian computer scientists, and so on.

Check out the updated version: eatcs.org/images/bulle...

The links are also in the comment below.

Happy reading!