Torsten Suel

Orcid: 0000-0002-8324-980X

Affiliations:
  • New York University Tandon School of Engineering, New York City, USA


According to our database1, Torsten Suel authored at least 108 papers between 1992 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Using Conjunctions for Faster Disjunctive Top-k Queries.
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

Faster Learned Sparse Retrieval with Guided Traversal.
Proceedings of the SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, Madrid, Spain, July 11, 2022

2021
Report on the 44th international ACM SIGIR conference on research and development in information retrieval (SIGIR 2021).
SIGIR Forum, 2021

Fast Disjunctive Candidate Generation Using Live Block Filtering.
Proceedings of the WSDM '21, 2021

Learning Passage Impacts for Inverted Indexes.
Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

Optimizing Iterative Algorithms for Social Network Sharding.
Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

2020
To index or not to index: Time-space trade-offs for positional ranking functions in search engines.
Inf. Syst., 2020

A Comparison of Top-k Threshold Estimation Techniques for Disjunctive Query Processing.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

Feature Extraction for Large-Scale Text Collections.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Delta Compression Techniques.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Document Reordering for Faster Intersection.
Proc. VLDB Endow., 2019

PISA: Performant Indexes and Search for Academia.
Proceedings of the Open-Source IR Replicability Challenge co-located with 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019

Exploiting Global Impact Ordering for Higher Throughput in Selective Search.
Proceedings of the Advances in Information Retrieval, 2019

An Experimental Study of Index Compression and DAAT Query Processing Methods.
Proceedings of the Advances in Information Retrieval, 2019

Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study.
Proceedings of the Advances in Information Retrieval, 2019

GPU-Accelerated Decoding of Integer Lists.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

Forward Index Compression for Instance Retrieval in an Augmented Reality Application.
Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018
Geo-Targeted Web Search.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Fast Bag-Of-Words Candidate Selection in Content-Based Instance Retrieval Systems.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

Exploring Size-Speed Trade-Offs in Static Index Pruning.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

2016
Fast First-Phase Candidate Generation for Cascading Rankers.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Structural Sentence Similarity Estimation for Short Texts.
Proceedings of the Twenty-Ninth International Florida Artificial Intelligence Research Society Conference, 2016

Three-hop distance estimation in social graphs.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

Efficient index updates for mixed update and query loads.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

What makes a group fail: Modeling social group behavior in event-based social networks.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

Improved methods for static index pruning.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

2014
A robust model for paper reviewer assignment.
Proceedings of the Eighth ACM Conference on Recommender Systems, 2014

Estimating pairwise distances in large graphs.
Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013
Optimizing top-k document retrieval strategies for block-max indexes.
Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Automated decision support for human tasks in a collaborative system: the case of deletion in Wikipedia.
Proceedings of the 9th International Symposium on Open Collaboration, Hong Kong, China, August 05, 2013

A candidate filtering mechanism for fast top-k query processing on modern cpus.
Proceedings of the 36th International ACM SIGIR conference on research and development in Information Retrieval, 2013

2012
Optimizing positional index structures for versioned document collections.
Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

To index or not to index: time-space trade-offs in search engines with positional ranking functions.
Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

2011
Batch query processing for web search engines.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Faster temporal range queries over versioned text.
Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

Faster top-k document retrieval using block-max indexes.
Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

Text vs. space: efficient geo-search query processing.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010
Guest Editors' Introduction: Social Computing in the Blogosphere.
IEEE Internet Comput., 2010

Scalable techniques for document identifier assignment ininverted indexes.
Proceedings of the 19th International Conference on World Wide Web, 2010

Efficient term proximity search with term-pair indexes.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

Improved index compression techniques for versioned document collections.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Geo-Targeted Web Search.
Proceedings of the Encyclopedia of Database Systems, 2009

Inverted index compression and query processing with optimized document ordering.
Proceedings of the 18th International Conference on World Wide Web, 2009

Improved techniques for result caching in web search engines.
Proceedings of the 18th International Conference on World Wide Web, 2009

Using graphics processors for high performance IR query processing.
Proceedings of the 18th International Conference on World Wide Web, 2009

Top-<i>k</i> aggregation using intersections of ranked inputs.
Proceedings of the Second International Conference on Web Search and Web Data Mining, 2009

Compressing term positions in web indexes.
Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2009

Modeling and predicting user behavior in sponsored search.
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

Compact full-text indexing of versioned document collections.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008
Performance of compressed inverted list caching in search engines.
Proceedings of the 17th International Conference on World Wide Web, 2008

Analysis of geographic queries in a search engine log.
Proceedings of the First International Workshop on Location and the Web, 2008

Geographic web usage estimation by monitoring DNS caches.
Proceedings of the First International Workshop on Location and the Web, 2008

Algorithms for Low-Latency Remote File Synchronization.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Search engine architectures from conventional to Brian Ulicny and Ken Baclawski. New metrics for newsblog.
Proceedings of the Proceeding of the 2008 ACM Workshop on Large-Scale Distributed Systems for Information Retrieval, 2008

Cleaning search results using term distance features.
Proceedings of the AIRWeb 2008, 2008

2007
Efficient search in large textual collections with redundancy.
Proceedings of the 16th International Conference on World Wide Web, 2007

Optimized Inverted List Assignment in Distributed Search Engine Architectures.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Improving Web Spam Classifiers Using Link Structure (S).
Proceedings of the AIRWeb 2007, 2007

2006
Three-Level Caching for Efficient Query Processing in Large Web Search Engines.
World Wide Web, 2006

Approximate maximum weight branchings.
Inf. Process. Lett., 2006

Interactive wrapper generation with minimal user effort.
Proceedings of the 15th international conference on World Wide Web, 2006

Efficient query subscription processing for prospective search engines.
Proceedings of the 15th international conference on World Wide Web, 2006

Efficient query processing in geographic web search engines.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006

2005
The Perron-Frobenius theorem: some of its applications.
IEEE Signal Process. Mag., 2005

Approximation algorithms for array partitioning problems.
J. Algorithms, 2005

Hierarchical substring caching for efficient content distribution to low-bandwidth clients.
Proceedings of the 14th international conference on World Wide Web, 2005

Design and Implementation of a Geographic Search Engine.
Proceedings of the Eight International Workshop on the Web & Databases (WebDB 2005), 2005

Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment.
Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (P2P 2005), 31 August, 2005

Improved single-round protocols for remote file synchronization.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Optimal peer selection for P2P downloading and streaming.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004
Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks.
Proceedings of the 20th International Conference on Data Engineering, 2004

Local methods for estimating pagerank values.
Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, 2004

2003
ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval.
Proceedings of the Twelfth International World Wide Web Conference - Posters, 2003

Server-Friendly Delta Compression for Efficient Web Access.
Proceedings of the Web Content Caching and Distribution, 8th International Workshop, 2003

Optimized Query Execution in Large Search Engines with Global Page Ordering.
Proceedings of 29th International Conference on Very Large Data Bases, 2003

Inferring tree topologies using flow tests.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

On the scalability of an image transcoding proxy server.
Proceedings of the 2003 International Conference on Image Processing, 2003

2002
An efficient distributed algorithm for constructing small dominating sets.
Distributed Comput., 2002

Cluster-Based Delta Compression of a Collection of Files.
Proceedings of the 3rd International Conference on Web Information Systems Engineering, 2002

Design and Implementation of a High-Performance Distributed Web Crawler.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

I/O-efficient techniques for computing pagerank.
Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, 2002

2001
Compressing the Graph Structure of the Web.
Proceedings of the Data Compression Conference, 2001

Delta Encoding of Related Web Pages.
Proceedings of the Data Compression Conference, 2001

2000
A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks.
Theory Comput. Syst., 2000

A Unified Approach for Indexed and Non-Indexed Spatial Joins.
Proceedings of the Advances in Database Technology, 2000

1999
Portable and Efficient Parallel Computing Using the BSP Model.
IEEE Trans. Computers, 1999

Compact Grid Layouts of Multi-Level Networks.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications.
Proceedings of the Database Theory, 1999

1998
BSPlib: The BSP programming library.
Parallel Comput., 1998

Optimal Histograms with Quality Guarantees.
Proceedings of the VLDB'98, 1998

Scalable Sweeping-Based Spatial Join.
Proceedings of the VLDB'98, 1998

Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1997
On Probabilistic Networks for Selection, Merging, and Sorting.
Theory Comput. Syst., 1997

Lower Bounds for Shellsort.
J. Algorithms, 1997

Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods.
Proceedings of the ACM/IEEE Conference on Supercomputing, 1997

1996
Towards Efficiency and Portability: Programming with the BSP Model.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

1995
Permutation Routing and Sorting on Meshes with Row and Column Buses.
Parallel Process. Lett., 1995

Lower bounds for sorting networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Efficient communication using total-exchange.
Proceedings of IPPS '95, 1995

Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.
Proceedings of the Algorithms, 1995

1994
A Lower Bound for Sorting Networks Based on the Shuffle Permutation.
Math. Syst. Theory, 1994

Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes.
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Derandomizing Algorithms for Routing and Sorting on Meshes.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Routing and Sorting on Meshes with Row and Column Buses.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1992
Improved Lower Bounds for Shellsort
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992


  Loading...