Остановите войну!
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 52 matches
- 2021
- Markus Holzer, Martin Kutrib:
Preface. Int. J. Found. Comput. Sci. 32(5): 417-418 (2021) - Ikhlass Ammar, Yamen El Touati, John Mullins, Moez Yeddes:
Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language. Int. J. Found. Comput. Sci. 32(2): 175-202 (2021) - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32(2): 209-233 (2021) - Zeynep Nihan Berberler, Halil Ibrahim Yildirim, Tolga Iltüzer, Izzet Tunç:
Agglomeration-Based Node Importance Analysis in Wheel-Type Networks. Int. J. Found. Comput. Sci. 32(3): 269-288 (2021) - Collin Bleak:
Normalish Amenable Subgroups of the R. Thompson Groups. Int. J. Found. Comput. Sci. 32(6): 785-800 (2021) - Priscila P. Camargo, Uéverton S. Souza, Julliano R. Nascimento:
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms. Int. J. Found. Comput. Sci. 32(1): 37-52 (2021) - Mengyue Cao, Tongtong Ding, Min Xu:
The (n, k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph. Int. J. Found. Comput. Sci. 32(7): 849-860 (2021) - Arturo Carpi, Flavio D'Alessandro:
On the Commutative Equivalence of Algebraic Formal Series and Languages. Int. J. Found. Comput. Sci. 32(4): 341-367 (2021) - Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Search on a Line by Byzantine Robots. Int. J. Found. Comput. Sci. 32(4): 369-387 (2021) - Jürgen Dassow:
Further Remarks on the Operational Nonterminal Complexity. Int. J. Found. Comput. Sci. 32(5): 439-453 (2021) - Ömer Egecioglu, Elif Saygi, Zülfükar Saygi:
Alternate Lucas Cubes. Int. J. Found. Comput. Sci. 32(7): 871-899 (2021) - Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Reoto Morita, Shinnosuke Seki:
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami. Int. J. Found. Comput. Sci. 32(5): 575-596 (2021) - Olivier Finkel:
Two Effective Properties of ω-Rational Functions. Int. J. Found. Comput. Sci. 32(7): 901-920 (2021) - Lukas Fleischer, Jeffrey O. Shallit:
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages. Int. J. Found. Comput. Sci. 32(6): 641-662 (2021) - Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo:
Reconstructing Words from Right-Bounded-Block Words. Int. J. Found. Comput. Sci. 32(6): 619-640 (2021) - Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit:
An Inequality for the Number of Periods in a Word. Int. J. Found. Comput. Sci. 32(5): 597-614 (2021) - Albert Guan:
A Lightweight Key Agreement Protocol with Authentication Capability. Int. J. Found. Comput. Sci. 32(4): 389-404 (2021) - Litao Guo, Mingzu Zhang, Shaohui Zhai, Liqiong Xu:
Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks. Int. J. Found. Comput. Sci. 32(2): 137-149 (2021) - Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. Int. J. Found. Comput. Sci. 32(6): 801-823 (2021) - Oscar H. Ibarra, Ian McQuillan:
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. Int. J. Found. Comput. Sci. 32(5): 481-508 (2021) - Oscar H. Ibarra, Sartaj K. Sahni:
Announcement. Int. J. Found. Comput. Sci. 32(7): 825 (2021) - Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz:
Error-Free Affine, Unitary, and Probabilistic OBDDs. Int. J. Found. Comput. Sci. 32(7): 827-847 (2021) - Natasa Jonoska, Dmytro Savchuk:
Preface. Int. J. Found. Comput. Sci. 32(6): 615-617 (2021) - Lila Kari, Timothy Ng:
Descriptional Complexity of Semi-Simple Splicing Systems. Int. J. Found. Comput. Sci. 32(6): 685-711 (2021) - Sang-Ki Ko, Yo-Sub Han:
Left is Better Than Right for Reducing Nondeterminism of NFAs. Int. J. Found. Comput. Sci. 32(5): 531-550 (2021) - Sang-Ki Ko, Yo-Sub Han, Kai Salomaa:
Generalizations of Code Languages with Marginal Errors. Int. J. Found. Comput. Sci. 32(5): 509-529 (2021) - Florent Koechlin, Cyril Nicaud, Pablo Rotondo:
Simplifications of Uniform Expressions Specified by Systems. Int. J. Found. Comput. Sci. 32(6): 733-760 (2021) - Toshihiro Koga:
A Proof of Parikh's Theorem via Dickson's Lemma. Int. J. Found. Comput. Sci. 32(2): 163-173 (2021) - Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej:
Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem. Int. J. Found. Comput. Sci. 32(5): 455-480 (2021) - Johan Kopra:
On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts. Int. J. Found. Comput. Sci. 32(6): 663-683 (2021)
skipping 22 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-24 21:45 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