Papers by Torsten Suel:


Databases and Web:

  • Estimating Pairwise Distances in Large Graphs. M. Christoforaki and T. Suel. IEEE International Conference on Big Data, October 2014. (Available soon)

  • A Robust Model for Paper-Reviewer Assignment. X. Liu, T. Suel, and N. Memon. Proceedings of the ACM Conference on Recommender Systems (RecSys), October 2014. PDF

  • Automated Decision Support for Human Tasks in a Collaborative System: The Case of Deletion in Wikipedia. B. Gelley and T. Suel. Proceedings of WikiSym, August 2013. PDF

  • A Candidate Filtering Mechanism for Fast Top-K Query Processing on Modern CPUs. C. Dimopoulos, S. Nepomnyachiy, and T. Suel. 36th Annual ACM SIGIR Conference, July 2013. PDF

  • Optimizing Top-k Document Retrieval Strategies for Block-Max Indexes. C. Dimopoulos, S. Nepomnyachiy, and T. Suel. 6th ACM Conference on Web Search and Data Mining, February 2013. PDF

  • Optimizing Positional Index Structures for Versioned Document Collections. J. He and T. Suel. 35th Annual ACM SIGIR Conference, July 2012. PDF

  • To Index or not to Index: Time-Space Trade-Offs in Search Engines with Positional Ranking Functions. D. Arroyuelo, S. Gonzalez, M. Marin, M. Oyarzun, and T. Suel. 35th Annual ACM SIGIR Conference, July 2012. PDF

  • Text vs. Space: Efficient Geo-Search Query Processing. M. Christoforaki, J. He, C. Dimopoulos, A. Markowetz, and T. Suel. 20th ACM Conference on Information and Knowledge Management, October 2011. PDF

  • Scalable Manipulation of Archival Web Graphs. Y. Avcular and T. Suel. Workshop on Large-Scale and Distributed Systems for Information Retrieval. October 2011. PDF

  • Faster Temporal Range Queries over Versioned Text. J. He and T. Suel. 34th Annual ACM SIGIR Conference, July 2011. PDF

  • Faster Top-k Document Retrieval Using Block-Max Indexes. S. Ding and T. Suel. 34th Annual ACM SIGIR Conference, July 2011. PDF

  • Batch Query Processing for Web Search Engines. S. Ding, J. Attenberg, R. Baeza-Yates, and T. Suel. 4th ACM Conference on Web Search and Data Mining, February 2011. PDF

  • Improved Index Compression Techniques for Versioned Document Collections. With J. He and J. Zeng. 19th ACM Conference on Information and Knowledge Management, October 2010. PDF

  • Efficient Term Proximity Search with Term-Pair Indexes. With H. Yan, S. Shi, F. Zhang, and J. Wen. 19th ACM Conference on Information and Knowledge Management, October 2010. PDF

  • Scalable Techniques for Document Identifier Assignment in Inverted Indexes. With S. Ding and J. Attenberg. 19th International World Wide Web Conference (WWW), April 2010. PDF

  • Compact Full-Text Indexing of Versioned Document Collections. With J. He and H. Yan. 18th Conference on Information and Knowledge Management, November 2009. PDF

  • Modeling and Predicting User Behavior in Sponsored Search. With J. Attenberg and S. Pandey. 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), June 2009. PDF

  • Compressing Term Positions in Web Indexes. With H. Yan and S. Ding. 32nd Annual ACM SIGIR Conference, June 2009. PDF

  • Using Graphics Processors for High-Performance IR Query Processing. With S. Ding, J. He, and H. Yan. 18th International World Wide Web Conference (WWW), April 2009. PDF [An earlier shorter version appeared as a poster at the 17th WWW, April 2008]

  • Inverted Index Compression and Query Processing with Optimized Document Ordering. With H. Yan and S. Ding. 18th International World Wide Web Conference (WWW), April 2009. PDF

  • Improved Techniques for Result Caching in Web Search Engines. With Q. Gan. 18th International World Wide Web Conference (WWW), April 2009. PDF

  • Top-k Aggregation Using Intersection of Ranked Inputs. with R. Kumar, K. Punera, and S. Vassilvitskii. Second ACM International Conference on Web Search and Data Mining (WSDM), February 2009. PDF

  • Cleaning Search Results using Term Distance Features. With J. Attenberg. 4th Workshop on Adversarial Information Retrieval on the Web (in conjunction with WWW), April 2008. PDF

  • Geographic Web Usage Estimation by Monitoring DNS Caches. With H. Akcan and H. Broennimann. 1st International Workshop on Location and the Web (in conjunction with WWW), April 2008. PDF

  • Analysis of Geographic Queries in a Search Engine Log. With Q. Gan, J. Attenberg, and A. Markowetz. 1st International Workshop on Location and the Web (in conjunction with WWW), April 2008. PDF

  • Performance of Compressed Inverted List Caching in Search Engines. With J. Zhang and X.Long. 17th International World Wide Web Conference (WWW), April 2008, to appear. PDF

  • Algorithms for Low-Latency Remote File Synchronization. With H. Yan and U. Irmak. IEEE Infocom Conference, April 2008. PDF

  • Improving Web Spam Classifiers Using Link Structure. With Q. Gan. 3rd Workshop on Adversarial Information Retrieval on the Web (held in conjunction with WWW), May 2007, to appear. PDF

  • Efficient Search in Large Textual Collections with Redundancy. With J. Zhang. 16th International World Wide Web Conference (WWW), May 2007, to appear. PDF

  • Optimized Inverted List Assignment in Distributed Search Engine Architectures. With J. Zhang. 21st IEEE International Parallel & Distributed Processing Symposium (IPDPS'07), March 2007, to appear. PDF

  • Efficient Query Subscription Processing for Prospective Search Engines. With U. Irmak, S. Mihaylov, S. Ganguly, and R. Izmailov. USENIX Annual Technical Conference, May 2006. PDF

  • Efficient Query Processing in Geographic Web Search Engines. With Y. Chen and A. Markowetz. ACM Intern. Conference on Management of Data (SIGMOD), June 2006. PDF

  • Interactive Wrapper Generation with Minimal User Effort. With U. Irmak. 15th International World Wide Web Conference (WWW), May 2006. PDF

  • Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment. With J. Zhang. 5th IEEE International Conference on Peer-to-Peer Computing, August 2005. PDF

  • Design and Implementation of a Geographic Search Engine. With A. Markowetz, Y. Chen, X. Long, and B. Seeger. 8th International Workshop on the Web and Databases (WebDB), June 2005. PDF
    (Note: an extended version is available as Technical Report TR-CIS-2005-03, Polytechnic University, February 2005. PDF)

  • Hierarchical Substring Caching for Efficient Content Distribution to Low-Bandwidth Clients. With U. Irmak. 14th International World Wide Web Conference (WWW), May 2005. PDF

  • Three-Level Caching for Efficient Query Processing in Large Web Search Engines. With X. Long. 14th International World Wide Web Conference (WWW), May 2005. PDF

  • Improved Single-Round Protocols for Remote File Synchronization. With U. Irmak and S. Mihaylov. IEEE Infocom Conference, March 2005. PDF (Note: an earlier version with some of the results appeared at the 4th New York Metro Area Networking Workshop (NYMAN), September 2004.)

  • Optimal Peer Selection for P2P Downloading and Streaming. With M. Adler, R. Kumar, K. Ross, D. Rubenstein, and D. Yao. IEEE Infocom Conference, March 2005. PDF

  • The Perron-Frobenius Theorem and Some of its Applications. With U. Pillai and S. Cha. IEEE Signal Processing Magazine 2, 2005, pp. 62-75.

  • Approximation Algorithms for Array Partitioning Problems. With S. Muthukrishnan. Journal of Algorithms 54, 2005, pp. 85-104. PDF

  • Local Methods for Estimating PageRank Values. With Y. Chen and Q. Gan. 13th Conference on Information and Knowledge Management (CIKM), November 2004. PDF (Note: an earlier version appeared at the 3rd Workshop on Web Dynamics in conjunction with WWW 2004.)

  • Compressing File Collections with a TSP-Based Approach. With D. Trendafilov and N. Memon. Technical Report TR-CIS-2004-02, Polytechnic University, April 2004. PDF

  • Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks. With P. Noel and D. Trendafilov. IEEE International Conference on Data Engineering (ICDE), March 2004. PDF (Talk: PPT PDF, 6 per page)

  • Server-Friendly Delta Compression for Efficient Web Access. With A. Savant. Eighth International Workshop on Web Content Caching and Distribution (WCW), September 2003. PDF (Talk: PPT PDF, 6 per page)

  • Optimized Query Execution in Large Search Engines with Global Page Ordering. With X. Long. International Conference on Very Large Data Bases (VLDB), September 2003. PDF (Talk: PPT PDF, 6 per page)

  • ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval. With C. Mathur, J. Wu, J. Zhang, A. Delis, M. Kharrazi, X Long, and K. Shanmugasundaram. 6th International Workshop on the Web and Databases (WebDB), June 2003. PDF
    (Talk: PPT PDF, 6 per page)
    Technical Report (23 pages): PDF
    WWW 2003 Poster Version (2 pages): PDF

  • On the Scalability of an Image Transcoding Proxy Server. With A. Savant and N. Memon. International Conference on Image Processing, September 2003. PDF

  • Cluster-Based Delta Compression of Collections of Files. With Z. Ouyang, N. Memon, and D. Trendafilov. International Conference on Web Information Systems Engineering (WISE), December 2002. PDF (Talk: PPT PDF, 6 per page)

  • I/O-Efficient Techniques for Computing Pagerank. With Y. Chen and Q. Gan. ACM Conference on Information and Knowledge Engineering (CIKM), November 2002. PDF

  • zdelta: An Efficient Delta Compression Tool. With D. Trendafilov and N. Memon. Technical Report TR-CIS-2002-02, Polytechnic University, June 2002. PDF

  • Algorithms for Delta Compression and Remote File Synchronization With N. Memon. Invited chapter in Handbook of Lossless Compression. Edited by K. Sayood, Academic Press, August 2002. PDF (preliminary version)

  • Design and Implementation of a High-Performance Distributed Web Crawler. With V. Shkapenyuk. IEEE International Conference on Data Engineering (ICDE), February 2002. Postscript PDF (Talk: PPT PDF 6 per page)

  • Compressing the Graph Structure of the Web. With J. Yuan. IEEE Data Compression Conference (DCC 2001), March 2001. Postscript PDF

  • A Unified Approach for Indexed and Non-Indexed Spatial Joins. With L. Arge, O. Procopiuc, S. Ramaswamy, J. Vahrenhold, and J. Vitter. 7th International Conference on Extending Database Technology (EDBT 2000), March 2000, pp. 412-429. Postscript PDF

  • On Rectangular Partitionings of Two-Dimensional Data: Algorithms, Complexity. and Applications. With S. Muthukrishnan and V. Poosala. 7th International Conference on Database Theory (ICDT '99), January 1999, pp. 236-256. Postscript PDF (Note: an updated and extended version of the results on p-by-p partitionings appears in the April 2003 paper listed above)

  • Scalable Sweeping-Based Spatial Join. With L. Arge, O. Procopiuc, S. Ramaswamy, and J. Vitter. 24th International Conference on Very Large Data Bases (VLDB '98), August 1998, pp. 570-581. Postscript PDF

  • Optimal Histograms with Quality Guarantees. With H. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, and K. Sevcik. 24th International Conference on Very Large Data Bases (VLDB '98), August 1998, pp. 275-286. Postscript PDF

  • Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems. With L. Arge, O. Procopiuc, S. Ramaswamy, and J. Vitter. 9th Symposium on Discrete Algorithms (SODA '98), January 1998, pp. 685-694. Postscript PDF
  • line separator

    Applied Parallel Computing:

    • Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods. With D. Blackston. SC '97: High Performance Networking and Computing (Supercomputing '97), November 1997. Postscript PDF

    • BSPlib: The BSP Programming Library. With J. Hill, W. McColl, D. Stefanescu, M. Goudreau, K. Lang, S. Rao, T. Tsantilas, and H. Bisseling. Parallel Computing (24) 14, 1998, pp. 1947-1980. Postscript PDF

    • Portable and Efficient Parallel Computing Using the BSP Model. With M. Goudreau, K. Lang, S. Rao, and T. Tsantilas. IEEE Transactions on Computers 48(7), 1999, pp. 670-689. Postscript PDF

      An earlier version of this paper appeared as Towards Efficiency and Portability: Programming with the BSP Model at the 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA '96), June 1996, pp. 1--12. Postscript

      PDf

    line separator

    Theory of Parallel and Distributed Computation:

    • Optimal Peer Selection for P2P Downloading and Streaming. With M. Adler, R. Kumar, K. Ross, D. Rubenstein, and D. Yao. IEEE Infocom Conference, March 2005.

    • An Efficient Distributed Algorithm for Constructing Small Dominating Sets. With L. Jia and R. Rajaraman. Distributed Computing 14, 2002, pp. 193-205. (Note: an earlier version appeared at the 20th ACM Symposium on Principles of Distributed Computing (PODC), August 2001. PDF)

    • Compact Grid Layouts of some Multi-Level Networks. With S. Muthukrishnan, M. Paterson, and S. Sahinalp. 31st ACM Symposium on the Theory of Computing (STOC '99), May 1999, pp. 455-463. Postscript PDF

    • On Randomization versus Determinism in Parallel Sorting and Routing Problems. 3rd Workshop on Randomized Parallel Computing, Springer LNCS 1388, April 1998, Postscript PDF

    • Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. With M. Kaufmann and J. F. Sibeyn. 3rd European Symposium on Algorithms (ESA '95), September 1995, pp. 75-88. Postscript PDF

    • On Probabilistic Networks for Selection, Merging, and Sorting. With F. T. Leighton and Y. Ma. Theory of Computing Systems 30, 1998, pp. 559-582.

      An earlier version of this paper appeared at the 7th ACM Symposium on Parallel Algorithms and Architectures (SPAA '95), June 1995, pp. 1-12. Postscript PDF

    • Lower Bounds for Sorting Networks. With N. Kahale, F. T. Leighton, Y. Ma, C. G. Plaxton, and E. Szemeredi. 27th ACM Symposium on the Theory of Computing (STOC '95), May 1995, pp. 437-446. Postscript PDF

    • Efficient Communication Using Total-Exchange. With S. B. Rao, T. Tsantilas, and M. Goudreau. 9th International Parallel Processing Symposium (IPPS '95), April 1995, pp. 544-550. Postscript PDF

    • Routing and Sorting on Fixed Topologies. Ph.D. thesis. Appeared as technical report TR-94-29, Department of Computer Science, University of Texas at Austin, December 1994. Postscript PDF

    • A Super-Logarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks. With C. G. Plaxton. Theory of Computing Systems 33, 2000, pp. 233-254. Postscript PDF

      An earlier version of this paper appeared at the 21st International Colloquium on Automata, Languages, and Programming (ICALP '94), July 1994, pp. 618-629. Postscript PDF

    • Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes. 6th ACM Symposium on Parallel Algorithms and Architectures (SPAA '94), June 1994, pp. 26-35. Postscript PDF

    • Permutation Routing and Sorting on Meshes with Row and Column Buses. Parallel Processing Letters 5(1), 1995, pp. 63-80 (Special Issue on Dynamically Reconfigurable Architectures). Postscript PDF

      An earlier version of this paper appeared at the 8th International Parallel Processing Symposium (IPPS '94), April 1994, pp. 411-417. Postscript PDF

    • Derandomizing Algorithms for Routing and Sorting on Meshes. With M. Kaufmann and J. F. Sibeyn. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA '94), January 1994, pp. 669-679. Postscript PDF

    • Optimal Deterministic Routing and Sorting on Mesh-Connected Arrays of Processors. Technical Report TR-93-18, Department of Computer Sciences, University of Texas at Austin, September 1993. Postscript PDF

    • Lower Bounds for Shellsort. With C. G. Plaxton. Journal of Algorithms 23, 1997, pp. 221-240. Postscript PDF

      An earlier version of this paper (with G. Plaxton and B. Poonen) appeared at the 33rd IEEE Symposium on Foundations of Computer Science (FOCS '92), October 1992, pp. 226-235.

    • A Lower Bound for Sorting Networks Based on the Shuffle Permutation. With C. G. Plaxton. Mathematical Systems Theory 27, 1994, pp. 491-508. Postscript PDF

      An earlier version of this paper appeared at the 4th ACM Symposium on Parallel Algorithms and Architectures (SPAA '92), June 1992, pp. 70-79.

    line separator

    Sequential Algorithms:

    • Approximate Maximum Weighted Branchings. With A. Bagchi and A. Bhargava. Information Processing Letters, 99(2), 2006. PDF (preliminary version)

    • Approximation Algorithms for Array Partitioning Problems. With S. Muthukrishnan. Journal of Algorithms 54, 2005, pp. 85-104. PDF

    • Inferring Tree Topologies Using Flow Tests. With S. Muthukrishnan and R. Vingralek. SIAM Symposium on Discrete Algorithms (SODA), January 2003 (short paper). PDF

    • Compressing the Graph Structure of the Web. With J. Yuan. IEEE Data Compression Conference (DCC 2001), March 2001. Postscript PDF

    • On Rectangular Partitionings of Two-Dimensional Data: Algorithms, Complexity. and Applications. With S. Muthukrishnan and V. Poosala. 7th International Conference on Database Theory (ICDT '99), January 1999, pp. 236-256. Postscript PDF (Note: an updated and extended version of the results on p-by-p partitionings appears in the April 2003 paper listed above)

    • Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. With S. Muthukrishnan. 2nd Workshop on Randomization and Approximation Techniques in CS (RANDOM '98), October 1998, pp. 369-383. Postscript PDF

    • Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems. With L. Arge, O. Procopiuc, S. Ramaswamy, and J. Vitter. 9th Symposium on Discrete Algorithms (SODA '98), January 1998, pp. 685-604. Postscript PDF

    • Lower Bounds for Shellsort. With C. G. Plaxton. Journal of Algorithms 23, 1997, pp. 221-240. Postscript PDF

      An earlier version of this paper (with G. Plaxton and B. Poonen) appeared as Improved Lower Bounds for Shellsort at the 33rd IEEE Symposium on Foundations of Computer Science (FOCS '92), October 1992, pp. 226-235.

    line separator

    Other Work:

    • On the State-Change Complexity of Cellular Automata (In German). Thesis (Diplomarbeit), Technical University of Braunschweig, Braunschweig, Germany, August 1990. Part 1 Part 2 Part 3 Part 4 Part 5 Part 6 (Total ~ 40 MB)

    • MOPS: A System for the Computer-Aided Verification of Programs Written in a Sublanguage of Modula-2 (in German). With J. Merker. Institute for Programming Languages and Information Systems, Technical University of Braunschweig, Braunschweig, Germany, November 1989.

    Back to my home page