Table of Contents

• On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of ClairvoyanceGiorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura. 1-20 [doi]
• Similarity of Objects and the Meaning of WordsRudi Cilibrasi, Paul M. B. Vitányi. 21-45 [doi]
• Totally < omega:::omega::: Computably Enumerable and ::::m::::-topped DegreesRod Downey, Noam Greenberg. 46-60 [doi]
• Mitosis in Computational ComplexityChristian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang. 61-67 [doi]
• Models of Intuitionistic Set Theories over Partial Combinatory AlgebrasMichael Rathjen. 68-78 [doi]
• Width Versus Size in Resolution ProofsAlasdair Urquhart. 79-88 [doi]
• Recent Progress in Quantum Computational ComplexityAndrew Chi-Chih Yao. 89-89 [doi]
• On Several Scheduling Problems with Rejection or Discretely Compressible Processing TimesZhigang Cao, Zhen Wang, Yuzhong Zhang, Shoupeng Liu. 90-98 [doi]
• LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated AnnealingAi-ling Chen, Zhi-Ming Wu, Gen-Ke Yang. 99-107 [doi]
• A Bounded Item Bin Packing Problem over Discrete DistributionJianxin Chen, Yuhang Yang, Hong Zhu, Peng Zeng. 108-117 [doi]
• Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and AlgorithmsBaoqiang Fan, Guochun Tang. 118-127 [doi]
• Faster Algorithms for Sorting by Transpositions and Sorting by Block-InterchangesJianxing Feng, Daming Zhu. 128-137 [doi]
• An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control SystemsHong Jin, Hui Wang, Hongan Wang, Guozhong Dai. 138-147 [doi]
• Adversary Immune Size Approximation of Single-Hop Radio NetworksJedrzej Kabarowski, Miroslaw Kutylowski, Wojciech Rutkowski. 148-158 [doi]
• On Load-Balanced Semi-matchings for Weighted Bipartite GraphsChor Ping Low. 159-170 [doi]
• Analyzing Chain Programs over Difference ConstraintsK. Subramani, John Argentieri. 171-180 [doi]
• Linear-Time 2-Approximation Algorithm for the Watchman Route ProblemXuehou Tan. 181-191 [doi]
• Further Properties of Cayley Digraphs and Their Applications to Interconnection NetworksWenjun Xiao, Behrooz Parhami. 192-197 [doi]
• Real Time Critical Edge of the Shortest Path in Transportation NetworksYinfeng Xu, Huahai Yan. 198-205 [doi]
• Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of DestinationsBing Yang, S. Q. Zheng. 206-216 [doi]
• A New Approximation Algorithm for the ::::k::::-Facility Location ProblemPeng Zhang. 217-230 [doi]
• Alternative Measures of Computational Complexity with Applications to Agnostic LearningShai Ben-David. 231-235 [doi]
• Disjoint NP-Pairs from Propositional Proof SystemsOlaf Beyersdorff. 236-247 [doi]
• Valiant s Holant Theorem and Matchgate TensorsJin-yi Cai, Vinay Choudhary. 248-261 [doi]
• Variable Minimal UnsatisfiabilityZhenyu Chen, Decheng Ding. 262-273 [doi]
• A New Lower Bound of Critical Function for (k, s)-SATPing Gong, Daoyun Xu. 274-282 [doi]
• Cluster Computing and the Power of Edge RecognitionLane A. Hemaspaandra, Christopher M. Homan, Sven Kosub. 283-294 [doi]
• Quadratic Lower Bounds on Matrix RigiditySatyanarayana V. Lokam. 295-307 [doi]
• Non-reducible Descriptions for Conditional Kolmogorov ComplexityAndrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin. 308-317 [doi]
• Generalized Counters and Reversal ComplexityM. V. Panduranga Rao. 318-326 [doi]
• Multisource Algorithmic Information TheoryAlexander Shen. 327-338 [doi]
• Block Sensitivity of Weakly Symmetric FunctionsXiaoming Sun. 339-344 [doi]
• Optimization Problems in the Polynomial-Time HierarchyChristopher Umans. 345-355 [doi]
• #3-Regular Bipartite Planar Vertex Cover is #P-CompleteMingji Xia, Wenbo Zhao. 356-364 [doi]
• Group Theory Based Synthesis of Binary Reversible CircuitsGuowu Yang, Xiaoyu Song, William N. N. Hung, Fei Xie, Marek A. Perkowski. 365-374 [doi]
• On Some Complexity Issues of NC Analytic FunctionsFuxiang Yu. 375-386 [doi]
• Learning Juntas in the Presence of NoiseJan Arpe, Rüdiger Reischuk. 387-398 [doi]
• Grey Reinforcement Learning for Incomplete Information ProcessingChunlin Chen, Daoyi Dong, ZongHai Chen. 399-407 [doi]
• On the Foundations of Universal Sequence PredictionMarcus Hutter. 408-420 [doi]
• Some Recent Results in U-Shaped LearningSanjay Jain, Frank Stephan. 421-431 [doi]
• Learning Overcomplete Representations with a Generalized Gaussian PriorLingzhi Liao, Siwei Luo, Mei Tian, Lianwei Zhao. 432-441 [doi]
• On PAC Learning Algorithms for Rich Boolean Function ClassesRocco A. Servedio. 442-451 [doi]
• On-Line Regression Competitive with Reproducing Kernel Hilbert SpacesVladimir Vovk. 452-463 [doi]
• Inductive Inference and Language LearningThomas Zeugmann. 464-473 [doi]
• Time Series Predictions Using Multi-scale Support Vector RegressionsDanian Zheng, Jiaxin Wang, Yannan Zhao. 474-481 [doi]
• Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative SplicingJianning Bi, Yanda Li. 482-493 [doi]
• On Probe Permutation GraphsDavid B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng. 494-504 [doi]
• Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural NetworkYong Wang, Ling-Yun Wu, Xiang-Sun Zhang, Luonan Chen. 505-514 [doi]
• Protein Structure Comparison Based on a Measure of Information DiscrepancyZi-Kai Wu, Yong Wang, En-Min Feng, Jin-Cheng Zhao. 515-527 [doi]
• Succinct Text Indexes on Large AlphabetMeng Zhang, Jijun Tang, Dong Guo, Liang Hu, Qiang Li. 528-537 [doi]
• Identity-Based Threshold Proxy Signature Scheme with Known SignersHaiyong Bao, Zhenfu Cao, Shengbao Wang. 538-546 [doi]
• Secure Computations in a Minimal Model Using Multiple-Valued ESOP ExpressionsTakaaki Mizuki, Taro Otagiri, Hideaki Sone. 547-554 [doi]
• Towards Practical Computable Functions on Context-Free LanguagesHaiming Chen, Yunmei Dong. 555-565 [doi]
• The Extended Probabilistic Powerdomain Monad over Stably Compact SpacesBen Cohen, Martín Hötzel Escardó, Klaus Keimel. 566-575 [doi]
• Analysis of Properties of Petri Synthesis NetChuanliang Xia. 576-587 [doi]
• A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic ProgramsZaiyue Zhang, Yuefei Sui, Cungen Cao. 588-600 [doi]
• Object-Oriented Specification Composition and Refinement Via Category Theoretic ComputationsYujun Zheng, Jinyun Xue, Weibo Liu. 601-610 [doi]
• Improved SAT Based Bounded Model CheckingConghua Zhou, Decheng Ding. 611-620 [doi]
• Encodings and Arithmetic Operations in Membrane ComputingCosmin Bonchis, Gabriel Ciobanu, Cornel Izbasa. 621-630 [doi]
• The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog ComputationOlivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry. 631-643 [doi]
• Forecasting Black Holes in Abstract Geometrical Computation is Highly UnpredictableJérôme Durand-Lose. 644-653 [doi]
• The Trade-Off Theorem and Fragments of Gödel s ::::T::::Lars Kristiansen, Paul J. Voda. 654-674 [doi]
• On Non-binary Quantum BCH CodesZhi Ma, Xin Lu, Keqin Feng, Dengguo Feng. 675-683 [doi]
• Maximal Models of Assertion Graph in GSTEGuowu Yang, Jin Yang, Xiaoyu Song, Fei Xie. 684-693 [doi]
• Immunity Properties and the ::::n::::-C.E. HierarchyBahareh Afshari, George Barmpalias, S. Barry Cooper. 694-703 [doi]
• On Rogers SemilatticesSerikzhan Badaev. 704-706 [doi]
• Invertible ClassesSanjay Jain, Jochen Nessel, Frank Stephan. 707-720 [doi]
• Universal Cupping DegreesAngsheng Li, Yan Song, Guohua Wu. 721-730 [doi]
• On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable IdealAngsheng Li, Guohua Wu, Yue Yang. 731-736 [doi]
• Enumeration Degrees of the Bounded Total SetsBoris Solon, Sergey Rozhkov. 737-745 [doi]
• A Generic Set That Does Not Bound a Minimal PairMariya Ivanova Soskova. 746-755 [doi]
• Lowness for Weakly 1-generic and Kurtz-RandomFrank Stephan, Liang Yu. 756-764 [doi]
• On Differences Among Elementary Theories of Finite Levels of Ershov HierarchiesYue Yang, Liang Yu. 765-771 [doi]
• On Mass Problems of PresentabilityAlexey Stukachev. 772-782 [doi]
• Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable?Klaus Weihrauch, Ning Zhong 0002. 783-792 [doi]