![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Gregor Bankhamer
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i5]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Population Protocols for Exact Plurality Consensus - How a small chance of failure helps to eliminate insignificant opinions. CoRR abs/2402.06471 (2024) - 2023
- [j2]Lukasz Szustak
, Marcin Lawenda
, Sebastian Arming, Gregor Bankhamer, Christoph Schweimer
, Robert Elsässer:
Profiling and optimization of Python-based social sciences applications on HPC systems by means of task and data parallelism. Future Gener. Comput. Syst. 148: 623-635 (2023) - 2022
- [j1]Gregor Bankhamer
, Robert Elsässer
, Stefan Schmid
:
Local Fast Rerouting With Low Congestion: A Randomized Approach. IEEE/ACM Trans. Netw. 30(6): 2403-2418 (2022) - [c5]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. PODC 2022: 224-234 - [c4]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Fast Consensus via the Unconstrained Undecided State Dynamics. SODA 2022: 3417-3429 - 2021
- [c3]Gregor Bankhamer, Robert Elsässer, Stefan Schmid
:
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. DISC 2021: 9:1-9:19 - [i4]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Fast Consensus via the Unconstrained Undecided State Dynamics. CoRR abs/2103.10366 (2021) - [i3]Gregor Bankhamer, Robert Elsässer, Stefan Schmid:
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. CoRR abs/2108.02136 (2021) - 2020
- [c2]Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc:
Positive Aging Admits Fast Asynchronous Plurality Consensus. PODC 2020: 385-394 - [i2]Gregor Bankhamer, Robert Elsässer, Stefan Schmid:
Local Fast Rerouting with Low Congestion: A Randomized Approach. CoRR abs/2009.01497 (2020)
2010 – 2019
- 2019
- [c1]Gregor Bankhamer, Robert Elsässer, Stefan Schmid
:
Local Fast Rerouting with Low Congestion: A Randomized Approach. ICNP 2019: 1-11 - 2018
- [i1]Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc:
Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies. CoRR abs/1806.02596 (2018)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-05-08 21:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint