| Description |
1 online resource (xv, 622 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 7287 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7287.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
On the Impact of Turing Machines / John Hopcroft -- From Turing Machine to Morphogenesis: Forming and Informing Computation / S. Barry Cooper -- Theory of Computation as an Enabling Tool for the Sciences / Richard M. Karp -- Interaction and Collective Intelligence on the Internet / Deyi Li and Liwei Huang -- What Computers Do: Model, Connect, Engage / Butler Lampson -- R-Calculus: A Logical Inference System for Scientific Discovery / Wei Li -- Quantum Computing: A Great Science in the Making / Andrew Chi-Chih Yao -- The Convergence of Social and Technological Networks / Jon Kleinberg -- Principles of Network Computing / Yicheng Pan -- The Small Community Phenomenon in Networks: Models, Algorithms and Applications / Pan Peng -- Vertex-Pursuit in Hierarchical Social Networks / A. Bonato, D. Mitsche and P. Prałat -- A Structural Approach to Prophecy Variables / Zipeng Zhang, Xinyu Feng, Ming Fu, Zhong Shao and Yong Li -- An Assume/Guarantee Based Compositional Calculus for Hybrid CSP / Shuling Wang, Naijun Zhan and Dimitar Guelev -- Automatic Verification of Real-Time Systems with Rich Data: An Overview / Ernst-Rüdiger Olderog -- Program Analysis Using Quantifier-Elimination Heuristics / Deepak Kapur -- Electron Tomography and Multiscale Biology / Albert F. Lawrence, Séastien Phan and Mark Ellisman -- Constant-Time Approximation Algorithms for the Knapsack Problem / Hiro Ito, Susumu Kiyoshima and Yuichi Yoshida |
|
Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices / Jingguo Bi and Qi Cheng -- Polynomial Time Construction of Ellipsoidal Approximations of Zonotopes Given by Generator Descriptions / Michal Černý and Miroslav Rada -- Hardness and Approximation of the Asynchronous Border Minimization Problem / Alexandru Popa, Prudence W.H. Wong and Fencol C.C. Yung -- Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics / Kun-Mao Chao, An-Chiang Chu, Jesper Jansson, Richard S. Lemence and Alban Mancheron -- Computing Bits of Algebraic Numbers / Samir Datta and Rameshwar Pratap -- Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms / Bruno Escoffier, Vangelis Th. Paschos and Emeric Tourniaire -- Computing Error Distance of Reed-Solomon Codes / Guizhen Zhu and Daqing Wan -- Coordination Mechanisms for Selfish Parallel Jobs Scheduling / Deshi Ye and Guochuan Zhang -- Computationally-Fair Group and Identity-Based Key-Exchange / Andrew C. Yao and Yunlei Zhao -- Timed Encryption with Application to Deniable Key Exchange / Shaoquan Jiang -- Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines / Sheng Yu, Jude-Thaddeus Ojiaku, Prudence W.H. Wong and Yinfeng Xu -- A Surprisingly Simple Way of Reversing Trace Distance via Entanglement / Jun Yan -- Constructions for Binary Codes Correcting Asymmetric Errors from Function Fields / Jun Zhang and Fang-Wei Fu |
|
Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves / Jun Zhang, Fang-Wei Fu and Daqing Wan -- Energy-Efficient Network Routing with Discrete Cost Functions / Lin Wang, Antonio Fernández Anta, Fa Zhang, Chenying Hou and Zhiyong Liu -- An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval / Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel and Romeo Rizzi, et al. -- The Worst Case Behavior of Randomized Gossip / H. Baumann, P. Fraigniaud, H.A. Harutyunyan and R. de Verclos -- Holographic Algorithms on Domain Size k> 2 / Zhiguo Fu and Jin-Yi Cai -- A Refined Exact Algorithm for Edge Dominating Set / Mingyu Xiao and Hiroshi Nagamochi -- Finite Automata over Structures / Aniruddh Gandhi, Bakhadyr Khoussainov and Jiamou Liu -- Deterministic Distributed Data Aggregation under the SINR Model / Nathaniel Hobbs, Yuexuan Wang, Qiang-Sheng Hua, Dongxiao Yu and Francis C.M. Lau -- Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication / Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita and Yasuhiko Nakashima -- Speed Scaling Problems with Memory/Cache Consideration / Weiwei Wu, Minming Li, He Huang and Enhong Chen -- On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data / Sanjay Jain, Frank Stephan and Thomas Zeugmann -- Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants / Denys Duchier, Jérôme Durand-Lose and Maxime Senot -- Online Optimization of Busy Time on Parallel Machines / Mordechai Shalom, Ariella Voloshin, Prudence W.H. Wong, Fencol C.C. Yung and Shmuel Zaks |
|
Bisection (Band)Width of Product Networks with Application to Data Centers / Jordi Arjona Aroca and Antonio Fernández Anta -- Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations / Beate Bollig, Marc Gillé and Tobias Pröger -- A Game-Theoretic Approach for Balancing the Tradeoffs between Data Availability and Query Delay in Multi-hop Cellular Networks / Jin Li, Weiyi Liu and Kun Yue -- Proving Liveness Property under Strengthened Compassion Requirements / Teng Long and Wenhui Zhang -- Realizing Monads in Interaction Nets via Generic Typed Rules / Eugen Jiresch and Bernhard Gramlich -- Towards an Axiomatization of Simple Analog Algorithms / Olivier Bournez, Nachum Dershowitz and Evgenia Falkovich -- Multiple Usage of Random Bits in Finite Automata / Rūsiņš Freivalds -- Minimum Certificate Dispersal with Tree Structures / Taisuke Izumi, Tomoko Izumi, Hirotaka Ono and Koichi Wada -- Improved FPT Algorithms for Rectilinear k-Links Spanning Path / Jianxin Wang, Jinyi Yao, Qilong Feng and Jianer Chen -- FPT Results for Signed Domination / Ying Zheng, Jianxin Wang, Qilong Feng and Jianer Chen -- Submodular Minimization via Pathwidth / Hiroshi Nagamochi -- A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs / Martin Nehéz, Daniel Olejár and Michal Demetrian -- An Application of 1-Genericity in the P0202 Enumeration Degrees / Liliana Badillo and Charles M. Harris |
| Summary |
Annotation This book constitutes the refereed proceedings of the 9th International Conference on Theory and Applications of Models of Computation, TAMC 2012, held in Beijing, China, in May 2012. The conference was combined with the Turing Lectures 2012, dedicated to celebrating Alan Turings unique impact on mathematics, computing, computer science, informatics, morphogenesis, philosophy, and the wider scientific world. Eight Turing Lectures were given at the TAMC 2012. The 40 revised full papers presented together with invited talks were carefully reviewed and selected from 86 submissions. The papers address 4 special sessions at TAMC 2012 which were algorithms and information in networks, complexity and cryptography, models of computing and networking, programming and verification |
| Analysis |
Computer science |
|
Data structures (Computer science) |
|
Information theory |
|
Computer software |
|
Logic design |
|
Theory of Computation |
|
Mathematics of Computing |
|
Algorithm Analysis and Problem Complexity |
|
Logics and Meanings of Programs |
|
Data Structures, Cryptology and Information Theory |
|
Mathematical Logic and Formal Languages |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
wiskunde |
|
mathematics |
|
logica |
|
logic |
|
computertechnieken |
|
computer techniques |
|
computational science |
|
informatietheorie |
|
gegevensstructuren |
|
data structures |
|
computerwetenschappen |
|
computer sciences |
|
computerwiskunde |
|
computational mathematics |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references and author index |
| Subject |
Computer science -- Mathematics -- Congresses
|
|
Computational complexity -- Congresses
|
|
Turing machines -- Congresses
|
|
Informatique.
|
|
Computational complexity
|
|
Computer science -- Mathematics
|
|
Turing machines
|
| Genre/Form |
Conference papers and proceedings
|
|
Software.
|
| Form |
Electronic book
|
| Author |
Agrawal, Manindra, 1966-
|
|
Cooper, S. B. (S. Barry)
|
|
Li, Angsheng.
|
| ISBN |
9783642299520 |
|
3642299520 |
|
