Skip to main content

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
Berkeley University of California
Home Home

Main navigation

  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • Participate
    • Apply to Participate
    • Propose a Program
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
    • Chancellor's Professors
  • News & Videos
    • News
    • Videos
  • Support for the Institute
    • Annual Fund
    • All Funders
    • Institutional Partnerships
  • For Visitors
    • Visitor Guide
    • Plan Your Visit
    • Location & Directions
    • Accessibility
    • Building Access
    • IT Guide
  • About

Results 1481 - 1490 of 23856

Video
|
Aug. 7, 2025
Willow: Secure Aggregation with One-Shot Clients
Video
|
Aug. 7, 2025
Secure Computation in Action: Real-World Deployments in Finance
Video
|
Aug. 7, 2025
From 10,000-Party Protocols to Vibe Coding ZK: Engineering Cryptography Through Black-Box Design
Video
|
Aug. 7, 2025
Privacy Preserving Aggregation of Ad Conversions using MPC
Video
|
Aug. 7, 2025
The modern anonymous credential (how ZK landed in Google Wallet)
News
|
Aug. 7, 2025

Sum-of-Squares Spectral Amplification (SOSSA)

Sum-of-squares spectral amplification (SOSSA) is a new method for compiling efficient block encodings that exploits the low energy of the initial state and relies on sum-of-squares optimization. This talk by Caltech graduate student Robbie King describes the ideas behind the new technique, and in particular how sum-of-squares optimization connects to Hamiltonian simulation and phase estimation.

News
|
Aug. 7, 2025

SP1 Hypercube and the Jagged Polynomial Commitment Scheme

SP1 Hypercube is a new multilinear-based proof system for proving the correctness of programs written in a high-level programming language. In his recent talk in the Summer 2025 Cryptography program workshop on Proofs, Ron Rothblum (Succinct) gave an overview of how such real-world proof systems work, while focusing on a key novel component in Hypercube: the jagged polynomial commitment scheme.

News
|
Aug. 7, 2025

Steven Piantadosi | Polylogues

In Spring 2025, the Simons Institute hosted a workshop on LLMs, Cognitive Science, Linguistics, and Neuroscience. In this episode of Polylogues, Spring 2025 Science Communicator in Residence Christoph Drösser sits down with one of the workshop’s organizers and presenters, psychology and neuroscience professor Steven Piantadosi (UC Berkeley).

News
|
Aug. 7, 2025

Metacognition and Related Abilities of Large Language Models

During her talk at the Simons Institute’s workshop on The Future of Language Models and Transformers, Azalia Mirhoseini of Stanford University and Google DeepMind suggested that even small LLMs might “know” more than is obvious at first and can be made to answer questions correctly given enough compute. This theme — about LLMs and the knowledge they contain — played out in other talks in the same workshop, with speakers arguing that LLMs not only know, but also know that they know — an ability that can loosely be called metacognition.

News
|
Aug. 7, 2025

So Random! How Coin Flips Conquered Noise

Flip a coin — you get a 0 or 1. Flip 50 coins — you get 50 random bits. Flip 50 coins 50 times — you get … an error-correcting code. Or so said Claude Shannon, who came up with the concept in his seminal 1948 paper, “A Mathematical Theory of Communication.” An error-correcting code is an algorithm that enables the transmission of data in such a way that errors can be detected and corrected. Before Shannon, scientists assumed that the problem of noise could never be overcome in an unreliable communication channel. Shannon showed that this assumption was wrong.

Pagination

  • Previous page Previous
  • Page 147
  • Page 148
  • Current page 149
  • Page 150
  • Page 151
  • Next page Next
Home
The Simons Institute for the Theory of Computing is the world's leading venue for collaborative research in theoretical computer science.

Footer

  • Programs & Events
  • Participate
  • Workshops & Symposia
  • Contact Us
  • Calendar
  • Accessibility

Footer social media

  • Twitter
  • Facebook
  • Youtube
© 2013–2026 Simons Institute for the Theory of Computing. All Rights Reserved.
link to homepage

Main navigation

  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • Participate
    • Apply to Participate
    • Propose a Program
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
    • Chancellor's Professors
  • News & Videos
    • News
    • Videos
  • Support for the Institute
    • Annual Fund
    • All Funders
    • Institutional Partnerships
  • For Visitors
    • Visitor Guide
    • Plan Your Visit
    • Location & Directions
    • Accessibility
    • Building Access
    • IT Guide
  • About

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
link to homepage