Остановите войну!
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 286 matches
- 2023
- Gabriel Ciobanu:
A Teacher of Great Strengths. Sci. Ann. Comput. Sci. 33(1): 1-4 (2023) - George Georgescu:
Semidegenerate Congruence-modular Algebras Admitting a Reticulation. Sci. Ann. Comput. Sci. 33(1): 5-34 (2023) - Szymon Jaroszewicz, Krzysztof Rudas:
Shrinkage Estimators for the Intercept in Linear and Uplift Regression. Sci. Ann. Comput. Sci. 33(1): 35-52 (2023) - Casey Keeler, Kai Salomaa:
Maximal Existential and Universal Width. Sci. Ann. Comput. Sci. 33(1): 53-77 (2023) - Hajime Machida:
A Study on Centralizing Monoids with Majority Operation Witnesses. Sci. Ann. Comput. Sci. 33(1): 79-92 (2023) - Eleni Mandrali:
Describing weighted safety with weighted LTL over product omega-valuation monoids. Sci. Ann. Comput. Sci. 33(2): 93-157 (2023) - Cornelis A. Middelburg:
Belnap-Dunn Logic and Query Answering in Inconsistent Databases with Null Values. Sci. Ann. Comput. Sci. 33(2): 159-192 (2023) - Shikha Rai, Shibsankar Das:
On Nirmala Indices of Some Hex-derived Networks of Type Three and Their Subdivision Networks. Sci. Ann. Comput. Sci. 33(2): 193-242 (2023) - 2022
- Bogdan Aman, Gabriel Ciobanu:
New Editorial Team for SACS after 16 Years. Sci. Ann. Comput. Sci. 32(2): 181-182 (2022) - Jan A. Bergstra:
A Survey of Testing for Instruction Sequence Theory. Sci. Ann. Comput. Sci. 32(1): 5-86 (2022) - Jan A. Bergstra:
Four Notions of Fault for Program Specifications. Sci. Ann. Comput. Sci. 32(2): 183-209 (2022) - Jan A. Bergstra, John V. Tucker:
Which Arithmetical Data Types Admit Fracterm Flattening? Sci. Ann. Comput. Sci. 32(1): 87-107 (2022) - Gabriel Ciobanu:
Reflections on a Scientific Journal. Sci. Ann. Comput. Sci. 32(1): 1-4 (2022) - Eugen Czeizler, Alexandru Popa, Victor Popescu:
Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem. Sci. Ann. Comput. Sci. 32(1): 109-136 (2022) - Wenjie Du, Yuxin Deng, Daniel Gebler:
Behavioural Pseudometrics for Nondeterministic Probabilistic Systems. Sci. Ann. Comput. Sci. 32(2): 211-254 (2022) - Amine Laghrib, Aissam Hadri, Moad Hakim:
An Enhanced Fluid Registration for Image Multi-Frame Super Resolution. Sci. Ann. Comput. Sci. 32(2): 255-283 (2022) - Cornelis A. Middelburg:
Imperative Process Algebra with Abstraction. Sci. Ann. Comput. Sci. 32(1): 137-179 (2022) - Cornelis A. Middelburg:
Program Algebra for Random Access Machine Programs. Sci. Ann. Comput. Sci. 32(2): 285-319 (2022) - 2021
- Jan A. Bergstra:
Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent. Sci. Ann. Comput. Sci. 31(1): 1-50 (2021) - Shibsankar Das, Shikha Rai:
Topological Characterization of the Third Type of Triangular Hex-derived Networks. Sci. Ann. Comput. Sci. 31(2): 145-161 (2021) - Afrodita Iorgulescu:
On Quantum-MV Algebras - Part I: The Orthomodular Algebras. Sci. Ann. Comput. Sci. 31(2): 163-222 (2021) - Eleni Mandrali:
A Translation of Weighted LTL Formulas to Weighted B{\" u}chi Automata over {\(\omega\)}-valuation Monoids. Sci. Ann. Comput. Sci. 31(2): 223-292 (2021) - Claudia Muresan:
A Note on Congruences of Infinite Bounded Involution Lattices. Sci. Ann. Comput. Sci. 31(1): 51-78 (2021) - Ali Gholami Rudi:
Maximizing the Number of Visible Labels on a Rotating Map. Sci. Ann. Comput. Sci. 31(2): 293-313 (2021) - Luís M. S. Russo, Alexandre P. Francisco:
Small Longest Tandem Scattered Subsequences. Sci. Ann. Comput. Sci. 31(1): 79-110 (2021) - Mickaël Trezzy, Ileana Ober, Iulian Ober, Raquel Araújo de Oliveira:
Applying MDE to ROS Systems: A Comparative Analysis. Sci. Ann. Comput. Sci. 31(1): 111-144 (2021) - 2020
- Jan A. Bergstra:
Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers. Sci. Ann. Comput. Sci. 30(1): 1-24 (2020) - Jan A. Bergstra:
Instruction Sequence Faults with Formal Change Justification. Sci. Ann. Comput. Sci. 30(2): 105-166 (2020) - Jan A. Bergstra:
Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of Summation. Sci. Ann. Comput. Sci. 30(2): 167-203 (2020) - Shibsankar Das:
An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs. Sci. Ann. Comput. Sci. 30(1): 25-37 (2020)
skipping 256 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-28 06:04 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