EnCORE Institute

The first edition of EnCORE magazine is out. Learn about our many initiatives, exciting research by faculty and students, and dive into our student/alum/staff corners to hear their inspiring stories. encore.ucsd.edu/encore-magazin…

We have a busy February with a great line-up of speakers at EnCORE @EnCOREInstitut Workshop on Interpretability in Modern AI - Foundations, Methods, and Emerging Directions. Date: Feb 25-27, 2026. trustworthy-ai-workshop.github.io/encore-2026/

Happening tomorrow. The zoom link to join is in the flyer. @HDSIUCSD @UCSDJacobs @UCSD

The EnCORE Institute Workshop on Adversarial Robust Streaming.

The EnCORE workshop on Adversarial Robustness is going in full swing.

The EnCORE Workshop on New Horizons in Adaptive Robustness is happening next week — September 15–17! Register to listen to talks! 🔗 sites.google.com/view/robust-en…

Next week at @EnCOREInstitut

With the happy bunch during the @EnCOREInstitut Collaboration Workshop. It was a great opportunity for the students and postdocs to hone their presentation skills.

The EnCORE Institute Collaboration workshop happening tomorrow showcasing a sample of exciting collaborative work across UCSD, UCLA, UT Austin, and UPenn. Zoom link:  ucsd.zoom.us/j/96424145039

Celebrations of TCS at FOCS is jointly being organized with TCS for All. If you have a stellar graduate student or postdoc in the job market this year with research related to TCS, you can still nominate them for the Rising Star ⭐️ workshop. sites.google.com/view/celebrati…

The EnCORE institute at UCSD is offering an Algorithms summer camp for students who need to brush up their algorithms foundation. This will be particularly useful for transfer students transitioning to a 4-year college. The course is free but requires registration. More info in the flyer.

This year TCS for All Inspiration talk will be given by Sofya Raskhodnikova, Boston University on June 27th at our STOC 2025 TCS for All Meeting. Join us. SIGACT.org/tcsforall/ @pinkfloydie #stoc2025

It never ceases to amaze me how a simple "counting configuration" (also known as "information theoretic") lower bound is achievable by an algorithm. The former sometime is so trivial for combinatorial problems, that I would assume them to be not tight at all. Here is an example of reconstructing a graph just by looking at the number of connected components in a subgraph. Since the number of n vertex m edge graphs are ~ n^{2m}, there is a trivial lower bound. Turns out there is an algorithm that can reconstruct the graph with exactly same number of this weird projection.

To appear in COLT 2025; this work is done by amazing @EnCOREInstitut postdocs Hadley Black and Yinzhan Xu, and @B1ar2n3a. The paper can be found here: arxiv.org/abs/2506.08405

Fine-grained Complexity Workshop videos are online youtube.com/playlist?list=… via @YouTube

Finds Advanced Program for high schoolers start this Monday. We are looking forward to welcome our new cohort. mathfinds.ucsd.edu

We are excited to host the fine-grained complexity workshop at the EnCORE institute with an excellent lineup of talks. It is still possible to attend the workshop virtually. encore.ucsd.edu/fine-grained-c…

High-schoolers are invading @EnCOREInstitut tomorrow. Looking forward to the cool-sounding talks by Shachar, Qipeng and Floor.

Congratulations to EnCORE faculty Raghu Meka for winning the McDowell Award!

In a humble and modest interview, my PhD student, Chris Ye, and my postdoc, Yinzhan Xu talk about their passion for research and academic journey. Their modesty is striking and something to learn from. Watch it! youtu.be/AVpximXPxEw?fe…

The preprint can be found here arxiv.org/abs/2503.00174 This continues a collaboration on transfer learning at @EnCOREInstitut; in the first installment we saw transfer learning in latent variable models of random graphs