| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Torsten Suel Xiaohui Long , Torsten Suel: Three-level caching for efficient query processing in large Web search engines. WWW 2005 : 257-266 Utku Irmak , Torsten Suel: Hierarchical substring caching for efficient content distribution to low-bandwidth clients. WWW 2005 : 43-53 Yen-Yu Chen , Qingqing Gan , Torsten Suel: Local methods for estimating pagerank values. CIKM 2004 : 381-389 Torsten Suel, Patrick Noel , Dimitre Trendafilov : Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks. ICDE 2004 : 153-164 Anubhav Savant , Nasir D. Memon , Torsten Suel: On the scalability of an image transcoding proxy server. ICIP (1) 2003 : 209-212 S. Muthukrishnan , Torsten Suel, Radek Vingralek : Inferring tree topologies using flow tests. SODA 2003 : 828-829 Xiaohui Long , Torsten Suel: Optimized Query Execution in Large Search Engines with Global Page Ordering. VLDB 2003 : 129-140 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 Yen-Yu Chen , Qingqing Gan , Torsten Suel: I/O-efficient techniques for computing pagerank. CIKM 2002 : 549-557 Vladislav Shkapenyuk , Torsten Suel: Design and Implementation of a High-Performance Distributed Web Crawler. ICDE 2002 : 357-368 Zan Ouyang , Nasir D. Memon , Torsten Suel, Dimitre Trendafilov : Cluster-Based Delta Compression of a Collection of Files. WISE 2002 : 257-268 Lujun Jia , Rajmohan Rajaraman , Torsten Suel: An efficient distributed algorithm for constructing small dominating sets. Distributed Computing 15 (4): 193-205 (2002) Torsten Suel, Jun Yuan : Compressing the Graph Structure of the Web. Data Compression Conference 2001 : 213-222 Zan Ouyang , Nasir D. Memon , Torsten Suel: Delta Encoding of Related Web Pages. Data Compression Conference 2001 : 507 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 C. Greg Plaxton , Torsten Suel: A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks. Theory Comput. Syst. 33 (3): 233-254 (2000) S. Muthukrishnan , Viswanath Poosala , Torsten Suel: On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications. ICDT 1999 : 236-256 S. Muthukrishnan , Mike Paterson , Süleyman Cenk Sahinalp , Torsten Suel: Compact Grid Layouts of Multi-Level Networks. STOC 1999 : 455-463 Mark 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) Torsten Suel: On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks. IPPS/SPDP Workshops 1998 : 384-386 S. Muthukrishnan , Torsten Suel: Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. RANDOM 1998 : 369-384 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 H. V. Jagadish , Nick Koudas , S. Muthukrishnan , Viswanath Poosala , Kenneth C. Sevcik , Torsten Suel: Optimal Histograms with Quality Guarantees. VLDB 1998 : 275-286 Lars Arge , Octavian Procopiuc , Sridhar Ramaswamy , Torsten Suel, Jeffrey Scott Vitter : Scalable Sweeping-Based Spatial Join. VLDB 1998 : 570-581 Jonathan M. D. 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 (14): 1947-1980 (1998) C. Greg Plaxton , Torsten Suel: Lower Bounds for Shellsort. J. Algorithms 23 (2): 221-240 (1997) Frank Thomson Leighton , Yuan Ma , Torsten Suel: On Probabilistic Networks for Selection, Merging, and Sorting. Theory Comput. Syst. 30 (6): 559-582 (1997) Mark Goudreau , Kevin Lang , Satish Rao , Torsten Suel, Thanasis Tsantilas : Towards Efficiency and Portability: Programming with the BSP Model. SPAA 1996 : 1-12 Michael Kaufmann , Jop F. Sibeyn , Torsten Suel: Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. ESA 1995 : 75-88 Satish Rao , Torsten Suel, Thanasis Tsantilas , Mark Goudreau : Efficient communication using total-exchange. IPPS 1995 : 544-550 Frank Thomson Leighton , Yuan Ma , Torsten Suel: On Probabilistic Networks for Selection, Merging, and Sorting. SPAA 1995 : 106-118 Nabil Kahale , Frank Thomson Leighton , Yuan Ma , C. Greg Plaxton , Torsten Suel, Endre Szemerédi : Lower bounds for sorting networks. STOC 1995 : 437-446 Torsten Suel: Permutation Routing and Sorting on Meshes with Row and Column Buses. Parallel Processing Letters 5 : 63-80 (1995) C. Greg Plaxton , Torsten Suel: A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. ICALP 1994 : 618-629 Torsten Suel: Routing and Sorting on Meshes with Row and Column Buses. IPPS 1994 : 411-417 Michael Kaufmann , Jop F. Sibeyn , Torsten Suel: Derandomizing Algorithms for Routing and Sorting on Meshes. SODA 1994 : 669-679 Torsten Suel: Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes. SPAA 1994 : 26-35 C. Greg Plaxton , Torsten Suel: A Lower Bound for Sorting Networks Based on the Shuffle Permutation. Mathematical Systems Theory 27 (5): 491-508 (1994) C. Greg Plaxton , Bjorn Poonen , Torsten Suel: Improved Lower Bounds for Shellsort FOCS 1992 : 226-235 C. Greg Plaxton , Torsten Suel: A Lower Bound for Sorting Networks Based on the Shuffle Permutation. SPAA 1992 : 70-79 1 [ 17 ] [ 19 ] [ 26 ] 2 [ 16 ] 3 [ 32 ] [ 38 ] 4 [ 33 ] 5 [ 32 ] [ 38 ] 6 [ 11 ] [ 13 ] [ 22 ] 7 [ 16 ] 8 [ 16 ] 9 [ 39 ] 10 [ 18 ] 11 [ 29 ] 12 [ 9 ] 13 [ 5 ] [ 12 ] 14 [ 33 ] 15 [ 18 ] 16 [ 13 ] [ 16 ] [ 22 ] 17 [ 9 ] [ 10 ] [ 14 ] 18 [ 33 ] [ 34 ] [ 40 ] 19 [ 9 ] [ 10 ] [ 14 ] 20 [ 33 ] 21 [ 16 ] 22 [ 27 ] [ 30 ] [ 36 ] 23 [ 18 ] [ 20 ] [ 23 ] [ 24 ] [ 35 ] 24 [ 37 ] 25 [ 27 ] [ 30 ] 26 [ 23 ] 27 [ 1 ] [ 2 ] [ 3 ] [ 7 ] [ 9 ] [ 15 ] [ 25 ] 28 [ 2 ] 29 [ 18 ] [ 24 ] 30 [ 17 ] [ 19 ] [ 26 ] 31 [ 29 ] 32 [ 17 ] [ 19 ] [ 26 ] 33 [ 11 ] [ 13 ] [ 22 ] 34 [ 16 ] 35 [ 23 ] 36 [ 36 ] 37 [ 18 ] 38 [ 33 ] 39 [ 31 ] 40 [ 5 ] [ 12 ] 41 [ 16 ] 42 [ 9 ] 43 [ 30 ] [ 37 ] 44 [ 11 ] [ 13 ] [ 16 ] [ 22 ] 45 [ 26 ] 46 [ 35 ] 47 [ 17 ] [ 19 ] [ 26 ] 48 [ 33 ] 49 [ 28 ] 50 [ 33 ]  ©2005 Association for Computing Machinery |
