default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. TAMC 2006: Beijing, China
- Jin-yi Cai, S. Barry Cooper, Angsheng Li:
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
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 - Rudi Cilibrasi, Paul M. B. Vitányi:
Similarity of Objects and the Meaning of Words. 21-45 - Rod Downey, Noam Greenberg:
Totally < ωω Computably Enumerable and m-topped Degrees. 46-60 - Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Mitosis in Computational Complexity. 61-67 - Michael Rathjen:
Models of Intuitionistic Set Theories over Partial Combinatory Algebras. 68-78 - Alasdair Urquhart:
Width Versus Size in Resolution Proofs. 79-88 - Andrew Chi-Chih Yao:
Recent Progress in Quantum Computational Complexity. 89-89
Algorithm
- Zhigang Cao, Zhen Wang, Yuzhong Zhang, Shoupeng Liu:
On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times. 90-98 - Ai-ling Chen, Zhi-Ming Wu, Gen-ke Yang:
LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing. 99-107 - Jianxin Chen, Yuhang Yang, Hong Zhu, Peng Zeng:
A Bounded Item Bin Packing Problem over Discrete Distribution. 108-117 - Baoqiang Fan, Guochun Tang:
Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms. 118-127 - Jianxing Feng, Daming Zhu:
Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges. 128-137 - Hong Jin, Henry (Hui) Wang, Hongan Wang, Guozhong Dai:
An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems. 138-147 - Jedrzej Kabarowski, Miroslaw Kutylowski, Wojciech Rutkowski:
Adversary Immune Size Approximation of Single-Hop Radio Networks. 148-158 - Chor Ping Low:
On Load-Balanced Semi-matchings for Weighted Bipartite Graphs. 159-170 - K. Subramani, John Argentieri:
Analyzing Chain Programs over Difference Constraints. 171-180 - Xuehou Tan:
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem. 181-191 - Wenjun Xiao, Behrooz Parhami:
Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks. 192-197 - 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 - Olaf Beyersdorff:
Disjoint NP-Pairs from Propositional Proof Systems. 236-247 - Jin-yi Cai, Vinay Choudhary:
Valiant's Holant Theorem and Matchgate Tensors. 248-261 - Zhenyu Chen, Decheng Ding:
Variable Minimal Unsatisfiability. 262-273 - Ping Gong, Daoyun Xu:
A New Lower Bound of Critical Function for (k, s)-SAT. 274-282 - Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub:
Cluster Computing and the Power of Edge Recognition. 283-294 - Satyanarayana V. Lokam:
Quadratic Lower Bounds on Matrix Rigidity. 295-307 - Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible Descriptions for Conditional Kolmogorov Complexity. 308-317 - M. V. Panduranga Rao:
Generalized Counters and Reversal Complexity. 318-326 - Alexander Shen:
Multisource Algorithmic Information Theory. 327-338 - Xiaoming Sun:
Block Sensitivity of Weakly Symmetric Functions. 339-344 - Christopher Umans:
Optimization Problems in the Polynomial-Time Hierarchy. 345-355 - Mingji Xia, Wenbo Zhao:
#3-Regular Bipartite Planar Vertex Cover is #P-Complete. 356-364 - Guowu Yang, Xiaoyu Song, William N. N. Hung, Fei Xie, Marek A. Perkowski:
Group Theory Based Synthesis of Binary Reversible Circuits. 365-374 - Fuxiang Yu:
On Some Complexity Issues of NC Analytic Functions. 375-386
Learning Theory
- Jan Arpe, Rüdiger Reischuk:
Learning Juntas in the Presence of Noise. 387-398 - Chunlin Chen, Daoyi Dong, Zonghai Chen:
Grey Reinforcement Learning for Incomplete Information Processing. 399-407 - Marcus Hutter:
On the Foundations of Universal Sequence Prediction. 408-420 - Sanjay Jain, Frank Stephan:
Some Recent Results in U-Shaped Learning. 421-431 - Lingzhi Liao, Siwei Luo, Mei Tian, Lianwei Zhao:
Learning Overcomplete Representations with a Generalized Gaussian Prior. 432-441 - 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 - Thomas Zeugmann:
Inductive Inference and Language Learning. 464-473 - Danian Zheng, Jiaxin Wang, Yannan Zhao:
Time Series Predictions Using Multi-scale Support Vector Regressions. 474-481
Bioinformatics
- Jianning Bi, Yanda Li:
Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing. 482-493 - David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng:
On Probe Permutation Graphs. 494-504 - 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 - Zikai Wu, Yong Wang, En-Min Feng, Jin-Cheng Zhao:
Protein Structure Comparison Based on a Measure of Information Discrepancy. 515-527 - Meng Zhang, Jijun Tang, Dong Guo, Liang Hu, Qiang Li:
Succinct Text Indexes on Large Alphabet. 528-537
Security
- Haiyong Bao, Zhenfu Cao, Shengbao Wang:
Identity-Based Threshold Proxy Signature Scheme with Known Signers. 538-546 - Takaaki Mizuki, Taro Otagiri, Hideaki Sone:
Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions. 547-554
Formal Method
- Haiming Chen, Yunmei Dong:
Towards Practical Computable Functions on Context-Free Languages. 555-565 - Ben Cohen, Martín Hötzel Escardó, Klaus Keimel:
The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces. 566-575 - Chuanliang Xia:
Analysis of Properties of Petri Synthesis Net. 576-587 - Zaiyue Zhang, Yuefei Sui, Cungen Cao:
A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs. 588-600 - Yujun Zheng, Jinyun Xue, Weibo Liu:
Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations. 601-610 - Conghua Zhou, Decheng Ding:
Improved SAT Based Bounded Model Checking. 611-620
Models of Computation
- Cosmin Bonchis, Gabriel Ciobanu, Cornel Izbasa:
Encodings and Arithmetic Operations in Membrane Computing. 621-630 - Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry:
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. 631-643 - Jérôme Durand-Lose:
Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable. 644-653 - Lars Kristiansen, Paul J. Voda:
The Trade-Off Theorem and Fragments of Gödel's T. 654-674 - Zhi Ma, Xin Lu, Keqin Feng, Dengguo Feng:
On Non-binary Quantum BCH Codes. 675-683 - Guowu Yang, Jin Yang, Xiaoyu Song, Fei Xie:
Maximal Models of Assertion Graph in GSTE. 684-693
Computatability
- Bahareh Afshari, George Barmpalias, S. Barry Cooper:
Immunity Properties and the n-C.E. Hierarchy. 694-703 - Serikzhan A. Badaev:
On Rogers Semilattices. 704-706 - Sanjay Jain, Jochen Nessel, Frank Stephan:
Invertible Classes. 707-720 - Angsheng Li, Yan Song, Guohua Wu:
Universal Cupping Degrees. 721-730 - Angsheng Li, Guohua Wu, Yue Yang:
On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal. 731-736 - Boris Solon, Sergey Rozhkov:
Enumeration Degrees of the Bounded Total Sets. 737-745 - Mariya Ivanova Soskova:
A Generic Set That Does Not Bound a Minimal Pair. 746-755 - Frank Stephan, Liang Yu:
Lowness for Weakly 1-generic and Kurtz-Random. 756-764 - Yue Yang, Liang Yu:
On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies. 765-771
Computable Mathematics
- Alexey Stukachev:
On Mass Problems of Presentability. 772-782 - Klaus Weihrauch, Ning Zhong:
Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable? 783-792
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-27 01:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
