


default search action
International Journal of Foundations of Computer Science, Volume 27
Volume 27, Number 1, January 2016
- Peng Wu, Minsoo Ryu:

EDZL Scheduling and Schedulability Analysis for Performance Asymmetric Multiprocessors. 1-14 - Slavcho Shtrakov

, Ivo Damyanov
:
On the Computational Complexity of Finite Operations. 15-38 - Wen Chean Teh

:
Separability of M-Equivalent Words by Morphisms. 39-52 - ChangYuan Wang, Daiyuan Peng, LiMengNan Zhou:

New Constructions of Optimal Frequency-Hopping Sequence Sets with Low-Hit-Zone. 53-66 - Marin Bertier, Matthieu Perrin, Cédric Tedeschi:

On the Complexity of Concurrent Multiset Rewriting. 67-84 - Lunzhi Deng, Jiwen Zeng, Huawei Huang:

Efficient Certificateless Proxy Signature Scheme. 85-
Volume 27, Number 2, February 2016
- Arseny M. Shur:

Preface. 101-102 - Yuri Gurevich:

Past Present. 103-108 - Sven De Felice, Cyril Nicaud:

Average Case Analysis of Brzozowski's Algorithm. 109-126 - Jorge Almeida

, Emanuele Rodaro:
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. 127-146 - Dmitry Berdinsky, Bakhadyr Khoussainov:

Cayley Automatic Representations of Wreath Products. 147-160 - Markus Holzer

, Sebastian Jakobi:
Minimal and Hyper-Minimal Biautomata. 161-186 - Martin Kutrib

, Andreas Malcher
, Matthias Wendlandt:
Set Automata. 187-214 - Salvatore La Torre, Margherita Napoli, Gennaro Parlato

:
Scope-Bounded Pushdown Languages. 215-234 - Pierre-Alain Reynier, Jean-Marc Talbot:

Visibly Pushdown Transducers with Well-Nested Outputs. 235-258 - Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz

:
New Results on the Minimum Amount of Useful Space. 259-282 - Abuzer Yakaryilmaz

, A. C. Cem Say
, H. Gökalp Demirci:
Debates with Small Transparent Quantum Verifiers. 283-
Volume 27, Number 3, April 2016
- Szilárd Zsolt Fazekas

, Kayoko Shikishima-Tsuji, Akihiro Yamamura
:
Preface. 301-304 - Jing Tian, Yong Shao, Xianzhong Zhao:

Out Subword-Free Languages and Its Subclasses. 305-326 - Yoshiyuki Kunimochi:

Some Properties of Extractable Codes and Insertable Codes. 327-342 - Peter Leupold:

General Idempotency Languages Over Small Alphabets. 343-358 - Alexander Meduna

, Ondrej Soukup:
Simple Matrix Grammars and Their Leftmost Variants. 359-374 - Kayoko Shikishima-Tsuji:

Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words. 375-390 - Hiroyuki Chigahara, Szilárd Zsolt Fazekas

, Akihiro Yamamura
:
One-Way Jumping Finite Automata. 391-
Volume 27, Number 4, June 2016
- Janusz Januszewski

, Lukasz Zielonka
:
Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing. 407-430 - Michael Forsyth, Amlesh Jayakumar, Jarkko Peltomäki

, Jeffrey O. Shallit:
Remarks on Privileged Words. 431-442 - Shanding Xu, Xiwang Cao, Guangkui Xu:

Optimal Frequency-Hopping Sequence Sets Based on Cyclotomy. 443-462 - Yongjia Wang, Xi Xiong, Haining Fan:

GF(2n) Redundant Representation Using Matrix Embedding for Irreducible Trinomials. 463-478 - Somnath Bera

, Kalpana Mahalingam
:
Some Algebraic Aspects of Parikh q-Matrices. 479-500 - Zongtian Wei, Nannan Qi, Xiaokui Yue:

Vertex-Neighbor-Scattering Number of Bipartite Graphs. 501-510 - Carole J. Etherington, Matthew W. Anderson, Eric Bach, Jon T. Butler, Pantelimon Stanica

:
A Parallel Approach in Computing Correlation Immunity up to Six Variables. 511-
Volume 27, Number 5, August 2016
- Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman

:
Algorithms for Longest Common Abelian Factors. 529-544 - Wen Chean Teh

:
Parikh Matrices and Strong M-Equivalence. 545-556 - Vojtech Vorel:

Subset Synchronization and Careful Synchronization of Binary Finite Automata. 557-578 - Savio S. H. Tse:

Belated Analyses of Three Credit-Based Adaptive Polling Algorithms. 579-594 - Xianfang Wang, Jian Gao, Fang-Wei Fu:

Secret Sharing Schemes from Linear Codes overFp + vFp. 595-606 - Eddy Caron, Ajoy Kumar Datta, Franck Petit

, Cédric Tedeschi:
Self-Stabilizing Prefix Tree Based Overlay Networks. 607-630 - Julien Cassaigne, Idrissa Kaboré:

Abelian Complexity and Frequencies of Letters in Infinite Words. 631-650 - Alexander Meduna, Ondrej Soukup:

Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]". 651-
Volume 27, Number 6, September 2016
- Wenming Zhang, E. Zhang, Feifeng Zheng:

Online Two Stage k-Search Problem and Its Competitive Analysis. 653-664 - Jiyong Lu, Jun Zhang, Xuan Guang, Fang-Wei Fu:

Multiple Repair Localities with Distinct Erasure Tolerance. 665-674 - Pascal Caron, Jean-Gabriel Luque, Ludovic Mignot, Bruno Patrou:

State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach. 675-704 - Sang-Ki Ko

, Hae-Sung Eom, Yo-Sub Han:
Operational State Complexity of Subtree-Free Regular Tree Languages. 705-724 - Ersin Aslan:

Weak-Rupture Degree of Graphs. 725-738 - Ferhan Nihan Altundag, Goksen Bacak-Turan

:
Neighbor Rupture Degree of Harary Graphs. 739-756 - Adrian Atanasiu, Wen Chean Teh

:
A New Operator over Parikh Languages. 757-770 - Édouard Bonnet, Florian Sikora:

A Note on Edge Isoperimetric Numbers and Regular Graphs. 771-774
Volume 27, Number 7, November 2016
- Lakshmanan Kuppusamy, Indhumathi Raman, Kamala Krithivasan:

On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems. 775-786 - Peter Kostolányi

, Branislav Rovan:
Automata with Auxiliary Weights. 787-808 - David Caissy, Andrzej Pelc:

Exploration of Faulty Hamiltonian Graphs. 809-828 - Satoshi Fujita:

On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs. 829-844 - Huijie Xu, Wandong Cai, Guirong Chen:

Forums-Oriented Research on the Spreading and Inhibition of Rumors. 845-862 - Yo-Sub Han, Sang-Ki Ko

, Timothy Ng
, Kai Salomaa:
State Complexity of Insertion. 863-878 - Zibi Xiao

, Xiangyong Zeng, Zhimin Sun:
2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences. 879-
Volume 27, Number 8, December 2016
- Francis Y. L. Chin, Oscar H. Ibarra, Sartaj K. Sahni:

Announcement. 895-896 - Haibo Liu, Qunying Liao:

Some New Constructions for Generalized Zero-Difference Balanced Functions. 897-908 - Saeid Alirezazadeh

:
On Pseudovarieties of Forest Algebras. 909-942 - Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:

Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties. 943-964 - Sang-Ki Ko

, Ha-Rim Lee, Yo-Sub Han:
State Complexity of Regular Tree Languages for Tree Matching. 965-980 - Toru Fujita, Koji Nakano

, Yasuaki Ito:
Fast Simulation of Conway's Game of Life Using Bitwise Parallel Bulk Computation on a GPU. 981-

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














