Остановите войну!
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 29 matches
- 2016
- Dimitry S. Ananichev, Vladimir V. Gusev:
Approximation of Reset Thresholds with Greedy Algorithms. Fundam. Informaticae 145(3): 221-227 (2016) - Susmit Bagchi:
Probabilistic and Fuzzy Process Classifiers for Operating Systems Scheduler. Fundam. Informaticae 145(4): 405-427 (2016) - Huiting Han, Chunming Tang, Yu Lou, Maozhi Xu:
Construction of Efficient MDS Matrices Based on Block Circulant Matrices for Lightweight Application. Fundam. Informaticae 145(2): 111-124 (2016) - Jan Hidders, Jan Paredaens:
A Formal and Unified Description of XML Manipulation Languages. Fundam. Informaticae 145(4): 429-470 (2016) - Dmitry Itsykson, Vsevolod Oparin, Mikhail Slabodkin, Dmitry Sokolov:
Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles. Fundam. Informaticae 145(3): 229-242 (2016) - Ville Junnila, Tero Laihonen:
Minimum Number of Input Clues in Robust Information Retrieval. Fundam. Informaticae 145(3): 243-256 (2016) - Juhani Karhumäki, Vladimir V. Mazalov, Yuri V. Matiyasevich:
Preface. Fundam. Informaticae 145(3): i-ii (2016) - Jarkko Kari:
Piecewise Affine Functions, Sturmian Sequences and Wang Tiles. Fundam. Informaticae 145(3): 257-277 (2016) - Dmitri V. Karpov:
Minimal k-connected Graphs with Small Number of Vertices of Degree k. Fundam. Informaticae 145(3): 279-312 (2016) - Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
On the Complexity of L-reachability. Fundam. Informaticae 145(4): 471-483 (2016) - Marina Leri, Yuri Pavlov:
Forest Fire Models on Configuration Random Graphs. Fundam. Informaticae 145(3): 313-322 (2016) - Claudio L. M. Martins, Pedro Paulo Balbi de Oliveira:
Computing Modulo-n by Composing Cellular Automata Rules. Fundam. Informaticae 145(1): 1-17 (2016) - Takashi Matsuhisa:
Communication Leading to Subgroup Nash Equilibrium for Generalized Information. Fundam. Informaticae 145(3): 323-340 (2016) - Vladimir V. Mazalov, Konstantin Avrachenkov, L. I. Trukhina, Bulat T. Tsynguev:
Game-Theoretic Centrality Measures for Weighted Graphs. Fundam. Informaticae 145(3): 341-358 (2016) - Benedek Nagy, Tibor Lukic:
Dense Projection Tomography on the Triangular Tiling. Fundam. Informaticae 145(2): 125-141 (2016) - Jacek Pomykala:
Small Generating Sets and DLPC Problem. Fundam. Informaticae 145(2): 143-150 (2016) - Andrei M. Raigorodskii:
Combinatorial Geometry and Coding Theory. Fundam. Informaticae 145(3): 359-369 (2016) - Mikhail Rubinchik, Arseny M. Shur:
The Number of Distinct Subpalindromes in Random Words. Fundam. Informaticae 145(3): 371-384 (2016) - Aleksi Saarela:
Equivalence Relations Defined by Numbers of Occurrences of Factors. Fundam. Informaticae 145(3): 385-397 (2016) - Svetlana N. Selezneva:
On the Multiplicative Complexity of Boolean Functions. Fundam. Informaticae 145(3): 399-404 (2016) - M. A. Shalu, S. Devi Yamini:
A Generalization of Join and an Algorithmic Recognition Problem. Fundam. Informaticae 145(1): 81-91 (2016) - Daniel Simson:
Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification. Fundam. Informaticae 145(1): 19-48 (2016) - Daniel Simson:
Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups. Fundam. Informaticae 145(1): 49-80 (2016) - Yinglei Song, Junfeng Qu, Ying Xu, Liming Cai:
A New Graph Theoretic Approach for Protein Threading. Fundam. Informaticae 145(2): 151-170 (2016) - Miaomiao Tian, Liusheng Huang:
Identity-based Signatures from Lattices: Simpler, Faster, Shorter. Fundam. Informaticae 145(2): 171-187 (2016) - Jiuping Xu, Rui Qiu, Zhimiao Tao:
Rough Approximation Operators in Group Mapping and Their Applications to Coding Theory. Fundam. Informaticae 145(1): 93-109 (2016) - Hong-Ying Yang, Linlin Liang, Yong-Wei Li, Xiangyang Wang:
Quaternion Exponent Moments and Their Invariants for Color Image. Fundam. Informaticae 145(2): 189-205 (2016) - Zhi-Fang Zeng, Jian-Guo Liu, Yan Jiang, Bin Nie:
Transformations and Soliton Solutions for a Variable-coefficient Nonlinear Schrödinger Equation in the Dispersion Decreasing Fiber with Symbolic Computation. Fundam. Informaticae 145(2): 207-219 (2016) - Zhiqiang Zhang, Tingfang Wu, Linqiang Pan:
On String Languages Generated by Sequential Numerical P Systems. Fundam. Informaticae 145(4): 485-509 (2016)
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-06-19 02:30 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