Остановите войну!
for scientists:
default search action
Ulrich Meyer 0001
- > Home > Persons > Ulrich Meyer 0001
Publications
- 2023
- [j25]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) - [c62]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. ALENEX 2023: 65-76 - [c60]Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis:
Certifying Induced Subgraphs in Large Graphs. WALCOM 2023: 229-241 - 2022
- [c59]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald:
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. ALENEX 2022: 27-40 - [c58]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees. IPDPS 2022: 269-279 - [i18]Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis:
Certifying Induced Subgraphs in Large Graphs. CoRR abs/2210.13057 (2022) - [i17]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
- [c57]Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran:
An Experimental Study of External Memory Algorithms for Connected Components. SEA 2021: 23:1-23:23 - [i16]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) - [i15]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
- [c56]Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Simulating Population Protocols in Sub-Constant Time per Interaction. ESA 2020: 16:1-16:22 - [i13]Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Simulating Population Protocols in Sub-Constant Time per Interaction. CoRR abs/2005.03584 (2020) - 2018
- [j20]Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark. ACM J. Exp. Algorithmics 23 (2018) - [c51]Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. ESA 2018: 11:1-11:15 - [i9]Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. CoRR abs/1804.08487 (2018)
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-02-20 20:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint