International Journal of Foundations of Computer Science, Volume 17

Volume 17, Number 1, February 2006

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

• Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis:
  Completeness and realizability: conditions for automatic generation of workflows. 223-245
  

• Uli Laube, Maik Weinard:
  Erratum: "Conditional Inequalities And The Shortest Common Superstring Problem". 247-
  

Volume 17, Number 2, April 2006

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

Volume 17, Number 3, June 2006

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

Volume 17, Number 4, August 2006

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

Volume 17, Number 5, October 2006

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

Volume 17, Number 6, December 2006

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