News & Events

Ward Prize Presentations

Colloquium Friday, May 10 2:35pm in Wege Presentations by students nominated for the 2024 Rich Ward Prize for Best Student Project in Computer Science. CS colloquium credit for attendance! *To be followed by CS celebration on the Science Quad*… Continue reading »

CS Class of ’60s Colloquium – Cynthia Dwork, Harvard

Friday, April 26 2:35pm Wege Auditorium (TCL 123) *CS Colloquium Credit for attendance* Groups, Individuals, Indistinguishability, and Loss: 15 years of Algorithmic Fairness in Under and Hour Launched nearly fifteen years ago, the flourishing study of the theory of algorithmic fairness draws on cryptography, privacy, the philosophy of probability, machine… Continue reading »

Class of ’60s Speaker – Cynthia Dwork, Harvard

Thursday, April 25 7:30pm in Bronfman Auditorium (Wachenheim B11)  – Reception to follow – *CS Colloquium Credit for attendance* It’s in Your Phone. It’s in Your Browser. It’s in Your Redistricting Data! … It’s Differential Privacy. “Anonymized data aren’t.”  Either they are not really anonymized or the anonymization process destroys… Continue reading »

Colloquium 4/12: Christine Bassem, Wellesley

Friday, April 12 2:35pm in Wege Towards Mobility Coordination in Participatory Crowdsensing Platforms With the recent advances in mobile crowdsensing, participating self-motivated crowds already roaming in a mobility field can assist in the collection of sensing data. One of the main challenging aspects of participatory crowdsensing is that crowd… Continue reading »

Colloquium 4/12 – Christine Bassem, Wellesley

Christine Bassem CS Colloquium Friday, April 12 2:35pm in Wege   Towards Mobility Coordination in Participatory Crowdsensing Platforms With the recent advances in mobile crowdsensing, participating self-motivated crowds already roaming in a mobility field can assist in the collection of sensing data. One of the main challenging aspects of… Continue reading »

Friday 4/05 Colloquium – Tim Randolph ’18

Friday, April 05 2:35pm in Wege (TCL 123)   Algorithmic Approaches to Subset Sum (and Other Hard Problems) The Subset Sum problem is the most fundamental NP-complete problem concerned with adding numbers together. However, progress on exact algorithms for this problem has been slow: Since Horowitz and Sahni’s… Continue reading »