| Challenges in QCD matter physics--The scientific programme of the Compressed Baryonic Matter experiment at FAIR T Ablyazimov, A Abuhoza, RP Adak, M Adamczyk, K Agarwal, ... The European Physical Journal A 53, 1-14, 2017 | 337 | 2017 |
| TRB3: a 264 channel high precision TDC platform and its applications A Neiser, J Adamczewski-Musch, M Hoek, W Koenig, G Korcyl, S Linev, ... Journal of Instrumentation 8 (12), C12043, 2013 | 95 | 2013 |
| Communication-free massively distributed graph generation D Funke, S Lamm, U Meyer, M Penschuck, P Sanders, C Schulz, D Strash, ... Journal of Parallel and Distributed Computing 131, 200-217, 2019 | 70 | 2019 |
| Efficiently generating geometric inhomogeneous and hyperbolic random graphs T Bläsius, T Friedrich, M Katzmann, U Meyer, M Penschuck, C Weyand Network Science 10 (4), 361-380, 2022 | 28 | 2022 |
| Generating massive scale-free networks under resource constraints U Meyer, M Penschuck 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016 | 24 | 2016 |
| I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark M Hamann, U Meyer, M Penschuck, H Tran, D Wagner Journal of Experimental Algorithmics (JEA) 23, 1-33, 2018 | 23 | 2018 |
| Recent advances in scalable network generation M Penschuck, U Brandes, M Hamann, S Lamm, U Meyer, I Safro, ... arXiv preprint arXiv:2003.00736, 2020 | 16 | 2020 |
| Generating practical random hyperbolic graphs in near-linear time and with sub-linear memory M Penschuck 16th International Symposium on Experimental Algorithms (SEA 2017), 2017 | 16 | 2017 |
| Parallel and I/O-efficient randomisation of massive networks using global curveball trades CJ Carstens, M Hamann, U Meyer, M Penschuck, H Tran, D Wagner arXiv preprint arXiv:1804.08487, 2018 | 13 | 2018 |
| Simulating population protocols in sub-constant time per interaction P Berenbrink, D Hammer, D Kaaser, U Meyer, M Penschuck, H Tran arXiv preprint arXiv:2005.03584, 2020 | 11 | 2020 |
| Near-optimal sparsity-constrained group testing: Improved bounds and algorithms O Gebhard, M Hahn-Klimroth, O Parczyk, M Penschuck, M Rolvien, ... IEEE Transactions on Information Theory 68 (5), 3253-3280, 2022 | 10 | 2022 |
| A users guide to the trb3 and fpga-tdc based platforms G Korcyl, L Maier, J Michel, A Neiser, M Palka, M Penschuck, ... Automatically generated from version-controlled LATEX sources, June, 2015 | 10 | 2015 |
| The number of satisfying assignments of random 2‐SAT formulas D Achlioptas, A Coja‐Oghlan, M Hahn‐Klimroth, J Lee, N Müller, ... Random Structures & Algorithms 58 (4), 609-647, 2021 | 8 | 2021 |
| Bidirectional text compression in external memory P Dinklage, J Ellert, J Fischer, D Köppl, M Penschuck arXiv preprint arXiv:1907.03235, 2019 | 6 | 2019 |
| Fragile complexity of comparison-based algorithms P Afshani, R Fagerberg, D Hammer, R Jacob, I Kostitsyna, U Meyer, ... arXiv preprint arXiv:1901.02857, 2019 | 5 | 2019 |
| Large-scale graph generation and big data: An overview on recent results U Meyer, M Penschuck Bulletin of EATCS 2 (122), 2017 | 5 | 2017 |
| Development and Implementation of a Central Trigger System for TrbNet-based systems M Penschuck Bachelor thesis, Universität Frankfurt, 41, 2012 | 5 | 2012 |
| The random 2-SAT partition function D Achlioptas, A Coja-Oghlan, M Hahn-Klimroth, J Lee, N Müller, ... arXiv preprint arXiv:2002.03690, 2020 | 3 | 2020 |
| Optimal group testing under real world restrictions O Gebhard, M Hahn-Klimroth, O Parczyk, M Penschuck, M Rolvien arXiv preprint arXiv:2004.11860, 2020 | 3 | 2020 |
| Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment D Allendorf, U Meyer, M Penschuck, H Tran 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2023 | 2 | 2023 |
