Recent CSD Ph.D. grad Juncheng Yang received the 2025 ACM SIGOPS Dennis M. Ritchie Doctoral Dissertation Award for his contributions to and impact on software systems research.

2009 Monte Carlo Sampling for Regret Minimization in Extensive Games. Marc Lanctot, Kevin Waugh, Martin Zinkevich, and Michael Bowling.In Advances in Neural Information Processing Systems 22 (NIPS), ...

I obtained my PhD from in Societal Computing at the School of Computer Science at Carnegie Mellon University in October 2018. In May 2011, I got my Masters degree in Information Security Technology & ...

Many of the problems in artificial intelligence, statistics, computer systems, computer vision, natural language processing, and computational biology, among many other fields, can be viewed as the ...

Javascript is required for the SCS calendar.

The Young Architect Workshop (YArch, pronounced “why arch”) is a workshop for junior graduate students and research-active undergraduate students studying computer architecture and related fields.

This webpage is a benchmark data set for keystroke dynamics. It is a supplement to the paper "Comparing Anomaly-Detection Algorithms for Keystroke Dynamics," by Kevin Killourhy and Roy Maxion, ...

(eq x y) is true if and only if x and y are the same identical object. (Implementationally, x and y are usually eq if and only if they address the same identical memory location.) It should be noted ...

The Caterpillar and Alice looked at each other for some time in silence: at last the Caterpillar took the hookah out of its mouth, and addressed her in a languid, sleepy voice. `Who are you?' said the ...

Even with eyes protected by the green spectacles, Dorothy and her friends were at first dazzled by the brilliancy of the wonderful City. The streets were lined with beautiful houses all built of green ...

The concept of "OT" (operating thetan) is important in Scientology, as it is the promises made for the OT Levels that motivate many Scientologists to remain in the organization and work their way up ...

Isn't Hex a solved game? Only "ultra-weakly," to use Victor Allis's terminology. John Nash proved in 1949 that the first player has a theoretical win, but his proof is non-constructive; i.e., it does ...