Borrow it
Coverart for item
The Resource Theory and applications of models of computation : 9th annual conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings, Manindra Agrawal, S. Barry Cooper, Angsheng Li (eds.), (electronic book)

Theory and applications of models of computation : 9th annual conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings, Manindra Agrawal, S. Barry Cooper, Angsheng Li (eds.), (electronic book)

Work
Publication
Extent
1 online resource (xv, 622 p.)
Note
International conference proceedings
Contents
  • 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
  • On the Impact of Turing Machines
  • 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
  • John Hopcroft
  • 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
  • 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
  • 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
  • Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices
  • 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
  • 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
  • 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
  • Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves
  • 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
  • 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
  • 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
  • Bisection (Band)Width of Product Networks with Application to Data Centers
  • 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
  • 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
Isbn
9783642299513
Instance
Label
Theory and applications of models of computation : 9th annual conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings
Title
Theory and applications of models of computation
Title remainder
9th annual conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings
Statement of responsibility
Manindra Agrawal, S. Barry Cooper, Angsheng Li (eds.)
Title variation
TAMC 2012
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
004.01/51
Illustrations
illustrations
Index
index present
LC call number
QA76.9.M35
LC item number
T36 2012
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2012
http://bibfra.me/vocab/lite/meetingName
TAMC 2012
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1966-
http://library.link/vocab/relatedWorkOrContributorName
  • Agrawal, Manindra
  • Cooper, S. B.
  • Li, Angsheng
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
7287
http://library.link/vocab/subjectName
  • Computer science
  • Computational complexity
  • Turing machines
Label
Theory and applications of models of computation : 9th annual conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings, Manindra Agrawal, S. Barry Cooper, Angsheng Li (eds.), (electronic book)
Instantiates
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • 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
  • On the Impact of Turing Machines
  • 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
  • John Hopcroft
  • 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
  • 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
  • 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
  • Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices
  • 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
  • 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
  • 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
  • Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves
  • 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
  • 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
  • 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
  • Bisection (Band)Width of Product Networks with Application to Data Centers
  • 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
  • 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
Control code
SPR793520661
Dimensions
unknown
Extent
1 online resource (xv, 622 p.)
File format
unknown
Form of item
online
Isbn
9783642299513
Level of compression
unknown
Other physical details
ill.
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote
Label
Theory and applications of models of computation : 9th annual conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings, Manindra Agrawal, S. Barry Cooper, Angsheng Li (eds.), (electronic book)
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • 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
  • On the Impact of Turing Machines
  • 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
  • John Hopcroft
  • 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
  • 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
  • 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
  • Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices
  • 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
  • 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
  • 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
  • Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves
  • 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
  • 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
  • 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
  • Bisection (Band)Width of Product Networks with Application to Data Centers
  • 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
  • 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
Control code
SPR793520661
Dimensions
unknown
Extent
1 online resource (xv, 622 p.)
File format
unknown
Form of item
online
Isbn
9783642299513
Level of compression
unknown
Other physical details
ill.
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote

Subject

Genre

Member of

Library Locations

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Liverpool. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...