Tamás Sarlós

As of March 2007 I work at Yahoo! Research Silicon Valley. See my other homepage there.

I used to be a member of the Data Mining and Web Search Group, Informatics Laboratory, Computer and Automation Research Institute of the Hungarian Academy of Sciences.

I received my PhD in Computer Science at the Faculty of Informatics, Eötvös Loránd University, under the supervision of András A. Benczúr. I obtained my M.Sc. with honours in Computer Science at Eötvös Loránd University, and another M.Sc. in finance at the Budapest University of Economic Sciences, both in '03.

Curriculum Vitae

E-mail me at yahoo.com, the userid is tamas.sarlos.


Research Interests


Publications

  1. Are Web Users Really Markovian?
    Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan, Tamás Sarlós. WWW 2012

  2. Fast Locality Sensitive Hashing
    Anirban Dasgupta, Ravi Kumar, Tamás Sarlós. KDD 2011

  3. Mining Tags Using Social Endorsement Networks
    Theodoros Lappas, Kunal Punera, Tamás Sarlós. SIGIR 2011

  4. On Scheduling in Map-Reduce and Flow-Shops
    Benjamin Moseley, Anirban Dasgupta, Ravi Kumar, Tamás Sarlós. SPAA 2011

  5. A Sparse Johnson--Lindenstrauss Transform
    Anirban Dasgupta, Ravi Kumar, Tamás Sarlós. STOC 2010

  6. Faster Least Squares Approximation
    Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, Tamás Sarlós. Numerische Mathematik, 117(2):219-249, 2010

  7. Web Spam Detection via Commercial Intent Analysis
    András A. Benczúr, István Biró, Károly Csalogány, Tamás Sarlós. In proceedings of
    AIRWeb '07 held in conjunction with WWW2007.

  8. Improved Approximation Algorithms for Large Matrices via Random Projections
    Tamás Sarlós. In proceedings of FOCS '06, slides.
    Mildly revised versions with slightly better SVD: short, long.

  9. Link-Based Similarity Search to Fight Web Spam
    András A. Benczúr, Károly Csalogány, Tamás Sarlós. In proceedings of AIRWeb '06 held in conjunction with SIGIR2006.

  10. To Randomize or Not To Randomize: Space Optimal Summaries for Hyperlink Analysis
    Tamás Sarlós, András A. Benczúr, Károly Csalogány, Dániel Fogaras, Balázs Rácz. Technical Report, 2005. Short version appeared in proceedings of WWW2006, slides.

  11. Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
    Dániel Fogaras, Balázs Rácz, Károly Csalogány, Tamás Sarlós. Internet Mathematics, 2(3):333-358, 2005; conference version from the first two authors.

  12. SpamRank -- Fully Automatic Link Spam Detection
    András A. Benczúr, Károly Csalogány, Tamás Sarlós, Máté Uher. In proceedings of AIRWeb '05 held in conjunction with WWW2005, to appear in Information Retrieval.

  13. On the Feasibility of Low-rank Approximation for Personalized PageRank
    András A. Benczúr, Károly Csalogány, Tamás Sarlós. In poster proceedings of WWW2005.

  14. Searching a Small National Domain -- a Preliminary Report
    András A. Benczúr, Károly Csalogány, Dániel Fogaras, Eszter Friedman, Tamás Sarlós, Máté Uher and Eszter Windhager. In poster proceedings of WWW2003.

  15. PageRank és azon túl: Hiperhivatkozások szerepe a keresésben (PageRank and Beyond: The Role of Hyperlinks in Search, in Hungarian).
    András A. Benczúr, István Bíró, Károly Csalogány, Balázs Rácz, Tamás Sarlós, Máté Uher. Magyar Tudomány, pp. 1325-1331, November 2006.

  16. Magyar nyelvű tartalom a világhálón (Hungarian Content on the WWW, in Hungarian)
    András A. Benczúr, Károly Csalogány, Dániel Fogaras, Eszter Friedman, Balázs Rácz, Tamás Sarlós, Máté Uher, Eszter Windhager. Információs Társadalom és Trendkutató Központ Kutatási Jelentés, 2004.


Teaching

Algorithms and Data Structures I. & II., TA, Fall 2003 - Spring 2006
Exercises for my students
Algorithms with LEDA, Spring 2004

Last updated on 2012-02-01