Παρακολούθηση
Thomas Sauerwald
Thomas Sauerwald
University Lecturer in Computer Science, University of Cambridge
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cl.cam.ac.uk - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Stabilizing consensus with the power of two choices
B Doerr, LA Goldberg, L Minder, T Sauerwald, C Scheideler
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
1362011
Tight bounds for the cover time of multiple random walks
R Elsässer, T Sauerwald
Theoretical Computer Science 412 (24), 2623-2641, 2011
1082011
Counting arbitrary subgraphs in data streams
DM Kane, K Mehlhorn, T Sauerwald, H Sun
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
1002012
Ultra-fast rumor spreading in social networks
N Fountoulakis, K Panagiotou, T Sauerwald
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
982012
Quasirandom rumor spreading
B Doerr, T Friedrich, T Sauerwald
arXiv preprint arXiv:1012.5351, 2010
982010
Quasirandom rumor spreading: Expanders, push vs. pull, and robustness
B Doerr, T Friedrich, T Sauerwald
International Colloquium on Automata, Languages, and Programming, 366-377, 2009
772009
A new diffusion-based multilevel algorithm for computing graph partitions
H Meyerhenke, B Monien, T Sauerwald
Journal of Parallel and Distributed Computing 69 (9), 750-761, 2009
752009
A new diffusion-based multilevel algorithm for computing graph partitions of very high quality
H Meyerhenke, B Monien, T Sauerwald
2008 IEEE International Symposium on Parallel and Distributed Processing, 1-13, 2008
712008
Tight bounds for randomized load balancing on arbitrary network topologies
T Sauerwald, H Sun
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 341-350, 2012
672012
Rumor spreading and vertex expansion
G Giakkoupis, T Sauerwald
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
652012
On coalescence time in graphs: When is coalescing as fast as meeting?
V Kanade, F Mallmann-Trenn, T Sauerwald
ACM Transactions on Algorithms 19 (2), 1-46, 2023
632023
Quasirandom load balancing
T Friedrich, M Gairing, T Sauerwald
SIAM Journal on Computing 41 (4), 747-771, 2012
602012
On the runtime and robustness of randomized broadcasting
R Elsässer, T Sauerwald
Theoretical Computer Science 410 (36), 3414-3427, 2009
582009
HIT'nDRIVE: patient-specific multidriver gene prioritization for precision oncology
R Shrestha, E Hodzic, T Sauerwald, P Dao, K Wang, J Yeung, ...
Genome research 27 (9), 1573-1588, 2017
512017
Rumor spreading and vertex expansion on regular graphs
T Sauerwald, A Stauffer
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
512011
The cover time of deterministic random walks
T Friedrich, T Sauerwald
International Computing and Combinatorics Conference, 130-139, 2010
482010
The power of memory in randomized broadcasting
R Elsässer, T Sauerwald
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
482008
Diameter and broadcast time of random geometric graphs in arbitrary dimensions
T Friedrich, T Sauerwald, A Stauffer
Algorithmica 67, 65-88, 2013
472013
Broadcasting vs. mixing and information dissemination on Cayley graphs
R Elsässer, T Sauerwald
Annual Symposium on Theoretical Aspects of Computer Science, 163-174, 2007
472007
Near-perfect load balancing by randomized rounding
T Friedrich, T Sauerwald
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
442009
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20