Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Suel, Torsten"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate maximum weight branchings
Amitabha Bagchi
,
Ankur Bhargava
,
Torsten Suel
Information Processing Letters
99
(2), 2006, pp. 54-58
Approximation algorithms for array partitioning problems
S. Muthukrishnan
,
Torsten Suel
Journal of Algorithms
54
(1), 2005, pp. 85-104
Compact grid layouts of multi-level networks
S. Muthukrishnan
,
Mike Paterson
,
Süleyman Cenk Ṣahinalp
,
Torsten Suel
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 455-463
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Lars Arge
,
Octavian Procopiuc
,
Sridhar Ramaswamy
,
Torsten Suel
,
Jeffrey Scott Vitter
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 685-694
BSPlib: The BSP programming library
Jonathan M.D. Hill
,
Bill McColl
,
Dan C. Stefanescu
,
Mark W. Goudreau
,
Kevin Lang
,
Satish B. Rao
,
Torsten Suel
,
Thanasis Tsantilas
,
Rob H. Bisseling
Parallel Computing
24
(14), 1998, pp. 1947-1980
Second-order methods for distributed approximate single- and multicommodity flow
S. Muthukrishnan
,
Torsten Suel
Lecture Notes in Computer Science
1518
, 1998, pp. 367-383
On randomized and deterministic schemes for routing and sorting on fixed-connection networks
Torsten Suel
Lecture Notes in Computer Science
1388
, 1998, pp. 384-386
Lower bounds for Shellsort
C. Greg Plaxton
,
Torsten Suel
Journal of Algorithms
23
(2), 1997, pp. 221-240
Towards efficiency and portability: Programming with the PSP model
Mark Goudreau
,
Kevin Lang
,
Satish Rao
,
Torsten Suel
,
Thanasis Tsantilas
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'96 (Padua, Italy, June 24-26, 1996)
, 1996, pp. 1-12
Lower bounds for sorting networks
Nabil Kahale
,
Tom Leighton
,
Yuan Ma
,
C. Greg Plaxton
,
Torsten Suel
,
Endre Szemerédi
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 437-446
Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
Michael Kaufmann
,
Jop F. Sibeyn
,
Torsten Suel
Lecture Notes in Computer Science
979
, 1995, pp. 75-88
On probabilistic networks for selection, merging, and sorting
Tom Leighton
,
Yuan Ma
,
Torsten Suel
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95 (Santa Barbara, California, July 17-19, 1995)
, 1995, pp. 106-118
Permutation routing and sorting on meshes with row and column buses
Torsten Suel
Parallel Processing Letters
5
(1), 1995, pp. 63-80
Derandomizing algorithms for routing and sorting meshes
Michael Kaufmann
,
Jop F. Sibeyn
,
Torsten Suel
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 669-679
A super-logarithmic lower bound for hypercubic sorting networks
C. Greg Plaxton
,
Torsten Suel
Lecture Notes in Computer Science
820
, 1994, pp. 618-629
Improved bounds for routing and sorting on multi-dimensional meshes
Torsten Suel
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'94 (Cape May, New Jersey, June 27-29, 1994)
, 1994, pp. 26-35
Routing and sorting on meshes with row and column buses
Torsten Suel
Proceedings of the 8th International Parallel Processing Symposium, IPPS'94 (Cancún, Mexico, April 26-29, 1994)
, 1994, pp. 411-417
Routing and sorting on fixed topologies
Torsten Suel
Technical Report (TR94-29), 1994, December
Improved lower bounds for Shellsort
C. Greg Plaxton
,
Bjorn Poonen
,
Torsten Suel
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 226-235
A lower bound for sorting networks based on the shuffle permutation
C. Greg Plaxton
,
Torsten Suel
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'92 (San Diego, California, June 29 - July 1, 1992)
, 1992, pp. 70-79
A lower bound for sorting networks based on the shuffle permutation
C. Greg Plaxton
,
Torsten Suel
misc, 1991, November