Journal: Theoretical Computer Science

Volume 378, Issue 3

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

Volume 378, Issue 2

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

Volume 378, Issue 1

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