International Journal of Foundations of Computer Science, Volume 20

Volume 20, Number 1, February 2009

• Joachim Gudmundsson, James Harland:
  Preface. 1-2
  
• Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
  Constructing Optimal Highways. 3-23
  
• Heidi Gebauer, Yoshio Okamoto:
  Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. 25-44
  
• Regant Y. S. Hung, Hing-Fung Ting:
  A Near-Optimal Broadcasting Protocol for Mobile Video-on-Demand. 45-55
  
• Jeremy E. Dawson, Rajeev Goré:
  Termination of Abstract Reduction Systems. 57-82
  
• Peter Morris, Thorsten Altenkirch, Neil Ghani:
  A Universe of Strictly Positive Families. 83-107
  
• Damien Vergnaud:
  New Extensions of Pairing-Based Signatures into Universal (Multi) Designated Verifier Signatures. 109-133
  
• Joachim Gudmundsson, Michiel H. M. Smid:
  On Spanners of Geometric Graphs. 135-149
  
• Virgil Nicolae Serbanuta:
  On Parikh Matrices, Ambiguity, and PRINTS. 151-165
  
• Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
  Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. 167-183
  
• Hartmut Messerschmidt, Friedrich Otto:
  On Deterministic CD-Systems of Restarting Automata. 185-209
  

Volume 20, Number 2, April 2009

• K. G. Subramanian, Ang Miin Huey, Atulya K. Nagar:
  On Parikh Matrices. 211-219
  
• Torsten Stüber, Heiko Vogler, Zoltán Fülöp:
  Decomposition of Weighted multioperator Tree Automata. 221-245
  
• Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich:
  Single Machine Scheduling with Controllable Processing Times by submodular Optimization. 247-269
  
• Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
  Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates. 271-291
  
• Katalin Anna Lázár, Erzsébet Csuhaj-Varjú, András Lörincz, György Vaszil:
  Dynamically formed Clusters of Agents in Eco-Grammar Systems. 293-311
  
• Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti:
  Testing Embeddability between Metric Spaces. 313-329
  
• Tomás Masopust:
  On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. 331-340
  
• Ondrej Zajícek:
  A Note on Scheduling Parallel Unit Jobs on Hypercubes. 341-349
  
• Cheng-Chi Lee, Min-Shiang Hwang, Shiang-Feng Tzeng:
  A New Convertible Authenticated Encryption Scheme Based on the ElGamal Cryptosystem. 351-359
  
• Danny Z. Chen, Mark A. Healy, Chao Wang, Bin Xu:
  Geometric Algorithms for the Constrained 1-d k-Means Clustering Problems and IMRT Applications. 361-377
  

Volume 20, Number 3, June 2009

• Petr Sosík:
  Preface. 379-380
  
• Gabriel Ciobanu, Viorel Mihai Gontineac:
  Encodings of Multisets. 381-393
  
• Dorel Lucanu:
  Rewriting Logic-Based Semantics of P Systems and the Maximal Concurrency. 395-410
  
• Thomas Hinze, Raffael Faßler, Thorsten Lenser, Peter Dittrich:
  Register Machine Computations on Binary Numbers by oscillating and Catalytic Chemical reactions Modelled Using Mass-Action kinetics. 411-426
  
• Francisco José Romero-Campero, Jamie Twycross, Miguel Cámara, Malcolm Bennett, Marian Gheorghe, Natalio Krasnogor:
  Modular Assembly of Cell Systems Biology Models Using P Systems. 427-442
  
• Clemens Heuberger, Helmut Prodinger:
  Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations. 443-453
  
• Vladimir Rogojin:
  Successful Elementary Gene Assembly Strategies. 455-477
  
• Sanguthevar Rajasekaran, Vamsi Kundeti:
  Spectrum Based Techniques for Graph Isomorphism. 479-499
  
• Christian Glaßer, Alan L. Selman, Liyu Zhang:
  The Informational Content of Canonical Disjoint NP-Pairs. 501-522
  
• Josef Sprojcar:
  Proposal of a Semiformal Model of Anonymous Communication. 523-548
  
• Haydeh Ahrabian, Abbas Nowzari-Dalini, Fatemeh Zare-Mirakabad:
  A Constant Time Algorithm for DNA Add. 549-558
  

Volume 20, Number 4, August 2009

• Oscar H. Ibarra, Bala Ravikumar:
  Preface. 559-561
  
• Markus Holzer, Martin Kutrib:
  Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity. 563-580
  
• Hsu-Chun Yen:
  Path Decomposition and Semilinearity of Petri Nets. 581-596
  
• Ryan Dixon, Ömer Egecioglu, Timothy Sherwood:
  Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching. 597-612
  
• Cyril Allauzen, Mehryar Mohri:
  N-Way Composition of Weighted Finite-State Transducers. 613-627
  
• Giovanni Pighizzini:
  Deterministic Pushdown Automata and Unary Languages. 629-645
  
• François Cantin, Axel Legay, Pierre Wolper:
  Computing Convex Hulls by Automata Iteration. 647-667
  
• Marco Almeida, Nelma Moreira, Rogério Reis:
  Antimirov and Mosses's Rewrite System Revisited. 669-684
  
• Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
  Composed Bisimulation for Tree Automata. 685-700
  
• Harald Hempel, Madlen Kimmritz:
  Aspects of Persistent Computations. 701-715
  
• Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda:
  A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. 717-733
  
• Andrew Badr:
  HYPER-MINIMIZATION IN O(n²). 735-746
  
• Yih-Kuen Tsay, Bow-Yaw Wang:
  Automated Compositional Reasoning of Intuitionistically Closed Regular Properties. 747-762
  
• Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne:
  An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical. 763-774