Sponsored
Sponsored
Media Summary: Talk by Qianfan Zhang, joint work with Shiri Ron, Clayton Thomas, S. Matthew Weinberg Title: Talk by Andrey Storozhenko, joint work with Alexander Sherstov. Title: The Talk by Siddharth Iyer, joint work with Anup Rao. Title: An XOR Lemma for Deterministic

Focs 2024 2b Communication Separations - Detailed Analysis & Overview

Talk by Qianfan Zhang, joint work with Shiri Ron, Clayton Thomas, S. Matthew Weinberg Title: Talk by Andrey Storozhenko, joint work with Alexander Sherstov. Title: The Talk by Siddharth Iyer, joint work with Anup Rao. Title: An XOR Lemma for Deterministic Talk by Elena Gribelyuk, joint work with Honghao Lin, David P. Woodruff, Huacheng Yu and, Samson Zhou. Title: A Strong ... Talk by Cuong Than, joint work with Hung Le, Shay Solomon, Csaba D. Tóth, Tianyi Zhang Title: Towards Instance-Optimal ... Talk by Yifan Wu and, Lunjia Hu. Title: Predict to Minimize Swap Regret for All Payoff-Bounded Tasks ArXiv Link: ...

Talk by Siddhartha Jain, Jiawei Li, Robert Robere and, Zhiyang Xun. Title: On Pigeonhole Principles and Ramsey in TFNP ArXiv: ... Talk by D Ellis Hershkowitz, joint work with Bernhard Haeupler, Zihan Tan Title: New Structures and Algorithms for ... Talk by Mikito Nanashima, joint work with Shuichi Hirahara, Zhenjian Lu. Title: Optimal Coding Theorems for Randomized ... Talk by Jiatu Li, joint work with Lijie Chen, Igor Carboni Oliveira Title: Reverse Mathematics of Complexity Lower Bounds paper ... Talk by Hilla Schefler, joint work with Simone Fioravanti, Steve Hanneke, Shay Moran and, Iska Tsubari. Title: Ramsey Theorems ... Talk by Chi-Fang Chen, joint work with Jordan Docter, Michelle Xu, Adam Bouland, Patrick Hayden Title: Efficient Unitary Designs ...

Talk by Evangelos Protopapas, joint work with Christophe Paul, Dimitrios M. Thilikos, Sebastian Wiederrecht Title: Obstructions to ... Talk by Dominik Kempa, joint work with Tomasz Kociumaka Title: Lempel-Ziv (LZ77) Factorization in Sublinear Time ArXiv Link: ... Talk by Dor Katzelnick, joint work with Nikhil Bansal, Roy Schwartz Title: On Approximating Cutwidth and Pathwidth paper link: ... Talk by Guang Hao Low, joint work with Yuan Su Title: Quantum eigenvalue processing paper link: ... Talk by Hanna Komlos, joint work with Michael A. Bender, Alex Conway, Martin Farach-Colton, Michal Koucky, William Kuszmaul ... Talk by Tony Metger, joint with Anand Natarajan, Tina Zhang Title: Succinct arguments for QMA from standard assumptions via ...

Photo Gallery

FOCS 2024 2B Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier
FOCS 2024 2B The Communication Complexity of Approximating Matrix Rank
FOCS 2024 2B An XOR Lemma for Deterministic Communication Complexity
FOCS 2024 10B A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
FOCS 2024 7B Towards Instance-Optimal Euclidean Spanners
FOCS 2024 1C Predict to Minimize Swap Regret for All Payoff-Bounded Tasks
FOCS 2024 2B On Pigeonhole Principles and Ramsey in TFNP
FOCS 2024 7B New Structures and Algorithms for Length-Constrained Expander Decompositions
FOCS 2024 2A Optimal Coding Theorems for Randomized Kolmogorov Complexity
FOCS 2024 3A Reverse Mathematics of Complexity Lower Bounds
FOCS 2024 8B Ramsey Theorems for Trees and a General ‘Private Learning Implies Online Learning’ Thm
FOCS 2024 2C Efficient Unitary Designs from Random Sums and Permutations
View Detailed Profile
FOCS 2024 2B Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier

FOCS 2024 2B Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier

Talk by Qianfan Zhang, joint work with Shiri Ron, Clayton Thomas, S. Matthew Weinberg Title:

FOCS 2024 2B The Communication Complexity of Approximating Matrix Rank

FOCS 2024 2B The Communication Complexity of Approximating Matrix Rank

Talk by Andrey Storozhenko, joint work with Alexander Sherstov. Title: The

Sponsored
FOCS 2024 2B An XOR Lemma for Deterministic Communication Complexity

FOCS 2024 2B An XOR Lemma for Deterministic Communication Complexity

Talk by Siddharth Iyer, joint work with Anup Rao. Title: An XOR Lemma for Deterministic

FOCS 2024 10B A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches

FOCS 2024 10B A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches

Talk by Elena Gribelyuk, joint work with Honghao Lin, David P. Woodruff, Huacheng Yu and, Samson Zhou. Title: A Strong ...

FOCS 2024 7B Towards Instance-Optimal Euclidean Spanners

FOCS 2024 7B Towards Instance-Optimal Euclidean Spanners

Talk by Cuong Than, joint work with Hung Le, Shay Solomon, Csaba D. Tóth, Tianyi Zhang Title: Towards Instance-Optimal ...

Sponsored
FOCS 2024 1C Predict to Minimize Swap Regret for All Payoff-Bounded Tasks

FOCS 2024 1C Predict to Minimize Swap Regret for All Payoff-Bounded Tasks

Talk by Yifan Wu and, Lunjia Hu. Title: Predict to Minimize Swap Regret for All Payoff-Bounded Tasks ArXiv Link: ...

FOCS 2024 2B On Pigeonhole Principles and Ramsey in TFNP

FOCS 2024 2B On Pigeonhole Principles and Ramsey in TFNP

Talk by Siddhartha Jain, Jiawei Li, Robert Robere and, Zhiyang Xun. Title: On Pigeonhole Principles and Ramsey in TFNP ArXiv: ...

FOCS 2024 7B New Structures and Algorithms for Length-Constrained Expander Decompositions

FOCS 2024 7B New Structures and Algorithms for Length-Constrained Expander Decompositions

Talk by D Ellis Hershkowitz, joint work with Bernhard Haeupler, Zihan Tan Title: New Structures and Algorithms for ...

FOCS 2024 2A Optimal Coding Theorems for Randomized Kolmogorov Complexity

FOCS 2024 2A Optimal Coding Theorems for Randomized Kolmogorov Complexity

Talk by Mikito Nanashima, joint work with Shuichi Hirahara, Zhenjian Lu. Title: Optimal Coding Theorems for Randomized ...

FOCS 2024 3A Reverse Mathematics of Complexity Lower Bounds

FOCS 2024 3A Reverse Mathematics of Complexity Lower Bounds

Talk by Jiatu Li, joint work with Lijie Chen, Igor Carboni Oliveira Title: Reverse Mathematics of Complexity Lower Bounds paper ...

FOCS 2024 8B Ramsey Theorems for Trees and a General ‘Private Learning Implies Online Learning’ Thm

FOCS 2024 8B Ramsey Theorems for Trees and a General ‘Private Learning Implies Online Learning’ Thm

Talk by Hilla Schefler, joint work with Simone Fioravanti, Steve Hanneke, Shay Moran and, Iska Tsubari. Title: Ramsey Theorems ...

FOCS 2024 2C Efficient Unitary Designs from Random Sums and Permutations

FOCS 2024 2C Efficient Unitary Designs from Random Sums and Permutations

Talk by Chi-Fang Chen, joint work with Jordan Docter, Michelle Xu, Adam Bouland, Patrick Hayden Title: Efficient Unitary Designs ...

FOCS 2024 1A Obstructions to Erdős-Pósa Dualities for Minors

FOCS 2024 1A Obstructions to Erdős-Pósa Dualities for Minors

Talk by Evangelos Protopapas, joint work with Christophe Paul, Dimitrios M. Thilikos, Sebastian Wiederrecht Title: Obstructions to ...

FOCS 2024 8C  Lempel-Ziv (LZ77) Factorization in Sublinear Time

FOCS 2024 8C Lempel-Ziv (LZ77) Factorization in Sublinear Time

Talk by Dominik Kempa, joint work with Tomasz Kociumaka Title: Lempel-Ziv (LZ77) Factorization in Sublinear Time ArXiv Link: ...

FOCS 2024 3C On Approximating Cutwidth and Pathwidth

FOCS 2024 3C On Approximating Cutwidth and Pathwidth

Talk by Dor Katzelnick, joint work with Nikhil Bansal, Roy Schwartz Title: On Approximating Cutwidth and Pathwidth paper link: ...

FOCS 2024 4C Quantum eigenvalue processing

FOCS 2024 4C Quantum eigenvalue processing

Talk by Guang Hao Low, joint work with Yuan Su Title: Quantum eigenvalue processing paper link: ...

FOCS 2024 Plenary 2 - Expanders and PCPs: Emergence from Local to Global

FOCS 2024 Plenary 2 - Expanders and PCPs: Emergence from Local to Global

Plenary 2 on Oct 28

FOCS 2024 Nearly Optimal List Labeling

FOCS 2024 Nearly Optimal List Labeling

Talk by Hanna Komlos, joint work with Michael A. Bender, Alex Conway, Martin Farach-Colton, Michal Koucky, William Kuszmaul ...

FOCS 2024 6A Succinct arguments for QMA from standard assumptions via compiled nonlocal games

FOCS 2024 6A Succinct arguments for QMA from standard assumptions via compiled nonlocal games

Talk by Tony Metger, joint with Anand Natarajan, Tina Zhang Title: Succinct arguments for QMA from standard assumptions via ...

FOCS 2024 Plenary 1 - Dual Reduction and Elementary Games with Senders and Receivers (Roger Myerson)

FOCS 2024 Plenary 1 - Dual Reduction and Elementary Games with Senders and Receivers (Roger Myerson)

Plenary 1 on Oct 28

Related Video Content

FOCS 2025 information

The 66th Annual Symposium on Foundations of Computer Science (FOCS 2025), sponsored by the IEEE Computer Society...

IEEE Symposium on Foundations of Computer Science (FOCS) information

The IEEE Symposium on Foundations of Computer Science (FOCS) is the flagship conference sponsored by the IEEE...

Loading... information

Baltimore Focus is an online platform for parents to engage and participate in their child's education, offering...

Symposium on Foundations of Computer Science - Wikipedia information

The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of...

FOCS25 information

Welcome to the 66th IEEE Symposium on Foundations of Computer Science (FOCS) 2025 (FOCS25) submissions site. For...

Sponsored