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