Torsten Suel

MaRDI QIDQ845673zbMATH OpenDBLPWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Beyond the worst-case bisection bound: Fast sorting and ranking on meshes Lecture Notes in Computer Science	2023-05-08	Paper
An efficient distributed algorithm for constructing small dominating sets Distributed Computing	2020-12-03	Paper
A super-logarithmic lower bound for hypercubic sorting networks Automata, Languages and Programming	2019-04-29	Paper
Compact grid layouts of multi-level networks Proceedings of the thirty-first annual ACM symposium on Theory of Computing	2016-09-29	Paper
Approximate maximum weight branchings Information Processing Letters	2010-01-29	Paper
scientific article; zbMATH DE number 1256658 (Why is no real title available?)	2002-01-21	Paper
scientific article; zbMATH DE number 1263220 (Why is no real title available?)	2001-08-28	Paper
A superlogarithmic lower bound for shuffle-unshuffle sorting networks Theory of Computing Systems	2000-09-04	Paper
scientific article; zbMATH DE number 1303612 (Why is no real title available?)	2000-02-17	Paper
On probabilistic networks for selection, merging, and sorting Theory of Computing Systems	1998-08-03	Paper
scientific article; zbMATH DE number 1003300 (Why is no real title available?)	1997-10-05	Paper
Lower Bounds for Shellsort Journal of Algorithms	1997-06-04	Paper
A lower bound for sorting networks based on the shuffle permutation Mathematical Systems Theory	1994-10-30	Paper

Research outcomes over time

This page was built for person: Torsten Suel