Dan Feldman's Home Page

The School of Computer Science

Tel-Aviv University

Ramat Aviv, Tel Aviv 69978

Israel

+972-3-6350704 (phone)

+972-528-550211 (mobile)

dannyf@post.tau.ac.il

I am a Ph.D. candidate under the supervision of Prof. Amos Fiat and Prof. Micha Sharir.

Fields of interest

Resume

Publications and Papers

Please email me if you are interested in a paper that is unavailable here.

·       Algorithms For Finding the Optimal k-Line Mean,
MSc Thesis, 2004

·       Coresets for Weighted Facilities and Their Applications,
with Amos Fiat and Micha Sharir,
Proc. 47th Annu. IEEE Symposium on Foundations of Computer Science (FOCS) 2006
[Slides]

·       A PTAS for k-Means Clustering Based on Weak Coresets,
with Morteza Monemizadeh and Christian Sohler,
Proc. 23th Annu. ACM Symposium on Computational Geometry (SoCG) 2007

·       Bi-criteria Linear-time Approximations for Generalized k-Mean/Median/Center,
with Amos Fiat, Danny Segev and Micha Sharir,
Proc. 23th Annu. ACM Symposium on Computational Geometry (SoCG) 2007
[Slides]

·       Private Coresets,
with Amos Fiat, Haim Kaplan and Kobbi Nissim,
Proc. 41th Annu. ACM Symposium on Theory of Computing (STOC) 2009.

·       Coresets and Sketches for High Dimensional Subspace Approximation Problems,
with Morteza Monemizadeh, Christian Sohler and David Woodruf,
Submitted, 2008.

·       A General Framework for Bi-Criteria Approximate Clustering,
with Michael Langberg,
Manuscript, 2008.

·       On Approximating Subspaces by Subspaces,
with Michael Langberg,
Manuscript, 2008.

Open Code

Teaching - Current

Teaching - Past