| 2009 |
|---|
| 66 | EE | Ravi Kumar,
Kunal Punera,
Torsten Suel,
Sergei Vassilvitskii:
Top-k aggregation using intersections of ranked inputs.
WSDM 2009: 222-231 |
| 65 | EE | Hao Yan,
Shuai Ding,
Torsten Suel:
Inverted index compression and query processing with optimized document ordering.
WWW 2009: 401-410 |
| 64 | EE | Shuai Ding,
Jinru He,
Hao Yan,
Torsten Suel:
Using graphics processors for high performance IR query processing.
WWW 2009: 421-430 |
| 63 | EE | Qingqing Gan,
Torsten Suel:
Improved techniques for result caching in web search engines.
WWW 2009: 431-440 |
| 2008 |
|---|
| 62 | EE | Josh Attenberg,
Torsten Suel:
Cleaning search results using term distance features.
AIRWeb 2008: 21-24 |
| 61 | EE | Hao Yan,
Utku Irmak,
Torsten Suel:
Algorithms for Low-Latency Remote File Synchronization.
INFOCOM 2008: 156-160 |
| 60 | EE | Torsten Suel:
Search engine architectures from conventional to Brian Ulicny and Ken Baclawski. New metrics for newsblog.
LSDS-IR 2008: 1-2 |
| 59 | EE | Qingqing Gan,
Josh Attenberg,
Alexander Markowetz,
Torsten Suel:
Analysis of geographic queries in a search engine log.
LocWeb 2008: 49-56 |
| 58 | EE | Hüseyin Akcan,
Torsten Suel,
Hervé Brönnimann:
Geographic web usage estimation by monitoring DNS caches.
LocWeb 2008: 85-92 |
| 57 | EE | Shuai Ding,
Jinru He,
Hao Yan,
Torsten Suel:
Using graphics processors for high-performance IR query processing.
WWW 2008: 1213-1214 |
| 56 | EE | Jiangong Zhang,
Xiaohui Long,
Torsten Suel:
Performance of compressed inverted list caching in search engines.
WWW 2008: 387-396 |
| 2007 |
|---|
| 55 | EE | Qingqing Gan,
Torsten Suel:
Improving Web Spam Classifiers Using Link Structure (S).
AIRWeb 2007 |
| 54 | EE | Jiangong Zhang,
Torsten Suel:
Optimized Inverted List Assignment in Distributed Search Engine Architectures.
IPDPS 2007: 1-10 |
| 53 | EE | Jiangong Zhang,
Torsten Suel:
Efficient search in large textual collections with redundancy.
WWW 2007: 411-420 |
| 2006 |
|---|
| 52 | EE | Yen-Yu Chen,
Torsten Suel,
Alexander Markowetz:
Efficient query processing in geographic web search engines.
SIGMOD Conference 2006: 277-288 |
| 51 | EE | Utku Irmak,
Svilen Mihaylov,
Torsten Suel,
Samrat Ganguly,
Rauf Izmailov:
Efficient Query Subscription Processing for Prospective Search Engines.
USENIX Annual Technical Conference, General Track 2006: 375-380 |
| 50 | EE | Utku Irmak,
Svilen Mihaylov,
Torsten Suel,
Samrat Ganguly,
Rauf Izmailov:
Efficient query subscription processing for prospective search engines.
WWW 2006: 1037-1038 |
| 49 | EE | Utku Irmak,
Torsten Suel:
Interactive wrapper generation with minimal user effort.
WWW 2006: 553-563 |
| 48 | EE | Amitabha Bagchi,
Ankur Bhargava,
Torsten Suel:
Approximate maximum weight branchings.
Inf. Process. Lett. 99(2): 54-58 (2006) |
| 47 | EE | Xiaohui Long,
Torsten Suel:
Three-Level Caching for Efficient Query Processing in Large Web Search Engines.
World Wide Web 9(4): 369-395 (2006) |
| 2005 |
|---|
| 46 | EE | Micah Adler,
Rakesh Kumar,
Keith W. Ross,
Dan Rubenstein,
Torsten Suel,
David D. Yao:
Optimal peer selection for P2P downloading and streaming.
INFOCOM 2005: 1538-1549 |
| 45 | EE | Utku Irmak,
Svilen Mihaylov,
Torsten Suel:
Improved single-round protocols for remote file synchronization.
INFOCOM 2005: 1665-1676 |
| 44 | EE | Jiangong Zhang,
Torsten Suel:
Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment.
Peer-to-Peer Computing 2005: 225-233 |
| 43 | EE | Xiaohui Long,
Torsten Suel:
Three-level caching for efficient query processing in large Web search engines.
WWW 2005: 257-266 |
| 42 | EE | Utku Irmak,
Torsten Suel:
Hierarchical substring caching for efficient content distribution to low-bandwidth clients.
WWW 2005: 43-53 |
| 41 | | Alexander Markowetz,
Yen-Yu Chen,
Torsten Suel,
Xiaohui Long,
Bernhard Seeger:
Design and Implementation of a Geographic Search Engine.
WebDB 2005: 19-24 |
| 40 | EE | S. Muthukrishnan,
Torsten Suel:
Approximation algorithms for array partitioning problems.
J. Algorithms 54(1): 85-104 (2005) |
| 2004 |
|---|
| 39 | EE | Yen-Yu Chen,
Qingqing Gan,
Torsten Suel:
Local methods for estimating pagerank values.
CIKM 2004: 381-389 |
| 38 | EE | Torsten Suel,
Patrick Noel,
Dimitre Trendafilov:
Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks.
ICDE 2004: 153-164 |
| 2003 |
|---|
| 37 | | Anubhav Savant,
Nasir D. Memon,
Torsten Suel:
On the scalability of an image transcoding proxy server.
ICIP (1) 2003: 209-212 |
| 36 | EE | S. Muthukrishnan,
Torsten Suel,
Radek Vingralek:
Inferring tree topologies using flow tests.
SODA 2003: 828-829 |
| 35 | EE | Xiaohui Long,
Torsten Suel:
Optimized Query Execution in Large Search Engines with Global Page Ordering.
VLDB 2003: 129-140 |
| 34 | EE | Torsten Suel,
Chandan Mathur,
Jo-wen Wu,
Jiangong Zhang,
Alex Delis,
Mehdi Kharrazi,
Xiaohui Long,
Kulesh Shanmugasundaram:
ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval.
WWW (Posters) 2003 |
| 33 | EE | Torsten Suel,
Chandan Mathur,
Jo-wen Wu,
Jiangong Zhang,
Alex Delis,
Mehdi Kharrazi,
Xiaohui Long,
Kulesh Shanmugasundaram:
ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval.
WebDB 2003: 67-72 |
| 2002 |
|---|
| 32 | EE | Yen-Yu Chen,
Qingqing Gan,
Torsten Suel:
I/O-efficient techniques for computing pagerank.
CIKM 2002: 549-557 |
| 31 | EE | Vladislav Shkapenyuk,
Torsten Suel:
Design and Implementation of a High-Performance Distributed Web Crawler.
ICDE 2002: 357-368 |
| 30 | EE | Zan Ouyang,
Nasir D. Memon,
Torsten Suel,
Dimitre Trendafilov:
Cluster-Based Delta Compression of a Collection of Files.
WISE 2002: 257-268 |
| 29 | EE | Lujun Jia,
Rajmohan Rajaraman,
Torsten Suel:
An efficient distributed algorithm for constructing small dominating sets.
Distributed Computing 15(4): 193-205 (2002) |
| 2001 |
|---|
| 28 | EE | Torsten Suel,
Jun Yuan:
Compressing the Graph Structure of the Web.
Data Compression Conference 2001: 213-222 |
| 27 | EE | Zan Ouyang,
Nasir D. Memon,
Torsten Suel:
Delta Encoding of Related Web Pages.
Data Compression Conference 2001: 507 |
| 2000 |
|---|
| 26 | EE | Lars Arge,
Octavian Procopiuc,
Sridhar Ramaswamy,
Torsten Suel,
Jan Vahrenhold,
Jeffrey Scott Vitter:
A Unified Approach for Indexed and Non-Indexed Spatial Joins.
EDBT 2000: 413-429 |
| 25 | EE | C. Greg Plaxton,
Torsten Suel:
A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks.
Theory Comput. Syst. 33(3): 233-254 (2000) |
| 1999 |
|---|
| 24 | EE | S. Muthukrishnan,
Viswanath Poosala,
Torsten Suel:
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications.
ICDT 1999: 236-256 |
| 23 | EE | S. Muthukrishnan,
Mike Paterson,
Süleyman Cenk Sahinalp,
Torsten Suel:
Compact Grid Layouts of Multi-Level Networks.
STOC 1999: 455-463 |
| 22 | | Mark W. Goudreau,
Kevin Lang,
Satish Rao,
Torsten Suel,
Thanasis Tsantilas:
Portable and Efficient Parallel Computing Using the BSP Model.
IEEE Trans. Computers 48(7): 670-689 (1999) |
| 1998 |
|---|
| 21 | | Torsten Suel:
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks.
IPPS/SPDP Workshops 1998: 384-386 |
| 20 | EE | S. Muthukrishnan,
Torsten Suel:
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.
RANDOM 1998: 369-384 |
| 19 | | Lars Arge,
Octavian Procopiuc,
Sridhar Ramaswamy,
Torsten Suel,
Jeffrey Scott Vitter:
Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract).
SODA 1998: 685-694 |
| 18 | EE | H. V. Jagadish,
Nick Koudas,
S. Muthukrishnan,
Viswanath Poosala,
Kenneth C. Sevcik,
Torsten Suel:
Optimal Histograms with Quality Guarantees.
VLDB 1998: 275-286 |
| 17 | EE | Lars Arge,
Octavian Procopiuc,
Sridhar Ramaswamy,
Torsten Suel,
Jeffrey Scott Vitter:
Scalable Sweeping-Based Spatial Join.
VLDB 1998: 570-581 |
| 16 | EE | Jonathan M. D. Hill,
Bill McColl,
Dan C. Stefanescu,
Mark W. Goudreau,
Kevin Lang,
Satish Rao,
Torsten Suel,
Thanasis Tsantilas,
Rob H. Bisseling:
BSPlib: The BSP programming library.
Parallel Computing 24(14): 1947-1980 (1998) |
| 1997 |
|---|
| 15 | | C. Greg Plaxton,
Torsten Suel:
Lower Bounds for Shellsort.
J. Algorithms 23(2): 221-240 (1997) |
| 14 | | Frank Thomson Leighton,
Yuan Ma,
Torsten Suel:
On Probabilistic Networks for Selection, Merging, and Sorting.
Theory Comput. Syst. 30(6): 559-582 (1997) |
| 1996 |
|---|
| 13 | | Mark W. Goudreau,
Kevin Lang,
Satish Rao,
Torsten Suel,
Thanasis Tsantilas:
Towards Efficiency and Portability: Programming with the BSP Model.
SPAA 1996: 1-12 |
| 1995 |
|---|
| 12 | | Michael Kaufmann,
Jop F. Sibeyn,
Torsten Suel:
Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.
ESA 1995: 75-88 |
| 11 | EE | Satish Rao,
Torsten Suel,
Thanasis Tsantilas,
Mark W. Goudreau:
Efficient communication using total-exchange.
IPPS 1995: 544-550 |
| 10 | EE | Frank Thomson Leighton,
Yuan Ma,
Torsten Suel:
On Probabilistic Networks for Selection, Merging, and Sorting.
SPAA 1995: 106-118 |
| 9 | EE | Nabil Kahale,
Frank Thomson Leighton,
Yuan Ma,
C. Greg Plaxton,
Torsten Suel,
Endre Szemerédi:
Lower bounds for sorting networks.
STOC 1995: 437-446 |
| 8 | | Torsten Suel:
Permutation Routing and Sorting on Meshes with Row and Column Buses.
Parallel Processing Letters 5: 63-80 (1995) |
| 1994 |
|---|
| 7 | | C. Greg Plaxton,
Torsten Suel:
A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks.
ICALP 1994: 618-629 |
| 6 | | Torsten Suel:
Routing and Sorting on Meshes with Row and Column Buses.
IPPS 1994: 411-417 |
| 5 | | Michael Kaufmann,
Jop F. Sibeyn,
Torsten Suel:
Derandomizing Algorithms for Routing and Sorting on Meshes.
SODA 1994: 669-679 |
| 4 | EE | Torsten Suel:
Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes.
SPAA 1994: 26-35 |
| 3 | | C. Greg Plaxton,
Torsten Suel:
A Lower Bound for Sorting Networks Based on the Shuffle Permutation.
Mathematical Systems Theory 27(5): 491-508 (1994) |
| 1992 |
|---|
| 2 | | C. Greg Plaxton,
Bjorn Poonen,
Torsten Suel:
Improved Lower Bounds for Shellsort
FOCS 1992: 226-235 |
| 1 | EE | C. Greg Plaxton,
Torsten Suel:
A Lower Bound for Sorting Networks Based on the Shuffle Permutation.
SPAA 1992: 70-79 |
