Sponsored
Sponsored
Media Summary: Talk by Carmen Strassle, joint work with Caleb Koch and Li-Yang Tan Title: Talk by Lin Chen, joint work with Jiayi Lian, Yuchen Mao, Guochuan Zhang. Title: An Improved Pseudopolynomial Time Algorithm ... Talk by Jiatu Li, joint work with Edward Pyne and, Roei Tell. Title: Distinguishing, Predicting, and Certifying: On the Long Reach of ...

Focs 2024 8a Fast Decision - Detailed Analysis & Overview

Talk by Carmen Strassle, joint work with Caleb Koch and Li-Yang Tan Title: Talk by Lin Chen, joint work with Jiayi Lian, Yuchen Mao, Guochuan Zhang. Title: An Improved Pseudopolynomial Time Algorithm ... Talk by Jiatu Li, joint work with Edward Pyne and, Roei Tell. Title: Distinguishing, Predicting, and Certifying: On the Long Reach of ... Talk by Tony Metger, joint with Anand Natarajan, Tina Zhang Title: Succinct arguments for QMA from standard assumptions via ... Talk by Andrew Krapivin, joint work with Martin Farach-Colton and William Kuszmaul. Title: Optimal Bounds for Open Addressing ... Talk by Rebecca Reiffenhäuser, joint work with Paul Dütting, Thomas Kesselheim, Brendan Lucier, and Sahil Singla. Title: Online ...

Talk by Ron Rothblum, joint work with Nir Bitansky, Prahladh Harsha, Yuval Ishai, and David J. Wu. Title: Dot-Product Proofs and ... Talk by Atul Singh Arora, joint work with Kishor Bharti, Alexandru Cojocaru, Andrea Coladangelo Title: A computational test of ... Talk by Milind Prabhu, joint work with Nikhil Bansal, Vincent Cohen-Addad, David Saulpic and, Chris Schwiegelshohn. Talk by Ruizhe Zhang, joint work with Zhiyan Ding, Ethan N. Epperly, Lin Lin. Title: The ESPRIT algorithm under high noise: ... Talk by Rohan Goyal, joint work with Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar Title: Unlock the full potential of your cloud security investments with the right partners by your side. When you understand which ...

Talk by Oliver Korten, joint work with Toniann Pitassi. Title: Strong vs. Weak Range Avoidance and the Linear Ordering Principle ...

Photo Gallery

FOCS 2024 8A Fast decision tree learning solves hard coding-theoretic problems
FOCS 2024 10A An Improved Pseudopolynomial Time Algorithm for Subset Sum
FOCS 2024 7A Distinguishing, Predicting, and Certifying
FOCS 2024 6A Succinct arguments for QMA from standard assumptions via compiled nonlocal games
FOCS 2024 3B Optimal Bounds for Open Addressing Without Reordering
FOCS 2024 6B Online Combinatorial Allocations and Auctions with Few Samples
FOCS 2024 4A Dot-Product Proofs and Their Applications
FOCS 2024 4C A computational test of quantum contextuality, and even simpler proofs of quantumness
FOCS 2024 7C Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds
FOCS 2024 Plenary 2 - Expanders and PCPs: Emergence from Local to Global
FOCS 2024 10C The ESPRIT algorithm under high noise
FOCS 2024 2A Fast list decoding of univariate multiplicity and folded Reed-Solomon codes
View Detailed Profile
FOCS 2024 8A Fast decision tree learning solves hard coding-theoretic problems

FOCS 2024 8A Fast decision tree learning solves hard coding-theoretic problems

Talk by Carmen Strassle, joint work with Caleb Koch and Li-Yang Tan Title:

FOCS 2024 10A An Improved Pseudopolynomial Time Algorithm for Subset Sum

FOCS 2024 10A An Improved Pseudopolynomial Time Algorithm for Subset Sum

Talk by Lin Chen, joint work with Jiayi Lian, Yuchen Mao, Guochuan Zhang. Title: An Improved Pseudopolynomial Time Algorithm ...

Sponsored
FOCS 2024 7A Distinguishing, Predicting, and Certifying

FOCS 2024 7A Distinguishing, Predicting, and Certifying

Talk by Jiatu Li, joint work with Edward Pyne and, Roei Tell. Title: Distinguishing, Predicting, and Certifying: On the Long Reach of ...

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 3B Optimal Bounds for Open Addressing Without Reordering

FOCS 2024 3B Optimal Bounds for Open Addressing Without Reordering

Talk by Andrew Krapivin, joint work with Martin Farach-Colton and William Kuszmaul. Title: Optimal Bounds for Open Addressing ...

Sponsored
FOCS 2024 6B Online Combinatorial Allocations and Auctions with Few Samples

FOCS 2024 6B Online Combinatorial Allocations and Auctions with Few Samples

Talk by Rebecca Reiffenhäuser, joint work with Paul Dütting, Thomas Kesselheim, Brendan Lucier, and Sahil Singla. Title: Online ...

FOCS 2024 4A Dot-Product Proofs and Their Applications

FOCS 2024 4A Dot-Product Proofs and Their Applications

Talk by Ron Rothblum, joint work with Nir Bitansky, Prahladh Harsha, Yuval Ishai, and David J. Wu. Title: Dot-Product Proofs and ...

FOCS 2024 4C A computational test of quantum contextuality, and even simpler proofs of quantumness

FOCS 2024 4C A computational test of quantum contextuality, and even simpler proofs of quantumness

Talk by Atul Singh Arora, joint work with Kishor Bharti, Alexandru Cojocaru, Andrea Coladangelo Title: A computational test of ...

FOCS 2024 7C Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds

FOCS 2024 7C Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds

Talk by Milind Prabhu, joint work with Nikhil Bansal, Vincent Cohen-Addad, David Saulpic and, Chris Schwiegelshohn.

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 10C The ESPRIT algorithm under high noise

FOCS 2024 10C The ESPRIT algorithm under high noise

Talk by Ruizhe Zhang, joint work with Zhiyan Ding, Ethan N. Epperly, Lin Lin. Title: The ESPRIT algorithm under high noise: ...

FOCS 2024 2A Fast list decoding of univariate multiplicity and folded Reed-Solomon codes

FOCS 2024 2A Fast list decoding of univariate multiplicity and folded Reed-Solomon codes

Talk by Rohan Goyal, joint work with Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar Title:

AWS re:Inforce 2024 - Find an AWS Partner, faster: Credentials, resources, and success (PTN221)

AWS re:Inforce 2024 - Find an AWS Partner, faster: Credentials, resources, and success (PTN221)

Unlock the full potential of your cloud security investments with the right partners by your side. When you understand which ...

FOCS 2024 6C Strong vs. Weak Range Avoidance and the Linear Ordering Principle

FOCS 2024 6C Strong vs. Weak Range Avoidance and the Linear Ordering Principle

Talk by Oliver Korten, joint work with Toniann Pitassi. Title: Strong vs. Weak Range Avoidance and the Linear Ordering Principle ...

FOCS: Fast Overlapped Community Search IEEE PROJECTS 2015-2016

FOCS: Fast Overlapped Community Search IEEE PROJECTS 2015-2016

FOCS

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...

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...

Annual IEEE Symposium on Foundations of Computer Science information

Location: Paris, France 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) Location: Berkeley,...

FOCS25 information

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

Sponsored