default search action
Manuel Penschuck
Person information
- affiliation: Goethe University Frankfurt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck:
Insights into (k, ρ)-Shortcutting Algorithms. ESA 2024: 84:1-84:17 - [i16]Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck:
Insights into (k, ρ)-shortcutting algorithms. CoRR abs/2402.07771 (2024) - 2023
- [j8]Daniel Allendorf
, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees. J. Parallel Distributed Comput. 174: 118-129 (2023) - [c15]Daniel Allendorf
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. ALENEX 2023: 65-76 - [c14]Alexander Leonhardt
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC 2023: 37:1-37:7 - [c13]Manuel Penschuck:
Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place. SEA 2023: 5:1-5:20 - [i15]Manuel Penschuck:
Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place. CoRR abs/2302.03317 (2023) - 2022
- [j7]Thomas Bläsius
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10(4): 361-380 (2022) - [j6]Oliver Gebhard
Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms. IEEE Trans. Inf. Theory 68(5): 3253-3280 (2022) - [c12]Daniel Allendorf
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. ALENEX 2022: 27-40 - [c11]Daniel Allendorf
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees. IPDPS 2022: 269-279 - [c10]Amin Coja-Oghlan, Max Hahn-Klimroth
Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study. SEA 2022: 8:1-8:18 - [p3]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation1. Massive Graph Analytics 2022: 333-376 - [p2]Eugenio Angriman, Alexander van der Grinten
Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit. Algorithms for Big Data 2022: 3-20 - [p1]Ulrich Meyer
Generating Synthetic Graph Data from Random Network Models. Algorithms for Big Data 2022: 21-38 - [e1]Hannah Bast, Claudius Korzen, Ulrich Meyer
Algorithms for Big Data - DFG Priority Program 1736. Lecture Notes in Computer Science 13201, Springer 2022, ISBN 978-3-031-21533-9 [contents] - [i14]Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck:
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit. CoRR abs/2209.13355 (2022) - [i13]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. CoRR abs/2211.06884 (2022) - 2021
- [b1]Manuel Penschuck:
Scalable generation of random graphs. Frankfurt University, Germany, 2021 - [j5]Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth
The number of satisfying assignments of random 2-SAT formulas. Random Struct. Algorithms 58(4): 609-647 (2021) - [c9]Gerth Stølting Brodal
An Experimental Study of External Memory Algorithms for Connected Components. SEA 2021: 23:1-23:23 - [i12]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Manuel Penschuck
Efficient and accurate group testing via Belief Propagation: an empirical study. CoRR abs/2105.07882 (2021) - [i11]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald:
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. CoRR abs/2110.15015 (2021) - [i10]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees. CoRR abs/2111.03005 (2021) - 2020
- [j4]Ulrich Meyer, Manuel Penschuck:
Large-scale graph generation: Recent results of the SPP 1736 - Part II. it Inf. Technol. 62(3-4): 135-144 (2020) - [c8]Petra Berenbrink, David Hammer
Simulating Population Protocols in Sub-Constant Time per Interaction. ESA 2020: 16:1-16:22 - [i9]Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck
The random 2-SAT partition function. CoRR abs/2002.03690 (2020) - [i8]Manuel Penschuck
Recent Advances in Scalable Network Generation. CoRR abs/2003.00736 (2020) - [i7]Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck
Optimal group testing under real world restrictions. CoRR abs/2004.11860 (2020) - [i6]Petra Berenbrink, David Hammer
Simulating Population Protocols in Sub-Constant Time per Interaction. CoRR abs/2005.03584 (2020)
2010 – 2019
- 2019
- [j3]Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz
Communication-free massively distributed graph generation. J. Parallel Distributed Comput. 131: 200-217 (2019) - [c7]Peyman Afshani, Rolf Fagerberg, David Hammer
Fragile Complexity of Comparison-Based Algorithms. ESA 2019: 2:1-2:19 - [c6]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA 2019: 21:1-21:14 - [c5]Patrick Dinklage
Bidirectional Text Compression in External Memory. ESA 2019: 41:1-41:16 - [i5]Peyman Afshani, Rolf Fagerberg, David Hammer
Fragile Complexity of Comparison-Based Algorithms. CoRR abs/1901.02857 (2019) - [i4]Thomas Bläsius
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR abs/1905.06706 (2019) - [i3]Patrick Dinklage, Jonas Ellert
Bidirectional Text Compression in External Memory. CoRR abs/1907.03235 (2019) - 2018
- [j2]Michael Hamann
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark. ACM J. Exp. Algorithmics 23 (2018) - [c4]Corrie Jacobien Carstens, Michael Hamann
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. ESA 2018: 11:1-11:15 - [i2]Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. CoRR abs/1804.08487 (2018) - 2017
- [j1]Ulrich Meyer, Manuel Penschuck:
Large-scale Graph Generation and Big Data: An Overview on Recent Results. Bull. EATCS 122 (2017) - [c3]Michael Hamann
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. ALENEX 2017: 58-72 - [c2]Manuel Penschuck:
Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory. SEA 2017: 26:1-26:21 - 2016
- [c1]Ulrich Meyer, Manuel Penschuck:
Generating Massive Scale-Free Networks under Resource Constraints. ALENEX 2016: 39-52 - [i1]Michael Hamann, Ulrich Meyer, Manuel Penschuck
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. CoRR abs/1604.08738 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: