default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvgeny Erofeev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j8]Ronny Tredup, Evgeny Erofeev:
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments. Theor. Comput. Sci. 890: 36-69 (2021)- [j7]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa
:
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond. Trans. Petri Nets Other Model. Concurr. 15: 75-100 (2021) - 2020
- [j6]Evgeny Erofeev, Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski:
Generating all minimal petri net unsolvable binary words. Discret. Appl. Math. 274: 35-53 (2020) - [j5]Eike Best, Raymond R. Devillers, Evgeny Erofeev, Harro Wimmel:
Target-oriented Petri Net Synthesis. Fundam. Informaticae 175(1-4): 97-122 (2020) - [j4]Evgeny Erofeev, Vadim Arykov, Michael Stepanenko, Aleksei Voevodin, Aleksei Kogai, Vladimir Kurikalov:
28 GHz Single-Chip Transmit RF Front-End MMIC for Multichannel 5G Wireless Communications. Symmetry 12(7): 1167 (2020) - [c15]Ronny Tredup, Evgeny Erofeev:
On the Complexity of Synthesis of nop-Free Boolean Petri Nets. ATAED@Petri Nets 2020: 66-84 - [c14]Eike Best, Raymond R. Devillers, Evgeny Erofeev:
A New Property of Choice-Free Petri Net Systems. Petri Nets 2020: 89-108 - [c13]Ronny Tredup, Evgeny Erofeev:
The Complexity of Boolean State Separation. ICTAC 2020: 123-142 - [c12]Evgeny Erofeev, Ronny Tredup:
Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm. ICTAC 2020: 143-160 - [c11]Ronny Tredup, Evgeny Erofeev:
On the Parameterized Complexity of d-Restricted Boolean Net Synthesis. TAMC 2020: 226-238 - [c10]Ronny Tredup, Evgeny Erofeev:
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency. ICE 2020: 78-95 - [i4]Ronny Tredup, Evgeny Erofeev:
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report). CoRR abs/2007.12372 (2020) - [i3]Ronny Tredup, Evgeny Erofeev:
The Complexity of Boolean State Separation (Technical Report). CoRR abs/2010.00825 (2020)
2010 – 2019
- 2019
- [j3]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. Trans. Petri Nets Other Model. Concurr. 14: 172-191 (2019) - [c9]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems. ATAED@Petri Nets/ACSD 2019: 6-22 - [i2]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond. CoRR abs/1910.14387 (2019) - [i1]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. CoRR abs/1911.00474 (2019) - 2018
- [j2]Kamila Barylska, Evgeny Erofeev, Maciej Koutny, Lukasz Mikulski, Marcin Piatkowski:
Reversing Transitions in Bounded Petri Nets. Fundam. Informaticae 157(4): 341-357 (2018) - [c8]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems. ATAED@Petri Nets/ACSD 2018: 75-90 - 2017
- [c7]Evgeny Erofeev, Harro Wimmel:
Reachability Graphs of Two-Transition Petri Nets. ATAED@Petri Nets/ACSD 2017: 39-54 - 2016
- [j1]Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski:
Conditions for Petri Net Solvable Binary Words. Trans. Petri Nets Other Model. Concurr. 11: 137-159 (2016) - [c6]Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel:
Characterising Petri Net Solvable Binary Words. Petri Nets 2016: 39-58 - [c5]Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski, Maciej Koutny, Evgeny Erofeev:
Reversing Transitions in Bounded Petri Nets. CS&P 2016: 74-85 - [c4]Evgeny Erofeev, Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski:
Generating All Minimal Petri Net Unsolvable Binary Words. Stringology 2016: 33-46 - 2015
- [c3]Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski:
On Binary Words Being Petri Net Solvable. ATAED@Petri Nets/ACSD 2015: 1-15 - [c2]Irina B. Virbitskaite, Elena N. Bozhenkova, Evgeny Erofeev:
Space-Time Viewpoints for Concurrent Processes Represented by Relational Structures. CS&P 2015: 222-233 - 2014
- [c1]Evgeny Erofeev:
Formalisms for concurrency and distribution. Joint Workshop of the German Research Training Groups in Computer Science 2014: 159
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-04-24 23:07 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:
