Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 30
Volume 30, Number 1, January 2019
- Émilie Charlier, Julien Leroy, Michel Rigo:
Preface. 1-4 - Simon Beier, Markus Holzer
, Martin Kutrib:
Operational State Complexity and Decidability of Jumping Finite Automata. 5-27 - Michiel de Bondt, Henk Don, Hans Zantema:
Lower Bounds for Synchronizing Word Lengths in Partial Automata. 29-60 - Alice L. L. Gao, Sergey Kitaev, Wolfgang Steiner, Philip B. Zhang:
On a Greedy Algorithm to Construct Universal Cycles for Permutations. 61-72 - Zsolt Gazdag, Krisztián Tichler, Erzsébet Csuhaj-Varjú:
A Pumping Lemma for Permitting Semi-Conditional Languages. 73-92 - François Gonze, Vladimir V. Gusev, Raphaël M. Jungers, Balázs Gerencsér, Mikhail V. Volkov:
On the Interplay Between Černý and Babai's Conjectures. 93-114 - Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Descriptional Complexity of the Forever Operator. 115-134 - Michal Kunc, Jan Meitner:
The Generalized Rank of Trace Languages. 135-169 - Gwénaël Richomme:
Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property. 171-196
Volume 30, Number 2, February 2019
- Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. 197-230 - Rolf Klein, Elmar Langetepe, Barbara Schwarzwald, Christos Levcopoulos, Andrzej Lingas:
On a Fire Fighter's Problem. 231-246 - Guangyan Zhou, Rui Kang:
On the Lower Bounds of (1, 0)-Super Solutions for Random k-SAT. 247-254 - Min-Shiang Hwang, Cheng-Chi Lee, Shih-Ting Hsu:
An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme. 255-273 - Xianping Liu, Yuan Chen, Yunge Xu, Zhimin Sun:
Triple-Cycle Permutations Over Finite Fields of Characteristic Two. 275-292 - Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel H. M. Smid:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. 293-313 - Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal:
Explicit Communication Among Stigmergic Robots. 315-332 - Miguel Couceiro, Miklós Maróti, Tamás Waldhauser, László Zádori:
Computing Version Spaces in the Qualitative Approach to Multicriteria Decision Aid. 333-353
Volume 30, Number 3, April 2019
- Cristina G. Fernandes, Carlos E. Ferreira, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Prices of Anarchy of Selfish 2D Bin Packing Games. 355-374 - Joan Boyar, Faith Ellen:
Tight Bounds for Restricted Grid Scheduling. 375-405 - Daitao Huang, Minjia Shi, Patrick Solé:
Double Circulant Self-Dual and LCD Codes Over ℤp2. 407-416 - Esin Yigit, Zeynep Nihan Berberler:
A Note on the Link Residual Closeness of Graphs Under Join Operation. 417-424 - Barun Gorain, Partha Sarathi Mandal:
Approximation Algorithms for Barrier Sweep Coverage. 425-448 - Olivier Finkel:
Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words. 449-467 - Xiaofang Xu, Chunlei Li, Xiangyong Zeng:
Nonsingular Polynomials from Feedback Shift Registers. 469-487
Volume 30, Number 4, June 2019
- Yong Yu, Guomin Yang, Huaxiong Wang:
Preface: Special Issue Cryptography and Provable Security. 489-492 - Yi-Fan Tseng, Chun-I Fan, Cheng-Wei Sung:
On the Anonymity of Multi-Receiver Identity-Based Encryption Based on Fujisaki-Okamoto Transformation. 493-509 - Fatemeh Rezaeibagha, Yi Mu, Shiwei Zhang, Xiaofen Wang:
Provably Secure (Broadcast) Homomorphic Signcryption. 511-529 - Zhongyuan Yao, Yi Mu:
ACE with Compact Ciphertext Size and Decentralized Sanitizers. 531-549 - Wenjuan Meng, Jianhua Ge, Tao Jiang:
Secure Data Deduplication with Reliable Data Deletion in Cloud. 551-570 - Zifeng Xu, Fucai Zhou, Yuxi Li, Jian Xu, Qiang Wang:
Privacy-Preserving Subgraph Matching Protocol for Two Parties. 571-588 - Qiqi Lai, Bo Yang, Zhe Xia, Yannan Li, Yuan Chen, Zhenlong Li:
Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model. 589-606 - Yupu Hu, Zhizhu Lian, Jiangshan Chen, Baocang Wang, Shanshan Zhang:
Algebraic Attacks Against Several Weak Variants of GVW'13 ABE. 607-618 - Burong Kang, Xinyu Meng, Lei Zhang, Yinxia Sun:
Nonce-Based Key Agreement Protocol Against Bad Randomness. 619-633 - Xiangxin Liu, Xiaoyuan Yang, Yiliang Han, Xu An Wang:
A Secure and Efficient Code-Based Signature Scheme. 635-645 - Libing Wu, Yubo Zhang, Kim-Kwang Raymond Choo, Debiao He:
Pairing-Free Identity-Based Encryption with Authorized Equality Test in Online Social Networks. 647-664 - Yinghui Zhang, Menglei Yang, Dong Zheng, Tiantian Zhang, Rui Guo, Fang Ren:
Leakage-Resilient Hierarchical Identity-Based Encryption with Recipient Anonymity. 665-681
Volume 30, Number 5, August 2019
- Hossein Teimoori Faal:
A Multiset Version of Even-Odd Permutations Identity. 683-691 - Pingshan Li, Min Xu:
Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults. 693-717 - Ghajendran Poovanandran, Wen Chean Teh:
Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence. 719-733 - Gang Wang, Min-Yao Niu, Fang-Wei Fu:
Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2. 735-757 - Priti Kumari, Pramod Kumar Kewat:
2-Adic and Linear Complexities of a Class of Whiteman's Generalized Cyclotomic Sequences of Order Four. 759-779 - Aysun Aytaç, Betül Atay Atakul:
Exponential Domination Critical and Stability in Some Graphs. 781-791 - Shu-Li Zhao, Rong-Xia Hao:
The Generalized Connectivity of Bubble-Sort Star Graphs. 793-809 - Hüseyin Tokat, Alpay Kirlangiç:
On the Domination Integrity. 811-826
Volume 30, Numbers 6-7, September & November 2019
- Cezar Câmpeanu, Giovanni Pighizzini:
Preface. 827-829 - Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Sensing as a Complexity Measure. 831-873 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Sets of Pictures Avoiding Overlaps. 875-898 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On Average Behaviour of Regular Expressions in Strong Star Normal Form. 899-920 - Janusz A. Brzozowski, Sylvie Davies:
Most Complex Non-Returning Regular Languages. 921-957 - Jürgen Dassow:
Operational Accepting State Complexity: The Unary and Finite Case. 959-978 - Rachel Faran, Orna Kupferman:
A Parametrized Analysis of Algorithms on Hierarchical Graphs. 979-1003 - Rudolf Freund, Vladimir Rogojin, Sergey Verlan:
Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors. 1005-1027 - Kitti Gelle, Szabolcs Iván:
Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info. 1029-1045 - Yo-Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki:
Self-Attraction Removal from Oritatami Systems. 1047-1067 - Markus Holzer, Martin Kutrib:
One-Time Nondeterministic Computations. 1069-1089 - Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej:
Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation. 1091-1115 - Galina Jirásková, Ivana Krajnáková:
Square on Deterministic, Alternating, and Boolean Finite Automata. 1117-1134 - Chris Keeler, Kai Salomaa:
Branching Measures and Nearly Acyclic NFAs. 1135-1155 - Giovanna J. Lavado, Luca Prigioniero:
Concise Representations of Reversible Automata. 1157-1175 - Marina I. Maslennikova:
Reset Complexity of Ideal Languages Over a Binary Alphabet. 1177-1196 - Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Suffix Distance. 1197-1216 - Alexander Okhotin, Kai Salomaa:
State Complexity of the Quotient Operation on Input-Driven Pushdown Automata. 1217-1235
Volume 30, Number 8, December 2019
- Qiang Fu, Ruihu Li, Fang-Wei Fu, Yi Rao:
On the Construction of Binary Optimal LCD Codes with Short Length. 1237-1245 - Xirong Xu, Huifeng Zhang, Sijia Zhang, Yuansheng Yang:
Fault-Tolerant Panconnectivity of Augmented Cubes AQn. 1247-1278 - Sraban Kumar Mohanty, Sajith Gopalan:
An Input/Output Efficient Algorithm for Hessenberg Reduction. 1279-1300 - Liqiong Xu, Shuming Zhou, Weihua Yang:
Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions. 1301-1315 - Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Uncountable Realtime Probabilistic Classes. 1317-1333 - Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say:
New Results on Vector and Homing Vector Automata. 1335-1361 - Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti:
Cobham's Theorem and Automaticity. 1363-1379
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-05-31 18:41 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:
