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

Volume 17, Issue 6

1233 -- 1234Jan Holub. Foreword
1235 -- 1252Domenico Cantone, Simone Faro. A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem
1253 -- 1272Loek G. Cleophas, Kees Hemerik, Gerard Zwaan. Two Related Algorithms for Root-to-frontier Tree Pattern Matching
1273 -- 1280Sergio De Agostino. Bounded Size Dictionary Compression: Relaxing the Lru Deletion Heuristic
1281 -- 1296Frantisek Franek, William F. Smyth. Reconstructing a Suffix Array
1297 -- 1306Shmuel T. Klein, Dana Shapira. Compressed Pattern Matching in Jpeg Images
1307 -- 1324Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie. Dynamic Allocation of Finite Automata States for Fast String Recognition
1325 -- 1344Heikki Hyyrö, Gonzalo Navarro. Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights
1345 -- 1364Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro. Flexible Music Retrieval in Sublinear Time
1365 -- 1384Szymon Grabowski, Gonzalo Navarro, Rafal Przywarski, Alejandro Salinger, Veli Mäkinen. A Simple Alphabet-independent Fm-index
1385 -- 1402Élise Prieur, Thierry Lecroq. From Suffix Trees to Suffix Vectors
1403 -- 1422Joseph K. Liu, Duncan S. Wong. Enhanced Security Models and a Generic Construction Approach for Linkable Ring Signature
1423 -- 1440Michel Paquette, Andrzej Pelc. Fast Broadcasting with Byzantine Faults
1441 -- 1454Shuguang Li, Guojun Li, Xingqin Qi. Minimizing Total Weighted Completion Time on Identical Parallel Batch Machines
1455 -- 1466Amr Elmasry. A Priority Queue with the Working-set Property
1467 -- 1484Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier. The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions

Volume 17, Issue 5

1003 -- 1004Seok-Hee Hong, Hsu-Chun Yen. Preface
1005 -- 1016Károly J. Börözky, János Pach, Géza Tóth. Planar Crossing Numbers of Graphs Embeddable in Another Surface
1017 -- 1030Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl. Trémaux Trees and Planarity
1031 -- 1060Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki. Convex Grid Drawings of Four-connected Plane Graphs
1061 -- 1070Maurizio Patrignani. On Extending a Partial Straight-line Drawing
1071 -- 1094Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta. On Embedding a Graph on Two Sets of Points
1095 -- 1114Patrick Healy, Karol Lynch. Two Fixed-parameter Tractable Algorithms for Testing Upward Planarity
1115 -- 1128Kazuyuki Miura, Machiko Azuma, Takao Nishizeki. Convex Drawings of Plane Graphs of Minimum Outer Apices
1129 -- 1142Huaming Zhang, Xin He. An Application of Well-orderly Trees in Graph Drawing
1143 -- 1164Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk. Drawing with Fat Edges
1165 -- 1178Hiroshi Nagamochi. Packing Soft Rectangles
1179 -- 1204Predrag T. Tosic. On the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs
1205 -- 1222Reihaneh Safavi-Naini, Huaxiong Wang, Duncan S. Wong. Resilient Lkh: Secure Multicast Key Distribution Schemes
1223 -- 1230Zbynek Krivka, Alexander Meduna, Rudolf Schönecker. Generation of Languages by Rewriting Systems that Resemble Automata
1231 -- 1232Janusz A. Brzozowski, Helmut Jürgensen. Errata: representation of Semiautomata by Canonical Words and Equivalences

Volume 17, Issue 4

731 -- 732Farn Wang. Preface
733 -- 742E. Allen Emerson, Kristina D. Hager, Jay H. Konieczka. Molecular Model Checking
743 -- 762Doron Peled, Hongyang Qu. Enforcing Concurrent Temporal Behaviors
763 -- 774Freddy Y. C. Mang, Pei-Hsin Ho. Controllability and Cooperativeness Analysis for Automatic Abstraction Refinement
775 -- 796Fang Yu, Bow-Yaw Wang. Sat-based Model Checking for Region Automata
797 -- 814Robi Malik, David Streader, Steve Reeves. Conflicts and Fair Testing
815 -- 832Ivan Cibrario Bertolotti, Luca Durante, Riccardo Sisto, Adriano Valenzano. Exploiting Symmetries for Testing Equivalence Verification in the Spi Calculus
833 -- 850Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino. A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
851 -- 868Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi. Büchi Complementation Made Tighter
869 -- 884Orna Kupferman, Gila Morgenstern, Aniello Murano. Typeness for omega-regular Automata
885 -- 902Ansgar Fehnker, Bruce H. Krogh. Hybrid System Verification Is not a Sinecure - the Electronic Throttle Control Case Study
903 -- 918Tatsuya Akutsu. Algorithms for Point Set Matching with K-differences
919 -- 932Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan. Quantum Octal Games
933 -- 948Xingqin Qi, Guojun Li, Jichang Wu, Bingqiang Liu. Sorting Signed Permutations by Fixed-length Reversals
949 -- 974Yuli Ye, Janusz A. Brzozowski. Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis
975 -- 1002Gheorghe Paun, Mario J. Pérez-Jiménez, Grzegorz Rozenberg. Spike Trains in Spiking Neural P Systems

Volume 17, Issue 3

489 -- 492Clelia de Felice, Antonio Restivo. Preface
493 -- 506Sergey Afonin, Elena Hazova. Membership and Finiteness Problems for Rational Sets of Regular Languages
507 -- 518Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov. Collapsing Words: a Progress Report
519 -- 542Alexis Bès, Olivier Carton. A Kleene Theorem for Languages of Words Indexed by Linear Orderings
543 -- 556Srecko Brlek, Gilbert Labelle, Annie Lacasse. Properties of the Contour Path of Discrete Sets
557 -- 574Aldo de Luca, Alessandro De Luca. Combinatorial Properties of Sturmian Palindromes
575 -- 600Thomas Fernique. Multidimensional Sturmian Sequences and Generalized Substitutions
601 -- 628Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider. Unambiguous Morphic Images of Strings
629 -- 664Alexander Okhotin. Generalized Lr Parsing Algorithm for Boolean Grammars
665 -- 676Elena V. Pribavkina. On some Properties of the Language of 2-collapsing Words
677 -- 702Yung H. Tsin. An Efficient Distributed Algorithm for 3-edge-connectivity
703 -- 729Daiji Fukagawa, Tatsuya Akutsu. Fast Algorithms for Comparison of Similar Unordered Trees

Volume 17, Issue 2

249 -- 250Koji Nakano, Jacir Luiz Bordim. Preface
251 -- 270Thomas Rauber, Gudula Rünger. A Data re-distribution Library for Multi-processor Task Programming
271 -- 286Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L. Trahan. Routing Multiple Width Communications on the Circuit Switched Tree
287 -- 302Mourad Hakem, Franck Butelle. Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
303 -- 322Sharareh Babvey, Anu G. Bourgeois, José Alberto Fernández-Zepeda, Steven W. McLaughlin. Scalable and Efficient Implementations of the Ldpc Decoder Using Reconfigurable Models
323 -- 336Zhenyu Xu, Pradip K. Srimani. Self-stabilizing Anonymous Leader Election in a Tree
337 -- 356Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar. Approximate Block Sorting
357 -- 378Shiyong Lu, Feng Cao, Yi Lu. Pama: a Fast String Matching Algorithm
379 -- 394Yo-Sub Han, Yajun Wang, Derick Wood. Infix-free Regular Expressions and Languages
395 -- 414Zsolt Gazdag. Decidability of the Shape Preserving Property of Bottom-up Tree Transducers
415 -- 434Hong-Chun Hsu, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu. The Spanning Connectivity of the (n, k)-star Graphs
435 -- 464Natasa Jonoska, Joni Burnette Pirnot. Transitivity in Two-dimensional Local Languages Defined by Dot Systems
465 -- 474Juha Honkala. The Base Problem for D0l Parikh Sets
475 -- 488Andrzej Ehrenfeucht, Grzegorz Rozenberg. Covers from Templates

Volume 17, Issue 1

1 -- 2Gheorghe Paun, Mario J. Pérez-Jiménez. Preface
3 -- 25Artiom Alhazov, Rudolf Freund, Marion Oswald. Cell/symbol complexity of tissue P systems with symport/antiport rules
27 -- 48Luca Bianco, Federico Fontana, Vincenzo Manca. P systems with reaction maps
49 -- 68Luca Cardelli, Gheorghe Paun. An universality result for a (mem)brane calculus based on mate/drip operations
69 -- 89Matteo Cavaliere, Vincenzo Deufemia. Further results on time-free P systems
91 -- 110Rodica Ceterchi, Mario J. Pérez-Jiménez. On simulating a class of parallel architectures
111 -- 126Gabriel Ciobanu, Viorel Mihai Gontineac. Mealy multiset automata
127 -- 146Alberto Leporati, Claudio Zandron, Miguel A. Gutiérrez-Naranjo. P systems with input in binary form
147 -- 165Michael Muskulus, Robert Brijder. Complexity of bio-computation: symbolic dynamics in membrane systems
167 -- 181Adam Obtulowicz. Gandy s principles for mechanisms and membrane computing
183 -- 204Dario Pescini, Daniela Besozzi, Giancarlo Mauri, Claudio Zandron. Dynamical probabilistic P systems
205 -- 221Dragos Sburlan. Further results on P systems with promoters/inhibitors
223 -- 245Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis. Completeness and realizability: conditions for automatic generation of workflows
247 -- 0Uli Laube, Maik Weinard. Erratum: Conditional Inequalities And The Shortest Common Superstring Problem