![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 19 matches
- 2024
- Pierre Béaur, Jarkko Kari:
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata. Int. J. Found. Comput. Sci. 35(1&2): 77-100 (2024) - Henrik Björklund
, Johanna Björklund
, Petter Ericson
:
Tree-Based Generation of Restricted Graph Languages. Int. J. Found. Comput. Sci. 35(1&2): 215-243 (2024) - Xiangdong Cheng, Xiwang Cao, Liqin Qian:
Linear Codes and Linear Complementary Pairs of Codes Over a Non-Chain Ring. Int. J. Found. Comput. Sci. 35(3): 297-311 (2024) - Manfred Droste, Gustav Grabolle, George Rahonis:
Weighted Linear Dynamic Logic. Int. J. Found. Comput. Sci. 35(1&2): 145-177 (2024) - Emmanuel Filiot
, Sarah Winter
:
Synthesizing Computable Functions from Rational Specifications Over Infinite Words. Int. J. Found. Comput. Sci. 35(1&2): 179-214 (2024) - Zoltán Fülöp, George Rahonis, Kai Salomaa:
Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. Int. J. Found. Comput. Sci. 35(1&2): 1 (2024) - Zoltán Fülöp, Heiko Vogler:
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices. Int. J. Found. Comput. Sci. 35(1&2): 51-76 (2024) - Fei Guo, Zilong Wang
:
Balanced Even-Variable Rotation Symmetric Boolean Functions with Optimal Algebraic Immunity, Maximum Algebraic Degree and Higher Nonlinearity. Int. J. Found. Comput. Sci. 35(3): 245-270 (2024) - Ruyan Guo, Yan Wang, Jianxi Fan, Weibei Fan:
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength. Int. J. Found. Comput. Sci. 35(3): 327-352 (2024) - Vesa Halava, Stepan Holub:
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time. Int. J. Found. Comput. Sci. 35(1&2): 129-144 (2024) - Tero Harju
:
A Note on Squares in Binary Words. Int. J. Found. Comput. Sci. 35(1&2): 101-106 (2024) - Fatemeh Keshavarz-Kohjerdi
, Alireza Bagheri
:
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs. Int. J. Found. Comput. Sci. 35(3): 353-374 (2024) - Xianyong Li
, Jiaming Huang, Yajun Du, Yongquan Fan, Xiaoliang Chen
:
The g-Good-Neighbor Conditional Diagnosabilities of Hypermesh Optical Interconnection Networks Under the PMC and Comparison Models. Int. J. Found. Comput. Sci. 35(3): 313-325 (2024) - Christof Löding, Wolfgang Thomas:
On the Boolean Closure of Deterministic Top-Down Tree Automata. Int. J. Found. Comput. Sci. 35(1&2): 11-22 (2024) - Andreas Maletti:
Compositions of Weighted Extended Tree Transducers - The Unambiguous Case. Int. J. Found. Comput. Sci. 35(1&2): 107-127 (2024) - Baohua Niu, Shuming Zhou
, Hong Zhang:
Influential Node Identification of Network Based on Agglomeration Operation. Int. J. Found. Comput. Sci. 35(3): 271-295 (2024) - Erik Paul:
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata. Int. J. Found. Comput. Sci. 35(1&2): 23-49 (2024) - Arto Salomaa, Magnus Steinby:
Volume Edited by Magnus Steinby. Int. J. Found. Comput. Sci. 35(1&2): 7-10 (2024) - Paula Steinby:
In Memoriam: Magnus Steinby (1941-2021). Int. J. Found. Comput. Sci. 35(1&2): 3-5 (2024)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-16 22:22 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