Journal: Int. J. Found. Comput. Sci.

Volume 21, Issue 6

873 -- 874Oscar H. Ibarra, Hsu-Chun Yen. Preface
875 -- 891Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. One-Space Bounded Algorithms for Two-Dimensional Bin Packing
893 -- 904Anna Adamaszek, Artur Czumaj, Andrzej Lingas. Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k
905 -- 924Marek Karpinski, Andrzej Rucinski, Edyta Szymanska. Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density
925 -- 939Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao. Finding All Approximate Gapped Palindromes
963 -- 978Paul C. Bell, Igor Potapov. On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups
979 -- 991Cheng-Chi Lee, Rui-Xiang Chang, Hsien-Ju Ko. Improving Two Novel Three-Party Encrypted Key Exchange Protocols with Perfect Forward Secrecy
993 -- 1004Radu-Florian Atanasiu. Parikh Matrix Mapping and Languages
1005 -- 1019Ming Xu, Liangyu Chen, Zhenbing Zeng, Zhi-Bin Li. Termination Analysis of Linear Loops
1021 -- 1033Adrian Atanasiu. Parikh Matrices, Amiability and Istrail Morphism
1035 -- 1047Alberto Apostolico, Claudia Tagliacollo. Optimal Extraction of Irredundant Motif Bases
1049 -- 1063Yanli Ren, Dawu Gu, Shuozhong Wang, Xinpeng Zhang. Hierarchical Identity-Based Proxy Re-Encryption without Random Oracles
1065 -- 1071Tomi Kärki. A New Proof of the Three-Squares Lemma for Partial Words with One Hole
1073 -- 1088Junping Zhou, Ping Huang, Minghao Yin, Chunguang Zhou. Phase Transitions of EXPSPACE-Complete Problems
1089 -- 1100Vamsi Kundeti, Sanguthevar Rajasekaran. On the Hardness of the Border Length Minimization Problem on a Rectangular Array

Volume 21, Issue 5

687 -- 688Erzsébet Csuhaj-Varjú, Zoltán Ésik. Preface
689 -- 704Sergey Afonin, Elena Khazova. On the Structure of Finitely Generated Semigroups of Unary Regular Languages
705 -- 722Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin. Fine and Wilf s Theorem for Partial Words with Arbitrarily Many Weak Periods
723 -- 740Jürgen Dassow, Ralf Stiebe, Bianca Truthe. Generative Capacity of Subregularly Tree Controlled Grammars
741 -- 760Michael Kaminski, Daniel Zeitlin. Finite-Memory Automata with Non-Deterministic Reassignment
761 -- 780Ondrej Klíma, Libor Polák. Literally Idempotent Languages and their Varieties - Two Letter Case
781 -- 798Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto. On Stateless Two-Pushdown Automata and Restarting Automata
799 -- 815Tommi Lehtinen, Alexander Okhotin. Boolean Grammars and GSM Mappings
817 -- 841Markus Lohrey. Compressed Membership Problems for Regular Expressions and Hierarchical Automata
843 -- 858Andreas Malcher, Carlo Mereghetti, Beatrice Palano. Sublinearly Space Bounded Iterative Arrays
859 -- 872Florin Manea, Victor Mitrana, Takashi Yokomori. Some Remarks on the Hairpin Completion

Volume 21, Issue 4

0 -- 0Masami Ito. Preface
479 -- 493Anil Ada. On the Non-Deterministic Communication Complexity of Regular Languages
495 -- 516Frédérique Bassino, Laura Giambruno, Cyril Nicaud. The Average State Complexity of Rational Operations on Finite Languages
517 -- 533Ondrej Klíma, Libor Polák. Hierarchies of Piecewise Testable Languages
535 -- 547Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera. Number of Occurrences of powers in Strings
549 -- 569Erzsébet Csuhaj-Varjú, Jürgen Dassow, György Vaszil. Variants of Competence-Based Derivations in CD Grammar Systems
571 -- 596Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Tree Automata with Global Constraints
597 -- 618Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit. Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time
619 -- 631Jens Glöckler. A Taxonomy of Deterministic Forgetting Automata
633 -- 645Stepan Holub, Dirk Nowotka. On the Relation between Periodicity and Unbordered Factors of Finite Words
647 -- 664Roberto Mantaci, Sabrina Mantaci, Antonio Restivo. Balance Properties and Distribution of Squares in Circular Words
665 -- 685Rémi Morin. Unambiguous Shared-Memory Systems

Volume 21, Issue 3

257 -- 276Andreas Maletti, Catalin Ionut Tîrnauca. Properties of Quasi-Relabeling Tree Bimorphisms
277 -- 287Oliver Friedmann. The Stevens-Stirling-Algorithm for Solving Parity Games Locally Requires Exponential Time
289 -- 309Henning Schnoor. The Complexity of Model Checking for Boolean Formulas
311 -- 319Aysun Ozan Aytaç, Zeynep Nihan Odabas. Computing the rupture Degree in Composite Graphs
321 -- 327Yen-Wu Ti, Ching-Lueh Chang, Yuh-Dauh Lyuu, Alexander Shen. Sets of k-Independent Strings
329 -- 344Mihaela Paun, Nichamon Naksinehaboon, Raja Nassar, Chokchai Leangsuksun, Stephen L. Scott, Narate Taerat. Incremental Checkpoint Schemes for Weibull Failure Distribution
345 -- 356Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg. Combinatorics of Life and Death for Reaction Systems
357 -- 383Hans Kellerer, Vitaly A. Strusevich. Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack
385 -- 386Jacir Luiz Bordim, Akihiro Fujiwara, Koji Nakano. Preface
387 -- 404Martti Forsell. On the Performance and Cost of Some PRAM Models on CMP Hardware
405 -- 425Yasuaki Ito, Koji Nakano. Low-Latency Connected Component Labeling Using an FPGA
427 -- 440Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. The Space Complexity of Leader Election in Anonymous Networks
441 -- 457Stefan D. Bruda, Yuanqiao Zhang. Collapsing the Hierarchy of Parallel Computational Models
459 -- 476Sayaka Kamei, Hirotsugu Kakugawa. A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set

Volume 21, Issue 2

0 -- 0Kedar S. Namjoshi, Tomohiro Yoneda. Preface
115 -- 134Geng-Dian Huang, Bow-Yaw Wang. Complete SAT-Based Model Checking for Context-Free Processes
135 -- 165Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin. On the Efficient Computation of the Minimal Coverability Set of Petri Nets
167 -- 189Orna Kupferman, Yoad Lustig. Latticed Simulation Relations and Games
191 -- 210Scott Little, David Walter, Kevin Jones, Chris J. Myers, Alper Sen. Analog/Mixed-Signal Circuit Verification Using Models Generated from Simulation Traces
211 -- 233Edith Elkind, Blaise Genest, Doron Peled, Paola Spoletini. Quantifying the Discord: Order Discrepancies in Message Sequence Charts
235 -- 256Laura Recalde, Serge Haddad, Manuel Silva. Continuous Petri Nets: Expressive Power and Decidability Issues

Volume 21, Issue 1

1 -- 25Etsuro Moriya, Friedrich Otto. On Alternating Phrase-Structure Grammars
27 -- 49Klaus Jansen, Roberto Solis-Oba. Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints
51 -- 59Yung-Hsing Peng, Chang-Biau Yang, Kuo-Tsung Tseng, Kuo-Si Huang. An Algorithm and Applications to Sequence Alignment with Weighted Constraints
61 -- 72Ching-Lueh Chang, Yuh-Dauh Lyuu. Efficient Testing of Forecasts
73 -- 90Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang. Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2:::M:::, 2)
91 -- 111Arto Salomaa, Sheng Yu. Subword Occurrences, Parikh Matrices and Lyndon Images