default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 32
Volume 32, Number 1, January 2021
- Tangliu Wen
, Jie Peng, Jinyun Xue, Zhen You, Lan Song:
Strict Linearizability and Abstract Atomicity. 1-35 - Priscila P. Camargo, Uéverton S. Souza, Julliano R. Nascimento:
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms. 37-52 - Chunfang Li, Shangwei Lin, Shengjia Li:
Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model. 53-72 - Jinhui Liu, Yong Yu, Bo Yang, Jianwei Jia, Qiqi Lai:
Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family. 73-91 - Vadim E. Levit, David Tankus:
Recognizing Generating Subgraphs Revisited. 93-114
Volume 32, Number 2, February 2021
- Ting Yao, Shixin Zhu, Binbin Pang:
Triple Cyclic Codes Over 픽q + u픽q. 115-135 - Litao Guo, Mingzu Zhang, Shaohui Zhai, Liqiong Xu:
Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks. 137-149 - Yuxing Yang:
Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks. 151-162 - Toshihiro Koga:
A Proof of Parikh's Theorem via Dickson's Lemma. 163-173 - Ikhlass Ammar, Yamen El Touati, John Mullins, Moez Yeddes:
Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language. 175-202 - Thijmen J. P. Krebs:
A More Reasonable Proof of Cobham's Theorem. 203-207 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation with Edge Modifications. 209-233
Volume 32, Number 3, April 2021
- Yali Lv, Cheng-Kuan Lin, Guijuan Wang:
An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation. 235-252 - Rong Wang, Xiaoni Du, Cuiling Fan, Zhihua Niu:
Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions. 253-267 - Zeynep Nihan Berberler, Halil Ibrahim Yildirim, Tolga Iltüzer, Izzet Tunç:
Agglomeration-Based Node Importance Analysis in Wheel-Type Networks. 269-288 - Xirong Xu, Huifeng Zhang, Ziming Wang, Qiang Zhang, Peng Zhang:
(n - 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn. 289-304 - Yihong Wang, Cheng-Kuan Lin, Shuming Zhou, Tao Tian:
Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube. 305-330 - Amit Sharma, P. Venkata Subba Reddy:
Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs. 331-339
Volume 32, Number 4, June 2021
- Arturo Carpi, Flavio D'Alessandro:
On the Commutative Equivalence of Algebraic Formal Series and Languages. 341-367 - Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Search on a Line by Byzantine Robots. 369-387 - Albert Guan:
A Lightweight Key Agreement Protocol with Authentication Capability. 389-404 - Shiying Wang:
The r-Extra Diagnosability of Hyper Petersen Graphs. 405-416
Volume 32, Number 5, August 2021
- Markus Holzer, Martin Kutrib:
Preface. 417-418 - Cyril Nicaud, Pablo Rotondo:
Random Regular Expression Over Huge Alphabets. 419-438 - Jürgen Dassow:
Further Remarks on the Operational Nonterminal Complexity. 439-453 - Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej:
Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem. 455-480 - Oscar H. Ibarra, Ian McQuillan:
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. 481-508 - Sang-Ki Ko, Yo-Sub Han, Kai Salomaa:
Generalizations of Code Languages with Marginal Errors. 509-529 - Sang-Ki Ko, Yo-Sub Han:
Left is Better Than Right for Reducing Nondeterminism of NFAs. 531-550 - Benedek Nagy:
Union-Freeness Revisited - Between Deterministic and Nondeterministic Union-Free Languages. 551-573 - Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Reoto Morita, Shinnosuke Seki:
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami. 575-596 - Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit:
An Inequality for the Number of Periods in a Word. 597-614
Volume 32, Number 6, September 2021
- Natasa Jonoska, Dmytro Savchuk:
Preface. 615-617 - Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo:
Reconstructing Words from Right-Bounded-Block Words. 619-640 - Lukas Fleischer, Jeffrey O. Shallit:
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages. 641-662 - Johan Kopra:
On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts. 663-683 - Lila Kari, Timothy Ng:
Descriptional Complexity of Semi-Simple Splicing Systems. 685-711 - Augusto Modanese:
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata. 713-731 - Florent Koechlin, Cyril Nicaud, Pablo Rotondo:
Simplifications of Uniform Expressions Specified by Systems. 733-760 - Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-Word Transducers. 761-783 - Collin Bleak:
Normalish Amenable Subgroups of the R. Thompson Groups. 785-800 - Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. 801-823
Volume 32, Number 7, November 2021
- Oscar H. Ibarra, Sartaj K. Sahni:
Announcement. 825 - Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz:
Error-Free Affine, Unitary, and Probabilistic OBDDs. 827-847 - Mengyue Cao, Tongtong Ding, Min Xu:
The (n, k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph. 849-860 - Jiejing Wen, Fang-Wei Fu:
On the Construction of Multiply Constant-Weight Codes. 861-870 - Ömer Egecioglu, Elif Saygi, Zülfükar Saygi:
Alternate Lucas Cubes. 871-899 - Olivier Finkel:
Two Effective Properties of ω-Rational Functions. 901-920
Volume 32, Number 8, December 2021
- Bo Zhou, Zhenan Li, Haiyan Guo:
Extremal Results on Vertex and Link Residual Closeness. 921-941 - Huazhong Lü, Tingzeng Wu:
Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest. 943-956 - Chenli Shen, Wensong Lin:
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities. 957-979 - Boris Ryabko:
A Pseudo-Random Generator Whose Output is a Normal Sequence. 981-989
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 2025-01-29 21:18 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:
