Encryption systems rely on “random” numbers, but conventional computers can’t generate them perfectly. New research shows that quantum physics can.

Jeremiah Blocki, jblocki+451@cs.cmu.edu: Monday @ 3:30 PM. GHC 7th floor lounge. Students can email me if they want to meet at a different time. Anvesh Komuravelli, anvesh+451@cs.cmu.edu: Friday @ 4 ...

Abstract: Lecture video is an increasingly important learning resource. However, the challenge of quickly finding the content of interest in a long lecture video is a critical limitation of this ...

Explore the intricacies of Spotify's shuffle feature in this insightful video. Delve into why it's not truly random, the role of algorithms, and the surprising reasons behind our preference for a ...

The original version of this story appeared in Quanta Magazine. One July afternoon in 2024, Ryan Williams set out to prove himself wrong. Two months had passed since he’d hit upon a startling ...

Abstract: This lecture note describes a technique known as locality-sensitive hashing (LSH) that allows one to quickly find similar entries in large databases. This approach belongs to a novel and ...

During the past fifteen years, there has been a tremendous growth of research on randomized (sketching) algorithms for large-scale computations, such as matrix multiplication, least-squares, singular ...

The sixteenth lecture takes place on the 24th of April 2024 at 4:30 PM (CET), virtually. The lecture features Ph.D. candidates Thalea Schlender and Fu-Xing Long. The ...

The relative performance of data-driven algorithms and human decisionmakers, who are often able to override algorithmic recommendations, is an active subject of study in many settings. In a new study ...