3. TAMC 2006:
Beijing,
China
Jin-yi Cai, S. Barry Cooper, Angsheng Li (Eds.):
Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings.
Lecture Notes in Computer Science 3959 Springer 2006, ISBN 3-540-34021-1 BibTeX
Plenary Lectures
- Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura:
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance.
1-20
Electronic Edition (link) BibTeX
- Rudi Cilibrasi, Paul M. B. Vitányi:
Similarity of Objects and the Meaning of Words.
21-45
Electronic Edition (link) BibTeX
- Rod Downey, Noam Greenberg:
Totally < omegaomega Computably Enumerable and m-topped Degrees.
46-60
Electronic Edition (link) BibTeX
- Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Mitosis in Computational Complexity.
61-67
Electronic Edition (link) BibTeX
- Michael Rathjen:
Models of Intuitionistic Set Theories over Partial Combinatory Algebras.
68-78
Electronic Edition (link) BibTeX
- Alasdair Urquhart:
Width Versus Size in Resolution Proofs.
79-88
Electronic Edition (link) BibTeX
- Andrew Chi-Chih Yao:
Recent Progress in Quantum Computational Complexity.
89-89
Electronic Edition (link) BibTeX
Algorithm
- Zhigang Cao, Zhen Wang, Yuzhong Zhang, Shoupeng Liu:
On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times.
90-98
Electronic Edition (link) BibTeX
- Ai-ling Chen, Zhi-ming Wu, Gen-ke Yang:
LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing.
99-107
Electronic Edition (link) BibTeX
- Jianxin Chen, Yuhang Yang, Hong Zhu, Peng Zeng:
A Bounded Item Bin Packing Problem over Discrete Distribution.
108-117
Electronic Edition (link) BibTeX
- Baoqiang Fan, Guochun Tang:
Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms.
118-127
Electronic Edition (link) BibTeX
- Jianxing Feng, Daming Zhu:
Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges.
128-137
Electronic Edition (link) BibTeX
- Hong Jin, Hui Wang, Hongan Wang, Guozhong Dai:
An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems.
138-147
Electronic Edition (link) BibTeX
- Jedrzej Kabarowski, Miroslaw Kutylowski, Wojciech Rutkowski:
Adversary Immune Size Approximation of Single-Hop Radio Networks.
148-158
Electronic Edition (link) BibTeX
- Chor Ping Low:
On Load-Balanced Semi-matchings for Weighted Bipartite Graphs.
159-170
Electronic Edition (link) BibTeX
- K. Subramani, John Argentieri:
Analyzing Chain Programs over Difference Constraints.
171-180
Electronic Edition (link) BibTeX
- Xuehou Tan:
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem.
181-191
Electronic Edition (link) BibTeX
- Wenjun Xiao, Behrooz Parhami:
Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks.
192-197
Electronic Edition (link) BibTeX
- Yinfeng Xu, Huahai Yan:
Real Time Critical Edge of the Shortest Path in Transportation Networks.
198-205
Electronic Edition (link) BibTeX
- Bing Yang, S. Q. Zheng:
Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations.
206-216
Electronic Edition (link) BibTeX
- Peng Zhang:
A New Approximation Algorithm for the k-Facility Location Problem.
217-230
Electronic Edition (link) BibTeX
Computational Complexity
- Shai Ben-David:
Alternative Measures of Computational Complexity with Applications to Agnostic Learning.
231-235
Electronic Edition (link) BibTeX
- Olaf Beyersdorff:
Disjoint NP-Pairs from Propositional Proof Systems.
236-247
Electronic Edition (link) BibTeX
- Jin-yi Cai, Vinay Choudhary:
Valiant's Holant Theorem and Matchgate Tensors.
248-261
Electronic Edition (link) BibTeX
- Zhenyu Chen, Decheng Ding:
Variable Minimal Unsatisfiability.
262-273
Electronic Edition (link) BibTeX
- Ping Gong, Daoyun Xu:
A New Lower Bound of Critical Function for (k, s)-SAT.
274-282
Electronic Edition (link) BibTeX
- Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub:
Cluster Computing and the Power of Edge Recognition.
283-294
Electronic Edition (link) BibTeX
- Satyanarayana V. Lokam:
Quadratic Lower Bounds on Matrix Rigidity.
295-307
Electronic Edition (link) BibTeX
- Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible Descriptions for Conditional Kolmogorov Complexity.
308-317
Electronic Edition (link) BibTeX
- M. V. Panduranga Rao:
Generalized Counters and Reversal Complexity.
318-326
Electronic Edition (link) BibTeX
- Alexander Shen:
Multisource Algorithmic Information Theory.
327-338
Electronic Edition (link) BibTeX
- Xiaoming Sun:
Block Sensitivity of Weakly Symmetric Functions.
339-344
Electronic Edition (link) BibTeX
- Christopher Umans:
Optimization Problems in the Polynomial-Time Hierarchy.
345-355
Electronic Edition (link) BibTeX
- Mingji Xia, Wenbo Zhao:
#3-Regular Bipartite Planar Vertex Cover is #P-Complete.
356-364
Electronic Edition (link) BibTeX
- Guowu Yang, Xiaoyu Song, William N. N. Hung, Fei Xie, Marek A. Perkowski:
Group Theory Based Synthesis of Binary Reversible Circuits.
365-374
Electronic Edition (link) BibTeX
- Fuxiang Yu:
On Some Complexity Issues of NC Analytic Functions.
375-386
Electronic Edition (link) BibTeX
Learning Theory
Bioinformatics
- Jianning Bi, Yanda Li:
Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing.
482-493
Electronic Edition (link) BibTeX
- David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng:
On Probe Permutation Graphs.
494-504
Electronic Edition (link) BibTeX
- Yong Wang, Ling-Yun Wu, Xiang-Sun Zhang, Luonan Chen:
Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural Network.
505-514
Electronic Edition (link) BibTeX
- Zi-Kai Wu, Yong Wang, En-Min Feng, Jin-Cheng Zhao:
Protein Structure Comparison Based on a Measure of Information Discrepancy.
515-527
Electronic Edition (link) BibTeX
- Meng Zhang, Jijun Tang, Dong Guo, Liang Hu, Qiang Li:
Succinct Text Indexes on Large Alphabet.
528-537
Electronic Edition (link) BibTeX
Security
Formal Method
Models of Computation
- Cosmin Bonchis, Gabriel Ciobanu, Cornel Izbasa:
Encodings and Arithmetic Operations in Membrane Computing.
621-630
Electronic Edition (link) BibTeX
- Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry:
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation.
631-643
Electronic Edition (link) BibTeX
- Jérôme Durand-Lose:
Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable.
644-653
Electronic Edition (link) BibTeX
- Lars Kristiansen, Paul J. Voda:
The Trade-Off Theorem and Fragments of Gödel's T.
654-674
Electronic Edition (link) BibTeX
- Zhi Ma, Xin Lu, Keqin Feng, Dengguo Feng:
On Non-binary Quantum BCH Codes.
675-683
Electronic Edition (link) BibTeX
- Guowu Yang, Jin Yang, Xiaoyu Song, Fei Xie:
Maximal Models of Assertion Graph in GSTE.
684-693
Electronic Edition (link) BibTeX
Computatability
- Bahareh Afshari, George Barmpalias, S. Barry Cooper:
Immunity Properties and the n-C.E. Hierarchy.
694-703
Electronic Edition (link) BibTeX
- Serikzhan Badaev:
On Rogers Semilattices.
704-706
Electronic Edition (link) BibTeX
- Sanjay Jain, Jochen Nessel, Frank Stephan:
Invertible Classes.
707-720
Electronic Edition (link) BibTeX
- Angsheng Li, Yan Song, Guohua Wu:
Universal Cupping Degrees.
721-730
Electronic Edition (link) BibTeX
- Angsheng Li, Guohua Wu, Yue Yang:
On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal.
731-736
Electronic Edition (link) BibTeX
- Boris Solon, Sergey Rozhkov:
Enumeration Degrees of the Bounded Total Sets.
737-745
Electronic Edition (link) BibTeX
- Mariya Ivanova Soskova:
A Generic Set That Does Not Bound a Minimal Pair.
746-755
Electronic Edition (link) BibTeX
- Frank Stephan, Liang Yu:
Lowness for Weakly 1-generic and Kurtz-Random.
756-764
Electronic Edition (link) BibTeX
- Yue Yang, Liang Yu:
On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies.
765-771
Electronic Edition (link) BibTeX
Computable Mathematics
Copyright © Sat May 16 23:43:30 2009
by Michael Ley (ley@uni-trier.de)
