Follow
Alexander Noe
Alexander Noe
Verified email at univie.ac.at
Title
Cited by
Cited by
Year
Thrill: High-performance algorithmic distributed batch data processing with C++
T Bingmann, M Axtmann, E J÷bstl, S Lamm, HC Nguyen, A Noe, S Schlag, ...
Big Data (Big Data), 2016 IEEE International Conference on, 172-183, 2016
582016
Practical minimum cut algorithms
M Henzinger, A Noe, C Schulz, D Strash
Journal of Experimental Algorithmics (JEA) 23, 1-22, 2018
232018
Algorithms for mapping parallel processes onto grid and torus architectures
R Glantz, H Meyerhenke, A Noe
2015 23rd Euromicro International Conference on Parallel, Distributed, andá…, 2015
202015
Shared-memory exact minimum cuts
M Henzinger, A Noe, C Schulz
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPSá…, 2019
102019
ILP-based Local Search for Graph Partitioning
A Noe, A Henzinger, C Schulz
Journal of Experimental Algorithmics (JEA), 2020
8*2020
Shared-memory branch-and-reduce for multiterminal cuts
M Henzinger, A Noe, C Schulz
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering andá…, 2020
62020
Finding all global minimum cuts in practice
M Henzinger, A Noe, C Schulz, D Strash
arXiv preprint arXiv:2002.06948, 2020
52020
Faster Parallel Multiterminal Cuts
M Henzinger, A Noe, C Schulz
SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21á…, 2021
32021
Recent advances in practical data reduction
F Abu-Khzam, S Lamm, M Mnich, A Noe, C Schulz, D Strash
arXiv preprint arXiv:2012.12594, 2020
22020
New instances for maximum weight independent set from a vehicle routing application
Y Dong, AV Goldberg, A Noe, N Parotsidis, MGC Resende, Q Spaen
Operations Research Forum 2 (4), 1-6, 2021
12021
Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice?
M Henzinger, A Noe
arXiv preprint arXiv:2108.04564, 2021
12021
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems
Y Dong, AV Goldberg, A Noe, N Parotsidis, MGC Resende, Q Spaen
arXiv preprint arXiv:2203.15805, 2022
2022
Practical Fully Dynamic Minimum Cut Algorithms∗
M Henzinger, A Noe, C Schulz
2022 Proceedings of the Symposium on Algorithm Engineering and Experimentsá…, 2022
2022
Algorithm Engineering for Cut Problems
A Noe
arXiv preprint arXiv:2108.04566, 2021
2021
Bloom Filters for ReduceBy, GroupBy and Join in Thrill
A Noe, T Bingmann
Karlsruher Institut fŘr Technologie (KIT), 2017
2017
IPDPS 2018 Outside Reviewers
Y Akhremtsev, E Angriman, B Archibald, CEA CÚdric Augonnet, ...
The system can't perform the operation now. Try again later.
Articles 1–16