Table of Contents

• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning AlgorithmReid Andersen, Fan R. K. Chung. 1-12 [doi]
• Generalizations of the Compactness Theorem and Gödel s Completeness Theorem for Nonstandard Finite StructuresMiklós Ajtai. 13-33 [doi]
• Approximation Algorithms for 3D Orthogonal KnapsackFlorian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas. 34-45 [doi]
• A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone SubsequencesBing Yang, Jing Chen, Enyue Lu, S. Q. Zheng. 46-57 [doi]
• The Hardness of Selective Network Design for Bottleneck Routing GamesHaiyang Hou, Guochuan Zhang. 58-66 [doi]
• A Polynomial Time Algorithm for Finding Linear Interval Graph PatternsHitoshi Yamasaki, Takayoshi Shoudai. 67-78 [doi]
• Elementary Differences Among Jump HierarchiesAngsheng Li. 79-88 [doi]
• Working with the ::::LR:::: DegreesGeorge Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova. 89-99 [doi]
• Computability on Subsets of Locally Compact SpacesYatao Xu, Tanja Grubba. 100-114 [doi]
• A New Approach to Graph Recognition and Applications to Distance-Hereditary GraphsShin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno. 115-127 [doi]
• Finding a Duplicate and a Missing Item in a StreamJun Tarui. 128-135 [doi]
• Directed Searching Digraphs: Monotonicity and ComplexityBoting Yang, Yi Cao. 136-147 [doi]
• Protecting Against Key Escrow and Key Exposure in Identity-Based CryptosystemJin Wang, Xi Bai, Jia Yu, Daxing Li. 148-158 [doi]
• Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate PairingRongquan Feng, Hongfeng Wu. 159-170 [doi]
• A Provably Secure Blind Signature SchemeXiaoming Hu, Shangteng Huang. 171-180 [doi]
• Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2)Pei Shi-Hui, Zhao Yong-Zhe, Zhao Hong-Wei. 181-188 [doi]
• New Left-to-Right Radix- ::::r:::: Signed-Digit Recoding Algorithm for Pairing-Based CryptosystemsFanyu Kong, Jia Yu, Zhun Cai, Daxing Li. 189-198 [doi]
• The Strongest Nonsplitting TheoremMariya Ivanova Soskova, S. Barry Cooper. 199-211 [doi]
• There is an Sw-Cuppable Strongly c.e. RealYun Fan. 212-221 [doi]
• On Computation Complexity of the Concurrently Enabled Transition Set ProblemLi Pan, Weidong Zhao, Zhicheng Wang, Gang Wei, Shumei Wang. 222-233 [doi]
• Synchronization of Some DFAA. N. Trahtman. 234-243 [doi]
• On the Treewidth and Pathwidth of Biconvex Bipartite GraphsSheng-Lung Peng, Yi-Chuan Yang. 244-255 [doi]
• On Exact Complexity of Subgraph HomeomorphismAndrzej Lingas, Martin Wahlen. 256-261 [doi]
• Searching a Polygonal Region by Two GuardsXuehou Tan. 262-273 [doi]
• On the Internal Steiner Tree ProblemSun-Yuan Hsieh, Huang-Ming Gao, Shih-Cheng Yang. 274-283 [doi]
• Approximately Optimal Trees for Group Key Management with Batch UpdatesMinming Li, Ze Feng, Ronald L. Graham, Frances F. Yao. 284-295 [doi]
• On Deciding Deep Holes of Reed-Solomon CodesQi Cheng, Elizabeth Murray. 296-305 [doi]
• Quantum Multiparty Communication Complexity and Circuit Lower BoundsIordanis Kerenidis. 306-317 [doi]
• Efficient Computation of Algebraic Immunity of Symmetric Boolean FunctionsFeng Liu, Keqin Feng. 318-329 [doi]
• Improving the Average Delay of SortingAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer. 330-341 [doi]
• Approximating Capacitated Tree-Routings in NetworksEhab Morsy, Hiroshi Nagamochi. 342-353 [doi]
• Feedback Arc Set Problem in Bipartite TournamentsSushmita Gupta. 354-361 [doi]
• Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc NetworkYufeng Wang, Yoshiaki Hori, Kouichi Sakurai. 362-373 [doi]
• Enhancing Simulation for Checking Language ContainmentJin Yi, Wenhui Zhang. 374-385 [doi]
• QBF-Based Symbolic Model Checking for Knowledge and TimeConghua Zhou, Zhenyu Chen, Zhihong Tao. 386-397 [doi]
• A Characterization of the Language Classes Learnable with Correction QueriesCristina Tîrnauca, Satoshi Kobayashi. 398-407 [doi]
• Learnable Algorithm on the ContinuumZhimin Li, Xiang Li. 408-415 [doi]
• Online Deadline Scheduling with Bounded Energy EfficiencyJoseph Wun-Tat Chan, Tak Wah Lam, Kin-Sum Mak, Prudence W. H. Wong. 416-427 [doi]
• Efficient Algorithms for Airline ProblemShin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno. 428-439 [doi]
• Efficient Exact Arithmetic over Constructive RealsYong Li, Jun-Hai Yong. 440-449 [doi]
• Bounding Run-Times of Local Adiabatic AlgorithmsM. V. Panduranga Rao. 450-461 [doi]
• A Note on Universal Composable Zero Knowledge in Common Reference String ModelAndrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao. 462-473 [doi]
• A Note on the Feasibility of Generalized Universal ComposabilityAndrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao. 474-485 [doi]
• ::::t:::: -Private and Secure AuctionsMarkus Hinkelmann, Andreas Jakoby, Peer Stechert. 486-498 [doi]
• Secure Multiparty Computations Using a Dial LockTakaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone. 499-510 [doi]
• A Time Hierarchy Theorem for Nondeterministic Cellular AutomataChuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai. 511-520 [doi]
• Decidability of Propositional Projection Temporal Logic with Infinite ModelsZhenhua Duan, Cong Tian. 521-532 [doi]
• Separation of Data Via Concurrently Determined Discriminant FunctionsHong Seo Ryoo, Kwangsoo Kim. 533-541 [doi]
• The Undecidability of the Generalized Collatz ProblemStuart A. Kurtz, Janos Simon. 542-553 [doi]
• Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean SpacesYingchao Zhao, Shang-Hua Teng. 554-565 [doi]
• Maximum Edge-Disjoint Paths Problem in Planar GraphsMingji Xia. 566-572 [doi]
• An Efficient Algorithm for Generating Colored Outerplanar GraphsJiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu. 573-583 [doi]
• Orthogonal Drawings for Plane Graphs with Specified Face AreasAkifumi Kawaguchi, Hiroshi Nagamochi. 584-594 [doi]
• Absolutely Non-effective Predicates and Functions in Computable AnalysisDecheng Ding, Klaus Weihrauch, Yongcheng Wu. 595-604 [doi]
• Linear-Size Log-Depth Negation-Limited Inverter for ::::k:::: -Tonic Binary SequencesHiroki Morizumi, Jun Tarui. 605-615 [doi]
• The Existence of Unsatisfiable Formulas in ::::k::::-LCNF for ::::k::::>=3Qingshun Zhang, Daoyun Xu. 616-623 [doi]
• Improved Exponential Time Lower Bound of Knapsack Problem Under BT ModelXin Li, Tian Liu, Han Peng, Liyan Qian, Hongtao Sun, Jin Xu, Ke Xu, Jiaqi Zhu. 624-631 [doi]
• Phase Transition of Multivariate Polynomial SystemsGiordano Fusco, Eric Bach. 632-645 [doi]
• Approximation Algorithms for Maximum Edge Coloring ProblemWangsen Feng, Li ang Zhang, Wanling Qu, Hanpin Wang. 646-658 [doi]
• Two Improved Range-Efficient Algorithms for ::::F:::: ::0:: EstimationHe Sun, Chung Keung Poon. 659-669 [doi]
• Approximation to the Minimum Rooted Star Cover ProblemWenbo Zhao, Peng Zhang. 670-679 [doi]
• Approximability and Parameterized Complexity of Consecutive Ones Submatrix ProblemsMichael Dom, Jiong Guo, Rolf Niedermeier. 680-691 [doi]
• Parameterized Algorithms for Weighted Matching and Packing ProblemsYunlong Liu, Jianer Chen, Jianxin Wang. 692-702 [doi]
• Kernelizations for Parameterized Counting ProblemsMarc Thurley. 703-714 [doi]
• Revisiting the Impossibility for Boosting Service ResilienceXingwu Liu, Zhiwei Xu, Juhua Pu. 715-727 [doi]
• An Approximation Algorithm to the ::::k:::: -Steiner Forest ProblemPeng Zhang. 728-737 [doi]
• A Distributed Algorithm of Fault Recovery for Stateful FailoverIndranil Saha, Debapriyay Mukhopadhyay. 738-749 [doi]
• Path Embedding on Folded HypercubesSun-Yuan Hsieh. 750-759 [doi]
• An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite GraphsJianxin Wang, Xiaoshuang Xu, Jianer Chen. 760-769 [doi]