default search action
International Journal of Foundations of Computer Science, Volume 31
Volume 31, Number 1, January 2020
- Erzsébet Csuhaj-Varjú, Florin Manea:
Preface - Special Issue: A Collection of Papers in Honour of the 60th Birthday of Victor Mitrana. 1-6 - Fernando Arroyo
, Sandra Gómez Canaval
A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors. 7-21 - Somnath Bera
Parikh q-Matrices and q-Ambiguous Words. 23-36 - Henning Bordihn, György Vaszil:
Deterministic Lindenmayer Systems with Dynamic Control of Parallelism. 37-51 - Paolo Bottoni
Networks of Reaction Systems. 53-71 - Jürgen Dassow, Bianca Truthe:
Networks with Evolutionary Processors and Ideals and Codes as Filters. 73-89 - Szilárd Zsolt Fazekas
On the Prefix-Suffix Duplication Reduction. 91-102 - Luis Fernando de Mingo López
Swarm Intelligence Models: Ant Colony Systems Applied to BNF Grammars Rule Derivation. 103-116 - Andrei Paun, Florin-Daniel Bîlbîe:
Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application. 117-132 - José M. Sempere:
On Compensation Loops in Genomic Duplications. 133-142 - Cristina Tîrnauca
Closed-Set-Based Discovery of Representative Association Rules. 143-156
Volume 31, Number 2, February 2020
- Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS. 157-174 - Yinxia Sun, Futai Zhang, Anmin Fu
CCA-Secure and Revocable Certificateless Encryption with Ciphertext Evolution. 175-191 - Jiaxian Lv, Yi Wang, Jinshu Su, Rongmao Chen, Wenjun Wu:
Security of Auditing Protocols Against Subversion Attacks. 193-206 - Hatem M. Bahig
A Unified Method for Private Exponent Attacks on RSA Using Lattices. 207-231 - Yuejuan Han
Communication Performance Evaluation of the Locally Twisted Cube. 233-252 - Tatsuya Akutsu
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree. 253-273 - Manjanna Basappa
Constrained k-Center Problem on a Convex Polygon. 275-291
Volume 31, Number 3, April 2020
- Minghui Yang, Jiejing Wen
On the k-error Linear Complexity of Subsequences of d-ary Sidel'nikov Sequences Over Prime Field 𝔽d. 293-300 - Zhongxiao Wang
Constructing de Bruijn Sequences Based on a New Necessary Condition. 301-312 - Mei-Mei Gu
On Component Connectivity of Hierarchical Star Networks. 313-326 - Gang Wang
Constructions of (r, t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields. 327-339 - Hironori Ando, Satoshi Fujita
Tight Bounds on the Upload Capacity to Enable Two-Hop Delivery in Peer-to-Peer Video Streaming Systems. 341-354 - Ke Chen
Selection Algorithms with Small Groups. 355-369 - Jing Li
Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements. 371-383 - Subhrangsu Mandal
Convergecast Tree on Temporal Graphs. 385-409 - Masamichi Kuroda
Monomial Generalized Almost Perfect Nonlinear Functions. 411-419
Volume 31, Number 4, June 2020
- Sanjib Sadhu, Sasanka Roy, Soumen Nandi
Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. 421-443 - Shunzhe Zhang
On g-Extra Conditional Diagnosability of Twisted Hypercubes under MM∗ Model. 445-459 - Markus Hittmeir
A Reduction of Integer Factorization to Modular Tetration. 461-481 - Ahmet Çevik:
Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties. 483-498 - Shanding Xu
Simplified Bounds on FHSs Set and Its Strictly Optimal Construction. 499-513 - Benedek Nagy
On the Membership Problem of Permutation Grammars - A Direct Proof of NP-Completeness. 515-525 - Grzegorz Madejski
Membership Problem for Two-Dimensional General Row Jumping Finite Automata. 527-538
Volume 31, Number 5, August 2020
- Andreas Kosmatopoulos
A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles. 539-549 - Juyan Li
Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting. 551-567 - Lianhua Wang, Xiaoni Du
Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus. 569-581 - Saeid Alirezazadeh
Weak Separation Problem for Tree Languages. 583-593 - Hayam Alamro
Efficient Identification of k-Closed Strings. 595-610 - Ameneh Farhadian
Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs. 611-619 - Zi Jing Chern, K. G. Subramanian
A New Study of Parikh Matrices Restricted to Terms. 621-638 - Ömer Egecioglu, Elif Saygi
k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes. 639-661
Volume 31, Number 6, September 2020
- Shinnosuke Seki:
Special Issue Developments in Language Theory 2018 - Preface. 663-665 - Jason P. Bell, Thomas F. Lidbetter, Jeffrey O. Shallit:
Additive Number Theory via Approximation by Regular Languages. 667-687 - Shaull Almagor, Michaël Cadilhac
Weak Cost Register Automata are Still Powerful. 689-709 - Emmanuel Filiot, Nicolas Mazzocchi
A Pattern Logic for Automata with Outputs. 711-748 - Patrick Landwehr, Christof Löding:
Projection for Büchi Tree Automata with Constraints between Siblings. 749-775 - Costanza Catalano
The Synchronizing Probability Function for Primitive Sets of Matrices. 777-803 - Simon Beier, Markus Holzer
Decidability of Right One-Way Jumping Finite Automata. 805-825 - Lukas Fleischer:
The Intersection Problem for Finite Semigroups. 827-842 - Nicolas Baudru, Pierre-Alain Reynier:
From Two-Way Transducers to Regular Function Expressions. 843-873
Volume 31, Number 7, November 2020
- Zexia Shi
New Constructions of Codebooks Nearly Meeting the Welch Bound. 875-889 - Kalpana Mahalingam
Watson-Crick Jumping Finite Automata. 891-913 - Natasa Jonoska
Symbol Separation in Double Occurrence Words. 915-928 - Tongtong Ding, Min Xu
The Non-inclusive Diagnosability of Hypercubes under the MM* Model. 929-940 - Parikshit Saikia
Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE. 941-968 - Aysun Asena Kunt, Zeynep Nihan Berberler:
Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks. 969-978
Volume 31, Number 8, December 2020
- Cezar Câmpeanu
Implementations and Applications of Automata 2018: Preface. 979-982 - Stavros Konstantinidis, Nelma Moreira
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels. 983-1019 - Holger Bock Axelsen, Martin Kutrib
Boosting Reversible Pushdown and Queue Machines by Preprocessing. 1021-1049 - Samira Attou, Ludovic Mignot, Djelloul Ziadi:
The Bottom-Up Position Tree Automaton and the Father Automaton. 1051-1068 - Laurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs, Matthieu Picantin:
A New Hierarchy for Automaton Semigroups. 1069-1089 - Mikhail V. Berlinkov, Cyril Nicaud:
Synchronizing Almost-Group Automata. 1091-1112 - Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula
State Complexity of Overlap Assembly. 1113-1132 - Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero
Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. 1133-1157 - Michal Hospodár
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations. 1159-1177 - Oscar H. Ibarra, Ian McQuillan
Semilinearity of Families of Languages. 1179-1198
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-11-19 20:35 CET 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: