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]

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), pp. 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) pp. 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" pp. 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) pp. 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 pp. 570–581 IEEE, 1998.[13] Cited 173 times, according to Google Scholar.[14]

References

  1. ^ "Home | NYU Tandon School of Engineering". engineering.nyu.edu. Retrieved 2024-09-01.
  2. ^ Torsten Suel at the Mathematics Genealogy Project
  3. ^ "Faster Retrieval of Top Hits in Elasticsearch with Block-Max WAND". 5 February 2019.
  4. ^ "Torsten Suel". scholar.google.com. Retrieved 2024-09-01.
  5. ^ a b 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" (PDF). Parallel Computing. 24 (14): 1947–1980. CiteSeerX 10.1.1.48.5132. doi:10.1016/S0167-8191(98)00093-3. hdl:1874/378687.
  6. ^ "BSPlib: The BSP programming library".
  7. ^ Jagadish, H. V.; Koudas, Nick; Muthukrishnan, S.; Poosala, V.; Sevcik, K.; Suel, Torsten (1998-08-24). "Optimal Histograms with Quality Guarantees". {{cite journal}}: Cite journal requires |journal= (help)
  8. ^ "Optimal histograms with quality guarantees".
  9. ^ pdf from Poly Archived 2004-11-06 at the Wayback Machine
  10. ^ "Design and implementation of a high-performance distributed web crawler".
  11. ^ Jia, Lujun; Rajaraman, Rajmohan; Suel, Torsten (2002). "An efficient distributed algorithm for constructing small dominating sets". Distributed Computing. 15 (4): 193–205. doi:10.1007/s00446-002-0078-0.
  12. ^ Jia, Lujun; Rajaraman, Rajmohan; Suel, Torsten (2002). "An efficient distributed algorithm for constructing small dominating sets". Distributed Computing. 15 (4): 193–205. doi:10.1007/s00446-002-0078-0.
  13. ^ pdf from Berkeley[permanent dead link‍]
  14. ^ Arge, Lars; Procopiuc, Octavian; Ramaswamy, Sridhar; Suel, Torsten; Scott Vitter, Jeffrey (1998). "Scalable sweeping-based spatial join". VLDB. 98: 570–581.
Allikas: https://en.wikipedia.org/wiki/Torsten_Suel
No tags for this post.