Video playlists from the recently concluded
@DIMACSCenter
workshops:
• Algebraic Techniques in FGC (July 20–22): youtube.com/playlist?list=PL…
• FGC of String Problems (July 23–25): youtube.com/playlist?list=PL…
• FGC of Graph Problems (July 27–31): youtube.com/playlist?list=PL…
Karthik C. S. retweeted
If you are interested in probabilistic combinatorics, there is going to be a workshop at Rutgers celebrating the amazing Jeff Kahn in October. The speaker list is stellar.
probcomb.github.io/
I'd thought about fine-grained complexity of Furthest Pair for some time. Especially exciting to see AI-assisted discovery & algebraic number theory showing up (again!). Congrats to @B1ar2n3a, Yinzhan Xu, and Christopher Ye — hoping for many more such uses of these tools in TCS!
Furthest Pair Requires Quadratic Time in Superconstant Dimension under SETH
Barna Saha, Yinzhan Xu, Christopher Ye
arxiv.org/abs/2606.25887 [𝚌𝚜.𝙲𝙶 𝚌𝚜.𝙲𝙲]
DIMACS is hosting not one, not two, but three workshops on fine-grained complexity next month, from July 20–31!
Registration is free but required. To register, click each relevant workshop page on the DIMACS events page: dimacs.rutgers.edu/events/li…
Hope to see many of you there!
Replying to @karthikcs_
2/3 Workshops (dates + links):
• Algebraic Techniques in FGC (July 20–22): dimacs.rutgers.edu/events/de…
• FGC of String Problems (July 23–25): dimacs.rutgers.edu/events/de…
• FGC of Graph Problems (July 27–31): dimacs.rutgers.edu/events/de…
Karthik C. S. retweeted
DIMACS is excited to announce Fine-Grained Complexity Fest, which will be held in July at #Rutgers! The #FGCFest will feature three independent workshops that focus on different aspects of fine-grained complexity. For more information visit: dimacs.rutgers.edu/events/li…. @karthikcs_
1/3 Fine-Grained Complexity Fest @DIMACSCenter this July! Three back-to-back workshops on Algebraic Techniques, String Algorithms, and Graph Algorithms in fine-grained complexity, with a terrific speaker lineup. Organized by @firebat03, @ElazarGoldenbe1, and @eig.
2/3 Workshops (dates + links):
• Algebraic Techniques in FGC (July 20–22): dimacs.rutgers.edu/events/de…
• FGC of String Problems (July 23–25): dimacs.rutgers.edu/events/de…
• FGC of Graph Problems (July 27–31): dimacs.rutgers.edu/events/de…
Karthik C. S. retweeted
The 2026 Michael and Sheila Held Prize goes to Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer and Muli Safra for their work on the 2-to-2 Games Theorem.
nasonline.org/award/michael-…
Karthik C. S. retweeted
Thank you to all the participants of the DIMACS Workshop on the Hardness of Approximation in P! The videos of all of the amazing workshop presentations are now available on our YouTube channel youtube.com/playlist?list=PL… & linked from the workshop web page dimacs.rutgers.edu/events/de…
Video playlist from the recently concluded @DIMACSCenter workshop titled, "Hardness of Approximation in P" are now available here: youtube.com/playlist?list=PL…
Karthik C. S. retweeted
Taking a break from the submission season? Swing by the Workshop on Algorithms for Large Data (Online), WALDO 2025 🗓️ April 14—16: waldo-workshop.github.io/202…
Registration is free! (but necessary by April 7)
Karthik C. S. retweeted
The DIMACS Workshop on Hardness of Approximation in P will be held at Rutgers on July 21-23, 2025, organized by @karthikcs_. Details: dimacs.rutgers.edu/events/de…. Webpage has an application (due April 15) for travel support, primarily for students.
I'm organizing a DIMACS workshop titled "Hardness of Approximation in P," which will take place from July 21-23, 2025. The workshop webpage is available dmac.rutgers.edu/events/deta….
Registration is free but required. Additionally, limited funding is available for students.
The workshop will feature multiple tutorials and is primarily designed for researchers and graduate students in complexity theory. It is part of a broader DIMACS Special Focus on Fine-Grained Complexity.
The link to the application for travel support for students is now active: docs.google.com/forms/d/e/1F….
Requests must be submitted by April 15, 2025 for full consideration.
Karthik C. S. retweeted
✍️You're as likely to survive defending Boland as you are to stop a bus with your tongue or convince a dragon to take up crocheting.
goodareas.co/scott-boland-th…
The fall is all there is.
Karthik C. S. retweeted
IMSc announces Foundational Lecture Series on Theoretical Computer Science for UG 2nd year and higher students : 2-8 Jan 2025 at IMSc (Chennai)
Registration Deadline: 18 Dec 2024
Register Now: sites.google.com/view/founda…
#IMSc #TheoreticalComputerScience #Chennai #StudentEvent











