Torsten Suel

Torsten Suel is a professor in the Department of Computer Science and Engineering at the New York University Tandon School of Engineering.[1] He received his Ph.D. in 1994 from the University of Texas at Austin under the supervision of Greg Plaxton.[2] He works on the subjects of implementation of bulk synchronous parallel computation, streaming algorithms for histograms, join operations in databases, distributed algorithms for dominating sets, and web crawler algorithms. A conference paper he co-authored in 2011 introduces fast retrieval techniques that were integrated into the Apache Lucene search engine library.[3]

Torsten Suel
BornApril 7, 1966
NationalityGerman
Alma materBraunschweig University of Technology, Germany
University of Texas at Austin
AwardsBest paper award of 14th ACM World Wide Web Conference (2005)
Scientific career
FieldsComputer Scientist
InstitutionsNew York University Tandon School of Engineering
Doctoral advisorCharles Gregory Plaxton

Selected bibliography

According to Google Scholar's citation list,[4] Suel has 34 journal articles or conference proceedings cited 34 or more times. His five highest cited peer-reviewed papers and IEEE conference proceedings are:

  • Jonathan Hill, Bill McColl, Dan C Stefanescu, Mark W Goudreau, Kevin Lang, Satish B Rao, Torsten Suel, Thanasis Tsantilas, Rob H Bisseling, "BSPlib: The BSP programming library" Parallel Computing 24(13), p. 1947-1980. (1999) [5] Cited 352 times according to Google Scholar;[6] Cited 99 times in Scopus,[5]
  • HV Jagadish, Nick Koudas, S Muthukrishnan, Viswanath Poosala, Ken Sevcik, Torsten Suel "Optimal histograms with quality guarantees" Proceedings of the International Conference on Very Large Data Bases (2002) p. 275-286, IEEE,[7] cited 325 times, according to Google Scholar [8]
  • Vladislav Shkapenyuk, Torsten Suel "Design and implementation of a high-performance distributed web crawler" p. 357-368 Data Engineering 2002: Proceedings. 18th International Conference on Data Engineering, IEEE,(2002) [9] Cited 240 times, according to Google Scholar [10]
  • Lujun Jia, Rajmohan Rajaraman, Torsten Suel, "An efficient distributed algorithm for constructing small dominating sets" Distributed Computing 15(3) p. 193-205 (2002) [11] Cited 188 times, according to Google Scholar.[12]
  • Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter, "Scalable sweeping-based spatial join" Proceedings Of The International Conference On Very Large Data Bases p. 570-581 IEEE, 1998.[13] Cited 173 times, according to Google Scholar.[14]

References
  1. Faculty listing, Computer Science and Engineering, New York University Tandon School of Engineering.
  2. Torsten Suel at the Mathematics Genealogy Project
  3. https://www.elastic.co/blog/faster-retrieval-of-top-hits-in-elasticsearch-with-block-max-wand
  4. Access date Nov 15, 2012
  5. Hill, Jonathan M.D.; McColl, Bill; Stefanescu, Dan C.; Goudreau, Mark W.; Lang, Kevin; Rao, Satish B.; Suel, Torsten; Tsantilas, Thanasis; Bisseling, Rob H. (1998). "BSPlib: The BSP programming library". Parallel Computing. 24 (14): 1947–1980. CiteSeerX 10.1.1.48.5132. doi:10.1016/S0167-8191(98)00093-3.
  7. pdf at Emory
  9. pdf from Poly Archived 2004-11-06 at the Wayback Machine
  11. SpringerLink
  13. pdf from Berkeley
  14. GoogleScholar
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.