| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. Torsten Suel 22 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 21 C. Greg Plaxton , Torsten Suel: A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks. Theory of Computing Systems 33 (3): 233-254 (2000) 20 S. Muthukrishnan , Viswanath Poosala , Torsten Suel: On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications. ICDT 1999 : 236-256 19 S. Muthukrishnan , Michael S. Paterson , Süleyman Cenk Sahinalp , Torsten Suel: Compact Grid Layouts of Multi-Level Networks. STOC 1999 : 455-463 18 Mark Goudreau , Kevin Lang , Satish B. Rao , Torsten Suel, Thanasis Tsantilas : Portable and Efficient Parallel Computing Using the BSP Model. IEEE Transactions on Computers 48 (7): 670-689 (1999) 17 Torsten Suel: On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks. IPPS/SPDP Workshops 1998 : 384-386 16 S. Muthukrishnan , Torsten Suel: Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. RANDOM 1998 : 369-384 15 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 14 H. V. Jagadish , Nick Koudas , S. Muthukrishnan , Viswanath Poosala , Kenneth C. Sevcik , Torsten Suel: Optimal Histograms with Quality Guarantees. VLDB 1998 : 275-286 13 Lars Arge , Octavian Procopiuc , Sridhar Ramaswamy , Torsten Suel, Jeffrey Scott Vitter : Scalable Sweeping-Based Spatial Join. VLDB 1998 : 570-581 12 C. Greg Plaxton , Torsten Suel: Lower Bounds for Shellsort. J. Algorithms 23 (2): 221-240 (1997) 11 Frank Thomson Leighton , Yuan Ma , Torsten Suel: On Probabilistic Networks for Selection, Merging, and Sorting. Theory of Computing Systems 30 (6): 559-582 (1997) 10 Mark Goudreau , Kevin Lang , Satish Rao , Torsten Suel, Thanasis Tsantilas : Towards Efficiency and Portability: Programming with the BSP Model. SPAA 1996 : 1-12 9 Michael Kaufmann , Jop F. Sibeyn , Torsten Suel: Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. ESA 1995 : 75-88 8 Frank Thomson Leighton , Yuan Ma , Torsten Suel: On Probabilistic Networks for Selection, Merging, and Sorting. SPAA 1995 : 106-118 7 Nabil Kahale , Frank Thomson Leighton , Yuan Ma , C. Greg Plaxton , Torsten Suel, Endre Szemerédi : Lower bounds for sorting networks. STOC 1995 : 437-446 6 C. Greg Plaxton , Torsten Suel: A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. ICALP 1994 : 618-629 5 Michael Kaufmann , Jop F. Sibeyn , Torsten Suel: Derandomizing Algorithms for Routing and Sorting on Meshes. SODA 1994 : 669-679 4 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) 2 C. Greg Plaxton , Bjorn Poonen , Torsten Suel: Improved Lower Bounds for Shellsort. FOCS 1992 : 226-235 1 C. Greg Plaxton , Torsten Suel: A Lower Bound for Sorting Networks Based on the Shuffle Permutation. SPAA 1992 : 70-79 DiSC'01 Copyright ©2002 ACM Inc. |
