Kevin Matulef Computer Science and Artificial Intelligence Laboratory Phone: (617) 275-6958, (617) 225-6306 |
Publications:
Efficiently Testing Sparse GF(2) Polynomials
I. Diakonikolas,
H. Lee,
K. Matulef,
R. Servedio,
A. Wan.
To appear in the 35th International Colloquium on Automata, Languages and Programming (ICALP),
2008.
pdf, ps
(extended abstract, with full proofs in appendices)
Testing Halfspaces
K. Matulef,
R. O'Donnell,
R. Rubinfeld ,
R. Servedio.
Submitted. Available as ECCC Tech Report TR07-128.
pdf, ps (full version)
Testing For Concise Representations
I. Diakonikolas,
H. Lee,
K. Matulef,
K. Onak,
R. Rubinfeld ,
R. Servedio,
A. Wan.
48th Annual Symposium on Foundations of Computer Science (FOCS), 2007.
pdf, ps
(extended abstract)
pdf, ps
(full version)
Testing k-wise and Almost k-wise Independence
N. Alon, A.
Andoni, T. Kaufman, K. Matulef, R. Rubinfeld, N. Xie.
39th ACM Symposium on Theory of Computing (STOC), 2007.
pdf, ps
(extended abstract)
Professional:
Teaching:
In Fall 2004 and Fall 2005 I was a TA for 18.404/6.840,
Introduction to Theory of Computation.
My recitation notes can be found here.
Facebook Enemies:
Enemybook is a program that I wrote to remedy the one-sided perspective of Facebook.
It was featured in several media outlets including the Boston Globe (article)
and NPR (interview1,
interview2).
More info on Enemybook can be found here.