Theoretical Computer Science, Volume 378

Volume 378, Number 1, June 2007

• Grzegorz Rozenberg:
  Preface. 1-2
  

• Mark Daley, Michael Domaratzki:
  On codes defined by bio-operations. 3-16
  
• Yuriy Brun:
  Arithmetic computation in the tile assembly model: Addition and multiplication. 17-31
  
• Frank Neumann, Ingo Wegener:
  Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. 32-40
  
• Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita:
  Improved algorithms for quantum identification of Boolean oracles. 41-53
  
• Sébastien Vérel, Philippe Collard, Marco Tomassini, Leonardo Vanneschi:
  Fitness landscape of the cellular automata majority problem: View from the "Olympus". 54-77
  
• El-Ghazali Talbi, Benjamin Weinberg:
  Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem. 78-86
  
• Dezhong Peng, Zhang Yi:
  Convergence analysis of the OJAn MCA learning algorithm by the deterministic discrete time method. 87-100
  
• Elham Kashefi, Iordanis Kerenidis:
  Statistical Zero Knowledge and quantum one-way functions. 101-116
  
• Gabriel Ciobanu, Linqiang Pan, Gheorghe Paun, Mario J. Pérez-Jiménez:
  P systems with minimal parallelism. 117-130
  

• Florin Manea, Carlos Martín-Vide, Victor Mitrana:
  Erratum to: "Accepting networks of splicing processors: Complexity results" [Theoret. Comput. Sci. 371(2007) 72-82]. 131
  

Volume 378, Number 2, June 2007

• Xiaotie Deng:
  Preface. 133
  

• Yinyu Ye:
  Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality. 134-142
  
• Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani:
  A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. 143-152
  
• Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani:
  An auction-based market equilibrium algorithm for a production model. 153-164
  
• Simon Fischer, Berthold Vöcking:
  On the structure and complexity of worst-case equilibria. 165-174
  
• Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami:
  Subjective-cost policy routing. 175-189
  
• Gang Cheng, Ping Li, Peng Shi:
  A new algorithm based on copulas for VaR valuation with empirical calculations. 190-197
  
• Robert W. Zhu, Guomin Yang, Duncan S. Wong:
  An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices. 198-207
  

Volume 378, Number 3, June 2007

• Zhi-Zhong Chen, Xiaotie Deng, Ding-Zhu Du:
  Preface. 209-210
  

• Sumit Ganguly:
  Counting distinct items over update streams. 211-222
  
• Erdong Chen, Linji Yang, Hao Yuan:
  Longest increasing subsequences in windows based on canonical antichain partition. 223-236
  
• Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir:
  Efficient algorithms for center problems in cactus networks. 237-252
  
• Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
  Decision-making based on approximate and smoothed Pareto curves. 253-270
  
• Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
  Average case analysis for tree labelling schemes. 271-291
  
• Bodo Manthey, Rüdiger Reischuk:
  Smoothed analysis of binary search trees. 292-315
  
• Lan Liu, Chen Xi, Jing Xiao, Tao Jiang:
  Complexity and approximation of the minimum recombinant haplotype configuration problem. 316-330