If you are expecting a response to your email, and I have not responded within 24 hours, please send a reminder.
Carnegie Mellon University
- COMP 202: Foundations of Programming (Spring14, Summer14)
- COMP 531: Advanced Theory of Computation (Spring14)
On the Spectral Properties of Symmetric Functions
with Omar Fawzi, Raghav Kulkarni
Spectral Norm of Symmetric Functions
with Omar Fawzi, Hamed Hatami
International Workshop on Randomization and Computation (RANDOM), 2012
The NOF Multiparty Communication Complexity of Composed Functions
with Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen
International Conference on Automata, Languages and Programming (ICALP), 2012
Computational Complexity, 2015
The Hardness of Being Private
with Arkadev Chattopadhyay, Stephen Cook, Lila Fontes, Michal Koucký, Toniann Pitassi
IEEE Conference on Computational Complexity (CCC), 2012
ACM Transactions on Computation Theory (TOCT), 2014
Multiparty Communication Complexity of Disjointness
with Arkadev Chattopadhyay
Electronic Colloquium on Computational Complexity (ECCC), 2008
On the Non-Deterministic Communication Complexity of Regular Languages
International Journal of Foundations of Computer Science, 2010
Special issue for Developments in Language Theory (DLT), 2008
On Bus Graph Realizability
with Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-Francois Preville-Ratelle, Sue Whitesides, Nuo Yu
Canadian Conference on Computational Geometry (CCCG), 2007
15-251 "Great Ideas in Theoretical Computer Science" Course Notes
These notes are not meant to be used as a stand-alone textbook. They complement the lectures and serve as a compact and convenient studying tool.
15-251 "Great Ideas in Theoretical Computer Science" Course Notes Solutions
This document contains the solutions to the exercises from the above notes.
Short Notes on Modular Arithmetic and Cryptography
Compact notes complementing the lectures.
Short Notes on Groups, Fields, Polynomials, and Error-Correcting Codes
Compact notes complementing the lectures.
Guidelines for Writing Proofs
Mostly stylistic suggestions on how to write mathematical proofs.
How to Succeed in 15-251
Suggestions for 15-251 students, but mostly applicable in other courses as well.
Notes on Communication Complexity
Some notes introducing the communication complexity model (taken from my thesis).
Notes on Analysis of Boolean Functions
Very short notes introducing Fourier analysis of Boolean functions (taken from my thesis).
Diderot is an online platform that allows instructors to upload and share their course content. It currently supports discussions and autograding code. Our goal is to produce an online environment that both the students and the instructors love to use, and that makes content creation and sharing as easy as possible.
The Diderot project was started together with Umut Acar and has won the Teaching Innovation Award at CMU. The following courses have used / are using Diderot: 15-122, 15-210, 15-251, 15-388/688, 15-455, 15-751, 15-780, 15-819, 15-897, 10-715, 21-228
More information coming soon.
From 2009 to 2018, I helped organize the annual Barbados workshop on computational complexity.
Click here for details.
I advised the following students in research projects.
Decision Tree and Fourier Complexity of Boolean Functions
Senior Thesis (advised together with Ryan O'Donnell)
Calvin Beideman, Anatol Liu, Thomas Tseng
Upper bounds in multiparty 'Number on the Forehead' model of communication complexity
Aditya Krishnan, Nicholas Sieger
On the special cases of long-rank conjecture in communication complexity
Kumail Jaffer, Sidhanth Mohanty
Multiparty 'Number on the Forehead' model of communication complexity and its relations to Ramsey Theory
Alyazeed Basyoni, Jacob Imola, William Xiao
Upper bounds in multiparty 'Number on the Forehead' model of communication complexity.
Boolean circuits with mod 6 gates.
I was born and raised up in Istanbul. I moved to Montréal after high school and received B.Sc. (Hon.) in Mathematics and Computer Science, M.Sc. in Computer Science, and Ph.D. in Computer Science, all from McGill University. I was advised by Denis Thérien and Hamed Hatami. I'm currently an Associate Teaching Professor in the Computer Science Department of Carnegie Mellon University.
I am passionate about education and theoretical computer science.
During graduate school, I did research on theoretical computer science, trying to understand the inherent limitations of computers and computation. More specifically, my research interests are in communication complexity, circuit complexity, analysis of boolean functions and matrices, pseudorandomness - structure vs randomness in computer science and mathematics, and additive combinatorics.
Most of my time right now goes to thinking about teaching and education. I love teaching theoretical computer science and trying to find the best explanations for conceptually difficult topics. I am also very much interested in rethinking higher education, which means rethinking the role of lectures, rethinking assessment schemes, rethinking the roles of teaching assistants, etc. I believe there is a lot of room for improvement and I think about these issues every day.