 |
|
Online DBLP entries are available for Torsten Suel and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
S. Muthukrishnan
,
Viswanath Poosala
,
Torsten Suel:
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications.
ICDT 1999
: 236-256
-
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
-
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 of Computing Systems 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
-
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
-
C. Greg Plaxton
,
Torsten Suel:
A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks.
ICALP 1994
: 618-629
-
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
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
