Остановите войну!
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 266 matches
- 2023
- Bernd-Holger Schlingloff, Thomas Vogel, Andrzej Skowron:
Concurrency, Specification and Programming - Revised Selected Papers from the 29th International Workshop on Concurrency, Specification and Programming (CS&P'21), Berlin, Germany. Studies in Computational Intelligence 1091, Springer 2023, ISBN 978-3-031-26650-8 [contents] - 2021
- Aliyu Tanko Ali, Damas P. Gruska:
Attack Trees with Time Constraints. CS&P 2021: 93-105 - Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Sorting by Decision Trees with Hypotheses (extended abstract). CS&P 2021: 126-130 - Agnieszka Boruta, Pawel Gburzynski, Ewa Kuznicka:
On Reliable Wireless Streaming of Real-time Sensor Data. CS&P 2021: 131-144 - Agnieszka Boruta, Pawel Gburzynski, Ewa Kuznicka:
A Protocol for Reliable Delivery of Streamed Sensor Data over a Low-Bandwidth Wireless Channel. CS&P (Revised Selected Papers) 2021: 175-201 - Elena N. Bozhenkova, Irina B. Virbitskaite:
On Semantics for Testing in Time Petri Nets. CS&P 2021: 60-71 - Elena N. Bozhenkova, Irina B. Virbitskaite:
Extended Future in Testing Semantics for Time Petri Nets. CS&P (Revised Selected Papers) 2021: 65-89 - Ludwik Czaja:
Cause-Effect Structures Behaving like Reaction Systems. CS&P 2021: 31-45 - Soma Dutta:
An Example of Computation in Interactive Granular Computing. CS&P (Revised Selected Papers) 2021: 47-63 - Soma Dutta, Andrzej Skowron:
Interactive Granular Computing Connecting Abstract and Physical Worlds: An Example. CS&P 2021: 46-59 - Robin Gröpler, Viju Sudhi, Emilio José Calleja García, Andre Bergmann:
NLP-Based Requirements Formalization for Automatic Test Case Generation. CS&P 2021: 18-30 - Damas P. Gruska:
Security Enforcing. CS&P (Revised Selected Papers) 2021: 123-143 - Damas P. Gruska, M. Carmen Ruiz:
Process Opacity and Insertion Functions. CS&P 2021: 83-92 - Eyad Kannout, Marek Grzegorowski, Hung Son Nguyen:
Toward Recommender Systems Scalability and Efficacy. CS&P (Revised Selected Papers) 2021: 91-121 - Alexander Knapp:
Specifying Event/Data-based Systems (keynote). CS&P 2021: 1 - Heinrich Mellmann, Volha Taliaronak, Verena V. Hafner:
Towards an Anticipatory Mechanism for Complex Decisions in a Bio-Hybrid Beehive. CS&P (Revised Selected Papers) 2021: 145-173 - Roman Milewski, Simon Heiden, Lars Grunske:
Evaluating Fault Localization Techniques with Bug Signatures and Joined Predicates. CS&P 2021: 2-17 - Roman Nestoruk, Grzegorz Slowinski:
Prediction of Football Games Results. CS&P 2021: 156-165 - Hung Son Nguyen:
Efficient Machine Learning Methods over Pairwise Space (keynote). CS&P 2021: 117-119 - Eugen Puzynin, Heinrich Mellmann, Verena V. Hafner:
Extended Abstract: A Novel Mobile App for the Next Generation of Beekeepers. CS&P 2021: 113-116 - Roman R. Redziejowski:
Left Recursion by Recursive Ascent. CS&P 2021: 72-82 - Roman R. Redziejowski:
Left Recursion by Recursive Ascent. CS&P (Revised Selected Papers) 2021: 29-46 - Lukasz Skowronek, Pawel Góra, Marcin Mozejko, Arkadiusz Klemenko:
Graph-based Sparse Neural Networks for Traffic Signal Optimization. CS&P 2021: 145-155 - Lukasz Skowronek, Pawel Góra, Marcin Mozejko, Arkadiusz Klemenko:
Graph-Based Sparse Neural Networks for Traffic Signal Optimization. CS&P (Revised Selected Papers) 2021: 203-227 - Grzegorz Slowinski:
Influence of Data Dimension Reduction, Feature Scaling and Activation Function on Machine Learning Performance. CS&P 2021: 120-125 - Grzegorz Slowinski:
Dry Beans Classification Using Machine Learning. CS&P 2021: 166-173 - Viju Sudhi, Libin Kutty, Robin Gröpler:
Natural Language Processing for Requirements Formalization: How to Derive New Approaches? CS&P (Revised Selected Papers) 2021: 1-27 - Volha Taliaronak, Heinrich Mellmann, Verena V. Hafner:
Extended Abstract: Simulation of Interactions between Beehives. CS&P 2021: 106-112 - Holger Schlingloff, Thomas Vogel:
Proceedings of the 29th International Workshop on Concurrency, Specification and Programming (CS&P 2021), Berlin, Germany, September 27-28, 2021. CEUR Workshop Proceedings 2951, CEUR-WS.org 2021 [contents] - 2020
- Krzysztof Ropiak, Lech Polkowski, Piotr Artiemjew:
Proceedings of the 28th International Workshop on Concurrency, Specification and Programming, Olsztyn, Poland, September 24-26th, 2019. CEUR Workshop Proceedings 2571, CEUR-WS.org 2020 [contents]
skipping 236 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-04-27 22:43 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