default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Helfrich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Philipp Czerner, Roland Guttenberg
, Martin Helfrich, Javier Esparza:
Fast and succinct population protocols for Presburger arithmetic. J. Comput. Syst. Sci. 140: 103481 (2024)- 2023
- [b1]Martin Helfrich:
Efficient Analysis of Population Protocols and Chemical Reaction Networks. Technical University of Munich, Germany, 2023 - 2022
- [c7]Martin Helfrich, Milan Ceska, Jan Kretínský, Stefan Marticek:
Abstraction-Based Segmental Simulation of Chemical Reaction Networks. CMSB 2022: 41-60 - [c6]Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Fast and Succinct Population Protocols for Presburger Arithmetic. SAND 2022: 11:1-11:17 - [d1]Martin Helfrich, Milan Ceska, Jan Kretínský, Stefan Marticek:
Artifact for CMSB22 paper "Abstraction-Based Segmental Simulation of Chemical Reaction Networks". Zenodo, 2022
- [i7]Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Fast and Succinct Population Protocols for Presburger Arithmetic. CoRR abs/2202.11601 (2022) - [i6]Martin Helfrich, Milan Ceska, Jan Kretínský, Stefan Marticek:
Abstraction-Based Segmental Simulation of Chemical Reaction Networks. CoRR abs/2206.06677 (2022) - 2021
- [c5]Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Decision Power of Weak Asynchronous Models of Distributed Computing. PODC 2021: 115-125 - [i5]Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Decision Power of Weak Asynchronous Models of Distributed Computing. CoRR abs/2102.11630 (2021) - 2020
- [c4]Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer:
Peregrine 2.0: Explaining Correctness of Population Protocols Through Stage Graphs. ATVA 2020: 550-556 - [c3]Loris D'Antoni, Martin Helfrich, Jan Kretínský, Emanuel Ramneantu, Maximilian Weininger:
Automata Tutor v3. CAV (2) 2020: 3-14 - [c2]Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer:
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CAV (2) 2020: 372-397 - [c1]Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. STACS 2020: 40:1-40:15 - [i4]Loris D'Antoni, Martin Helfrich, Jan Kretínský, Emanuel Ramneantu, Maximilian Weininger:
Automata Tutor v3. CoRR abs/2005.01419 (2020) - [i3]Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer:
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CoRR abs/2005.03555 (2020) - [i2]Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer:
Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs. CoRR abs/2007.07638 (2020)
2010 – 2019
- 2019
- [i1]Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. CoRR abs/1910.04600 (2019)
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-21 21:26 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:
