3. TAMC 2006:
Beijing, China
Plenary Lectures
Michael Rathjen:
Models of Intuitionistic Set Theories over Partial Combinatory Algebras.
68-78
Algorithm
Jianxing Feng,
Daming Zhu:
Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges.
128-137
Chor Ping Low:
On Load-Balanced Semi-matchings for Weighted Bipartite Graphs.
159-170
Xuehou Tan:
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem.
181-191
Yinfeng Xu,
Huahai Yan:
Real Time Critical Edge of the Shortest Path in Transportation Networks.
198-205
Bing Yang,
S. Q. Zheng:
Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations.
206-216
Peng Zhang:
A New Approximation Algorithm for the k-Facility Location Problem.
217-230
Computational Complexity
Shai Ben-David:
Alternative Measures of Computational Complexity with Applications to Agnostic Learning.
231-235
Xiaoming Sun:
Block Sensitivity of Weakly Symmetric Functions.
339-344
Fuxiang Yu:
On Some Complexity Issues of NC Analytic Functions.
375-386
Learning Theory
Marcus Hutter:
On the Foundations of Universal Sequence Prediction.
408-420
Rocco A. Servedio:
On PAC Learning Algorithms for Rich Boolean Function Classes.
442-451
Vladimir Vovk:
On-Line Regression Competitive with Reproducing Kernel Hilbert Spaces.
452-463
Bioinformatics
Jianning Bi,
Yanda Li:
Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing.
482-493
Security
Formal Method
Chuanliang Xia:
Analysis of Properties of Petri Synthesis Net.
576-587
Models of Computation
Jérôme Durand-Lose:
Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable.
644-653
Computatability
Yue Yang,
Liang Yu:
On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies.
765-771
Computable Mathematics
Klaus Weihrauch,
Ning Zhong:
Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable?
783-792
data released under the ODC-BY 1.0 license
