Graduating Bits

Nima Anari
Stanford University, postdoc
Nima is a postdoctoral researcher at Stanford university, working with Amin Saberi, and obtained his Ph.D. from UC Berkeley, advised by Satish Rao. He has a general interest in theoretical computer science, especially in algorithm design for counting and optimization problems. His current research focuses on algebraic tools, particularly real stable polynomials, and their applications in combinatorics, probability, and algorithm design.
Clément Canonne
Columbia University, student
I am a PhD student at Columbia University, advised by Rocco Servedio. My main focus is on the areas of property testing and sublinear algorithms. Specifically, I am interested in understanding the strengths and limitations of the standard models in property and distribution testing, as well as in related areas. I also really like elephants.
Yu Cheng
University of Southern California, student
Yu Cheng is a PhD student at the University of Southern California, advised by Shang-Hua Teng. He is interested in the area of theoretical computer science, focusing on algorithmic game theory and spectral graph theory. He is particularly interested in exploring the role of information in strategic interactions, and designing efficient algorithms for large-scale optimization problems.
Venkata Gandikota
Purdue University, student
I am a final year PhD student in the department of Computer Science at Purdue University working with Dr. Elena Grigorescu. Currently I am looking for postdoctoral positions starting Summer or Fall 2017. So far, my research has focused on identifying the complexity of nearest neighbor search problems on important families of lattices and error-correcting codes.
Siyao Guo
Simons Institute, postdoc
PhD in 2014 @ Chinese University of Hong Kong (CUHK) under Andrej Bogdanov; postdoc in CUHK (2015); postdoc in NYU (2016). Research interests: cryptography, complexity, pseudorandomness.
Tom Gur
Weizmann Institute of Science, student
I am a phd student of Oded Goldreich at Weizmann. I expect to graduate on May 2016. I am broadly interested in complexity theory and discrete mathematics, and particularly in property testing, coding theory, and verifiable computation.
Marc Khoury
UC Berkeley, student
Marc Khoury is a PhD student at UC Berkeley, advised by Jonathan Shewchuk. He is interested in computational geometry and topology and its applications to other areas of computer science. He received his BS in Computer Science and Engineering from The Ohio State University and his MASt in Mathematics from the University of Cambridge.
Janardhan Kulkarni
Microsoft Research Redmond, postdoc
I primarily work in approximation algorithms, online algorithms, and game theory. However, considerable part of my research time is also devoted solving more applied problems. My work has appeared in STOC, FOCS, OSDI, and SIGCOMM. Here are my main research themes: Data Center Scheduling and Routing (we develop new models and algorithms for scheduling and routing problems that arise in large data centers and big data applications); Fundamental Optimization Problems (we give first algorithms for several long standing open problems); Price of Anarchy Analysis Via Duality (we introduce and develop duality based techniques to bound robust PoA).
Mathieu Laurière
University Paris Diderot (and NYU Shanghai), student
I am a PhD student at University Paris Diderot, advised by Iordanis Kerenidis. I am working on communication complexity and information complexity both in the classical and the quantum settings. In this area, I am particularly interested in lower bound techniques.
Abbas Mehrabian
University of British Columbia, postdoc
I am a postdoc at UBC now. In January 2017 I am going to Simons Institute to participate in the Pseudorandomness program and will spend the whole semester there. A main theme of my research is studying random graph processes that arise in computer science. Two of my favourite ones include rumour spreading and dynamic load balancing.
Cameron Musco
MIT, student
I am advised by Nancy Lynch and work at the intersection of theoretical computer science, numerical linear algebra, and machine learning. My work has primarily focused on randomized methods in linear algebra and their applications to data analysis and learning tasks. I also study computation in biological systems to better understand robust, randomized, and scalable algorithms that appear in nature.
Ioannis Panageas
MIT-SUTD, student
I graduated recently (July 2016) from Georgia Tech (ACO program) under the supervision of Prasad Tetali. My research aims at the design of efficient algorithms and analysis of complex systems. I am interested in the following questions: Given a system, does it reach a steady/equilibrium state, and if yes how fast; if there are multiple fixed points, which is the ``right" one; what can we say about the system's performance. My work combines techniques from a variety of areas such as algorithms, dynamical systems, applied probability, machine learning theory and optimization.
Aviad Rubinstein
UC Berkeley, student
I am a final year Computer Science PhD candidate at UC Berkeley, advised by Christos Papadimitriou. My research looks, through the Lens of Theoretical Computer Science, at a variety of problems from the studies of Evolution, Statistics, Stopping Theory, and Game Theory. Two lines of works that I am particularly thrilled about are: (1) understanding the terrain of computational complexity between P and NP, and (2) understanding mechanism design subject to simplicity constraints.
Xiaorui Sun
Simons Institute, research fellow
Xiaorui is a Google Research Fellow at Simons Institute. He obtained his Ph.D. in 2016 from Columbia University, advised by Xi Chen. He is interested in the design and analysis of algorithms. Recently, his research focuses on algorithms for massive data analysis.
Marc Vinyals
KTH Royal Institute of Technology, student
I am a PhD student at KTH Royal Institute of Technology, Sweden, and I previously obtained a diploma degree in mathematics from Universitat Politècnica de Catalunya. My research interests are in computational complexity, in particular communication complexity and proof complexity, and in SAT algorithms. I am also involved in competitive programming as a coach and problemsetter.
Henry Yuen
UC Berkeley, postdoc
Henry is motivated by a simple but fundamental question: What are the ultimate limits of computation and information processing in the physical universe? To answer this question he uses tools from complexity theory, cryptography, and quantum information. Much of his research has focused on the complexity and cryptographic aspects of quantum entanglement. He recently completed his Ph.D. at MIT, advised by Dana Moshkovitz, and is now a postdoc at UC Berkeley.
Zeyu Zhang
Johns Hopkins University, student
I'm a 3rd year Ph.D. student in Department of Computer Science of Johns Hopkins University, advised by Michael Dinitz. Before that, I graduated with a BS degree in Mathematics from Tsinghua University in China. My research focus on theoretical computer science, especially on approximation algorithms and graph algorithms. Recently I'm also working on obtaining various information of graphs in streaming settings.