December 14-17, 2025

Sydney, Australia


Activities

Apart from the main program, plenary talks, and workshops, FOCS 2025 will feature a reception and a banquet, as well as several community activities and events.

Professional

  1. πŸŽ“ Graduating Bits (afternoon, Sunday – Day 1): Following the (now) long-standing tradition initiated at ITCS, graduating PhD students and postdoctoral researchers will give short 2-minute presentations introducing themselves, their research interests and plans. Many of these junior researchers will be looking for positions in the upcoming year. Please see πŸ”— this page to register as a presenter, and for their slides and information after the event.
  2. πŸ“ Job Openings Spreadsheet (asynchronous): The πŸ”— Job Openings page has a spreadsheet with information about job openings in Theoretical CS, to help graduating students and junior researchers. If your group plans to hire a postdoc, or a researcher (e.g., in industry), you can use the following form to provide information about the position: πŸ“‹ https://forms.gle/JSCaHfV5pVGCLXhM7.
  3. πŸ“ Job Applicants Form: To complement the above two initiatives, If you are on the job market, you can provide your information at this form: πŸ“‹ https://forms.gle/ipAQg4cmBsmj3gwu6 . This will not be made public, and only shared with the FOCS 2025 sponsors and relevant parties/attendees for them to contact you during FOCS.
  4. Susquehanna networking event: our sponsor, Susquehanna, is organizing a dinner and networking event at their office, in Barangaroo (walking distance from the conference venue). Join them on Monday 15, from 5:30 to 8pm: see πŸ”— this page for more information and registration.

Β 

Social (“fun”)

  1. πŸ—ΊοΈ Scavenger hunt (offline): Welcome to the FOCS 2025 Scavenger Hunt in Sydney. Walk in the city, experience our multicultural world, the ancient and modern history, local wildlife, and the city’s beauty.We encourage you to make a friend or two or three and form a team! The scavenger hunt will beΒ released on Saturday 13 at noon. πŸ† Prizes for the winning teams will be awarded during the banquet, on Tuesday evening.
  2. πŸ—―οΈ Cartoon Caption Contest: following the lead from STOC 2022, there will be a caption contest, whereby you are given TCS-themed cartoons, and you come up with fun captions, and someone (maybe you!) gets a prize for it during the business meeting. Details and cartoons coming soon!
  3. πŸƒβ€βž‘οΈ Running experiments: gather at 7am for a morning run around Sydney! Everyone welcome, and we’ll adapt the pace and length based on who joins. Happening on Monday, Tuesday, and Wednesday.
  4. πŸ‘£ Random walks: also at 7am, but for a walk instead of a run. Happening on Monday, Tuesday, and Wednesday.
  5. ⛴️ Quay Exchange Protocol: On Monday evening (after the business meeting), take the ferry from Barangaroo to Circular Quay, to see the Harbour bridge and Opera House at night and enjoy the city lights.
  6. 🍱 Senior/Junior lunches: Following the now-established tradition, FOCS will include Senior/Junior lunches on Monday, Tuesday, and Wednesday. πŸ“‹ Sign up on this form!
  7. πŸ“° Succinct Sketches: live blogging from the conference, by attendees. Volunteer to write a post about a talk you liked, a conference activity you attended, or an aspect of FOCS: reports from contributors will then be published on the blog.

For more information and discussion about these activities, join the FOCS 2025 Zulip server πŸ’¬, and the channel #social on it!

Satellite events

There also will be two free satellite events, unaffiliated but collocated with FOCS (both held at the nearby University of Sydney): conference attendees are encouraged to attend either, or both:

      • A Celebration of TCS, December 11–13 (some travel support available)

        A three-day mentoring and research event, celebrating the richness and collegiality of the Theoretical Computer Science community.

      • Trends in Approximation and Online Algorithms (previously Flexible Network Design), December 18–19

        A two-day workshop on recent advances in approximation and online algorithms on network design and related areas