Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 114 matches
- 2024
- R. Anthony Inman, Kenneth W. Green Jr.:
Supply Chain Complexity and Traceability in Adverse Events Revisited: A COVID-19 Perspective. IEEE Trans. Engineering Management 71: 7134-7146 (2024) - Tomás Masopust, Petr Osicka:
On the Complexity of Initial-and-Final-State Opacity for Discrete Event Systems. CoRR abs/2402.17000 (2024) - 2023
- Aleksandra Revina, Ünal Aksu:
An approach for analyzing business process execution complexity based on textual data and event log. Inf. Syst. 114: 102184 (2023) - Maxim Vidgof, Bastian Wurm, Jan Mendling:
The Impact of Process Complexity on Process Performance: A Study Using Event Log Data. BPM 2023: 413-429 - Xiaoyan Li, Christoforos N. Hadjicostis, Zhiwu Li:
Reduced-Complexity Approach for Opacity Enforcement Based on Extended Insertion Functions with Limited Insertion Events. ICNSC 2023: 1-6 - Eike Neumann:
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions. RP 2023: 98-112 - Eike Neumann:
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions. CoRR abs/2307.00363 (2023) - Maxim Vidgof, Bastian Wurm, Jan Mendling:
The Impact of Process Complexity on Process Performance: A Study using Event Log Data. CoRR abs/2307.06106 (2023) - Xiaoyan Li, Christoforos N. Hadjicostis, Zhiwu Li:
Reduced-Complexity Verification for K-Step and Infinite-Step Opacity in Discrete Event Systems. CoRR abs/2310.11825 (2023) - 2022
- Adriano Augusto, Jan Mendling, Maxim Vidgof, Bastian Wurm:
The connection between process complexity of event sequences and models discovered by process mining. Inf. Sci. 598: 196-215 (2022) - Ionut Schiopu, Radu Ciprian Bilcu:
Low-Complexity Lossless Coding of Asynchronous Event Sequences for Low-Power Chip Integration. Sensors 22(24): 10014 (2022) - Rongjian Liu, Jianquan Lu, Christoforos N. Hadjicostis:
Reduced Complexity Verification of Almost-Infinite-Step Opacity in Stochastic Discrete-Event Systems*. ACC 2022: 3734-3739 - Maxim Vidgof, Jan Mendling:
Leveraging Event Data for Measuring Process Complexity. ICPM Workshops 2022: 84-95 - Aleksandra Revina, Ünal Aksu:
Towards a Business Process Complexity Analysis Framework Based on Textual Data and Event Logs. Wirtschaftsinformatik 2022 - 2021
- Ronny Tredup:
Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net Implementable. Petri Nets 2021: 253-273 - Tatsuya Komatsu, Robin Scheibler:
Comparison of Low Complexity Self-Attention Mechanisms for Acoustic Event Detection. APSIPA ASC 2021: 1139-1143 - Florian Plötzky, Wolf-Tilo Balke:
What it Boils Down to... The Case for Event Analogies to Combat Complexity in Digital Libraries. DISCO@JCDL 2021: 24-28 - Tiziana Calamoneri, Federico Corò:
Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings. Lecture Notes in Computer Science 12701, Springer 2021, ISBN 978-3-030-75241-5 [contents] - Yo-Sub Han, Sang-Ki Ko:
Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings. Lecture Notes in Computer Science 13037, Springer 2021, ISBN 978-3-030-93488-0 [contents] - Adriano Augusto, Jan Mendling, Maxim Vidgof, Bastian Wurm:
The Connection between Process Complexity of Event Sequences and Models discovered by Process Mining. CoRR abs/2106.07990 (2021) - Jirí Balun, Tomás Masopust:
K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations. CoRR abs/2109.02158 (2021) - 2020
- Tobias Kleinert, Frederik Zahn, Veit Hagenmeyer:
On complexity reduction of the discrete-event subsystem of Flat Hybrid Automata for control design. Autom. 68(7): 529-540 (2020) - Gianmarco Cerutti, Rahul Prasad, Alessio Brutti, Elisabetta Farella:
Compact Recurrent Neural Networks for Acoustic Event Detection on Low-Energy Low-Complexity Platforms. IEEE J. Sel. Top. Signal Process. 14(4): 654-664 (2020) - Patrik Simon Berner, Martin Mönnigmann:
A Complexity Analysis of Event-Triggered Model Predictive Control on Industrial Hardware. IEEE Trans. Control. Syst. Technol. 28(6): 2625-2632 (2020) - Attique Ur Rehman, Tek Tjing Lie, Brice Vallès, Shafiqur Rahman Tito:
Event-Detection Algorithms for Low Sampling Nonintrusive Load Monitoring Systems Based on Low Complexity Statistical Features. IEEE Trans. Instrum. Meas. 69(3): 751-759 (2020) - Gal Raz, Setayesh Radkani, Josh Tenenbaum, Rebecca Saxe:
Humans measure algorithmic complexity to guide engagement with event sequences. CogSci 2020 - Andrés Pérez-López, Rafael Ibáñez-Usach:
Papafil: A Low Complexity Sound Event Localization and Detection Method with Parametric Particle Filtering and Gradient Boosting. DCASE 2020: 155-159 - Prasad K. Kabbur, V. S. Mani, Juergen Schuelein:
Prioritizing trust in a globally distributed software engineering team to overcome complexity and make releases a non-event. ICGSE 2020: 66-70 - Gianmarco Cerutti, Rahul Prasad, Alessio Brutti, Elisabetta Farella:
Compact recurrent neural networks for acoustic event detection on low-energy low-complexity platforms. CoRR abs/2001.10876 (2020) - 2019
- Tomás Masopust, Xiang Yin:
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems. Autom. 101: 290-295 (2019)
skipping 84 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-03 06:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint