9. TAMC 2012: Beijing, China
Manindra Agrawal, S. Barry Cooper, Angsheng Li (Eds.): Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings. Springer 2012 Lecture Notes in Computer Science ISBN 978-3-642-29951-3
Turing Lectures 2012
- John E. Hopcroft: On the Impact of Turing Machines. 1-2
- S. Barry Cooper: From Turing Machine to Morphogenesis: Forming and Informing Computation. 3-10
- Richard M. Karp: Theory of Computation as an Enabling Tool for the Sciences. 11
- Butler W. Lampson: What Computers Do: Model, Connect, Engage. 23-26
- Wei Li: R-Calculus: A Logical Inference System for Scientific Discovery. 27
- Andrew Chi-Chih Yao: Quantum Computing: A Great Science in the Making. 28
- Jon M. Kleinberg: The Convergence of Social and Technological Networks. 29
Invited Lectures
- Yicheng Pan: Principles of Network Computing. 30-39
- Pan Peng: The Small Community Phenomenon in Networks: Models, Algorithms and Applications. 40-49
- Zipeng Zhang, Xinyu Feng, Ming Fu, Zhong Shao, Yong Li: A Structural Approach to Prophecy Variables. 61-71
- Shuling Wang, Naijun Zhan, Dimitar P. Guelev: An Assume/Guarantee Based Compositional Calculus for Hybrid CSP. 72-83
- Ernst-Rüdiger Olderog: Automatic Verification of Real-Time Systems with Rich Data: An Overview. 84-93
- Deepak Kapur: Program Analysis Using Quantifier-Elimination Heuristics - (Extended Abstract). 94-108
- Albert F. Lawrence, Seastien Phan, Mark H. Ellisman: Electron Tomography and Multiscale Biology. 109-130
Contributed Papers
- Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida: Constant-Time Approximation Algorithms for the Knapsack Problem. 131-142
- Michal Cerný, Miroslav Rada: Polynomial Time Construction of Ellipsoidal Approximations of Zonotopes Given by Generator Descriptions. 156-163
- Alexandru Popa, Prudence W. H. Wong, Fencol C. C. Yung: Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract). 164-176
- Kun-Mao Chao, An-Chiang Chu, Jesper Jansson, Richard S. Lemence, Alban Mancheron: Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics. 177-188
- Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire: Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. 202-213
- Deshi Ye, Guochuan Zhang: Coordination Mechanisms for Selfish Parallel Jobs Scheduling - (Extended Abstract). 225-236
- Shaoquan Jiang: Timed Encryption with Application to Deniable Key Exchange. 248-259
- Sheng Yu, Jude-Thaddeus Ojiaku, Prudence W. H. Wong, Yinfeng Xu: Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines. 260-272
- Jun Yan: A Surprisingly Simple Way of Reversing Trace Distance via Entanglement. 273-283
- Jun Zhang, Fang-Wei Fu: Constructions for Binary Codes Correcting Asymmetric Errors from Function Fields. 284-294
- Jun Zhang, Fang-Wei Fu, Daqing Wan: Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves. 295-306
- Lin Wang, Antonio Fernández Anta, Fa Zhang, Chenying Hou, Zhiyong Liu: Energy-Efficient Network Routing with Discrete Cost Functions. 307-318
- Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru: An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. 319-329
- Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, R. de Verclos: The Worst Case Behavior of Randomized Gossip. 330-345
- Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu: Finite Automata over Structures - (Extended Abstract). 373-384
- Nathaniel Hobbs, Yuexuan Wang, Qiang-Sheng Hua, Dongxiao Yu, Francis C. M. Lau: Deterministic Distributed Data Aggregation under the SINR Model. 385-399
- Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita, Yasuhiko Nakashima: Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication. 400-411
- Weiwei Wu, Minming Li, He Huang, Enhong Chen: Speed Scaling Problems with Memory/Cache Consideration. 412-422
- Sanjay Jain, Frank Stephan, Thomas Zeugmann: On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data. 423-434
- Denys Duchier, Jérôme Durand-Lose, Maxime Senot: Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants. 435-447
- Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks: Online Optimization of Busy Time on Parallel Machines - (Extended Abstract). 448-460
- Jordi Arjona Aroca, Antonio Fernández Anta: Bisection (Band)Width of Product Networks with Application to Data Centers. 461-472
- Beate Bollig, Marc Gillé, Tobias Pröger: Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations. 473-486
- Teng Long, Wenhui Zhang: Proving Liveness Property under Strengthened Compassion Requirements. 498-508
- Eugen Jiresch, Bernhard Gramlich: Realizing Monads in Interaction Nets via Generic Typed Rules. 509-524
- Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich: Towards an Axiomatization of Simple Analog Algorithms. 525-536
- Rusins Freivalds: Multiple Usage of Random Bits in Finite Automata. 537-547
- Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada: Minimum Certificate Dispersal with Tree Structures. 548-559
- Jianxin Wang, Jinyi Yao, Qilong Feng, Jianer Chen: Improved FPT Algorithms for Rectilinear k-Links Spanning Path. 560-571
- Hiroshi Nagamochi: Submodular Minimization via Pathwidth. 584-593
- Martin Nehéz, Daniel Olejár, Michal Demetrian: A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs. 594-603
- Liliana Badillo, Charles M. Harris: An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees. 604-620
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team