Author: Naoki Katoh
Publisher: Springer Nature
ISBN: 9811640955
Category : Computers
Languages : en
Pages : 403
Book Description
This open access book gives an overview of cutting-edge work on a new paradigm called the “sublinear computation paradigm,” which was proposed in the large multiyear academic research project “Foundations of Innovative Algorithms for Big Data.” That project ran from October 2014 to March 2020, in Japan. To handle the unprecedented explosion of big data sets in research, industry, and other areas of society, there is an urgent need to develop novel methods and approaches for big data analysis. To meet this need, innovative changes in algorithm theory for big data are being pursued. For example, polynomial-time algorithms have thus far been regarded as “fast,” but if a quadratic-time algorithm is applied to a petabyte-scale or larger big data set, problems are encountered in terms of computational resources or running time. To deal with this critical computational and algorithmic bottleneck, linear, sublinear, and constant time algorithms are required. The sublinear computation paradigm is proposed here in order to support innovation in the big data era. A foundation of innovative algorithms has been created by developing computational procedures, data structures, and modelling techniques for big data. The project is organized into three teams that focus on sublinear algorithms, sublinear data structures, and sublinear modelling. The work has provided high-level academic research results of strong computational and algorithmic interest, which are presented in this book. The book consists of five parts: Part I, which consists of a single chapter on the concept of the sublinear computation paradigm; Parts II, III, and IV review results on sublinear algorithms, sublinear data structures, and sublinear modelling, respectively; Part V presents application results. The information presented here will inspire the researchers who work in the field of modern algorithms.
Sublinear Computation Paradigm
Author: Naoki Katoh
Publisher: Springer Nature
ISBN: 9811640955
Category : Computers
Languages : en
Pages : 403
Book Description
This open access book gives an overview of cutting-edge work on a new paradigm called the “sublinear computation paradigm,” which was proposed in the large multiyear academic research project “Foundations of Innovative Algorithms for Big Data.” That project ran from October 2014 to March 2020, in Japan. To handle the unprecedented explosion of big data sets in research, industry, and other areas of society, there is an urgent need to develop novel methods and approaches for big data analysis. To meet this need, innovative changes in algorithm theory for big data are being pursued. For example, polynomial-time algorithms have thus far been regarded as “fast,” but if a quadratic-time algorithm is applied to a petabyte-scale or larger big data set, problems are encountered in terms of computational resources or running time. To deal with this critical computational and algorithmic bottleneck, linear, sublinear, and constant time algorithms are required. The sublinear computation paradigm is proposed here in order to support innovation in the big data era. A foundation of innovative algorithms has been created by developing computational procedures, data structures, and modelling techniques for big data. The project is organized into three teams that focus on sublinear algorithms, sublinear data structures, and sublinear modelling. The work has provided high-level academic research results of strong computational and algorithmic interest, which are presented in this book. The book consists of five parts: Part I, which consists of a single chapter on the concept of the sublinear computation paradigm; Parts II, III, and IV review results on sublinear algorithms, sublinear data structures, and sublinear modelling, respectively; Part V presents application results. The information presented here will inspire the researchers who work in the field of modern algorithms.
Publisher: Springer Nature
ISBN: 9811640955
Category : Computers
Languages : en
Pages : 403
Book Description
This open access book gives an overview of cutting-edge work on a new paradigm called the “sublinear computation paradigm,” which was proposed in the large multiyear academic research project “Foundations of Innovative Algorithms for Big Data.” That project ran from October 2014 to March 2020, in Japan. To handle the unprecedented explosion of big data sets in research, industry, and other areas of society, there is an urgent need to develop novel methods and approaches for big data analysis. To meet this need, innovative changes in algorithm theory for big data are being pursued. For example, polynomial-time algorithms have thus far been regarded as “fast,” but if a quadratic-time algorithm is applied to a petabyte-scale or larger big data set, problems are encountered in terms of computational resources or running time. To deal with this critical computational and algorithmic bottleneck, linear, sublinear, and constant time algorithms are required. The sublinear computation paradigm is proposed here in order to support innovation in the big data era. A foundation of innovative algorithms has been created by developing computational procedures, data structures, and modelling techniques for big data. The project is organized into three teams that focus on sublinear algorithms, sublinear data structures, and sublinear modelling. The work has provided high-level academic research results of strong computational and algorithmic interest, which are presented in this book. The book consists of five parts: Part I, which consists of a single chapter on the concept of the sublinear computation paradigm; Parts II, III, and IV review results on sublinear algorithms, sublinear data structures, and sublinear modelling, respectively; Part V presents application results. The information presented here will inspire the researchers who work in the field of modern algorithms.
Computational Complexity
Author: Sanjeev Arora
Publisher: Cambridge University Press
ISBN: 0521424267
Category : Computers
Languages : en
Pages : 609
Book Description
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Publisher: Cambridge University Press
ISBN: 0521424267
Category : Computers
Languages : en
Pages : 609
Book Description
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Limits to Parallel Computation
Author: Raymond Greenlaw
Publisher: Oxford University Press, USA
ISBN: 0195085914
Category : Computational complexity
Languages : en
Pages : 328
Book Description
This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consists of an introduction to many fundamental issues in parallel computing. The second half provides lists of P-complete- and open problems. These lists will have lasting value to researchers in both industry and academia. The lists of problems, with their corresponding remarks, the thorough index, and the hundreds of references add to the exceptional value of this resource. While the exciting field of parallel computation continues to expand rapidly, this book serves as a guide to research done through 1994 and also describes the fundamental concepts that new workers will need to know in coming years. It is intended for anyone interested in parallel computing, including senior level undergraduate students, graduate students, faculty, and people in industry. As an essential reference, the book will be needed in all academic libraries.
Publisher: Oxford University Press, USA
ISBN: 0195085914
Category : Computational complexity
Languages : en
Pages : 328
Book Description
This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consists of an introduction to many fundamental issues in parallel computing. The second half provides lists of P-complete- and open problems. These lists will have lasting value to researchers in both industry and academia. The lists of problems, with their corresponding remarks, the thorough index, and the hundreds of references add to the exceptional value of this resource. While the exciting field of parallel computation continues to expand rapidly, this book serves as a guide to research done through 1994 and also describes the fundamental concepts that new workers will need to know in coming years. It is intended for anyone interested in parallel computing, including senior level undergraduate students, graduate students, faculty, and people in industry. As an essential reference, the book will be needed in all academic libraries.
Mathematics and Computation
Author: Avi Wigderson
Publisher: Princeton University Press
ISBN: 0691189137
Category : Computers
Languages : en
Pages : 434
Book Description
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Publisher: Princeton University Press
ISBN: 0691189137
Category : Computers
Languages : en
Pages : 434
Book Description
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Research Anthology on Bioinformatics, Genomics, and Computational Biology
Author: Management Association, Information Resources
Publisher: IGI Global
ISBN:
Category : Computers
Languages : en
Pages : 1509
Book Description
In the evolving environment of bioinformatics, genomics, and computational biology, academic scholars are facing a challenging challenge – keeping informed about the latest research trends and findings. With unprecedented advancements in sequencing technologies, computational algorithms, and machine learning, these fields have become indispensable tools for drug discovery, disease research, genome sequencing, and more. As scholars strive to decode the language of DNA, predict protein structures, and navigate the complexities of biological data analysis, the need for a comprehensive and up-to-date resource becomes paramount. The Research Anthology on Bioinformatics, Genomics, and Computational Biology is a collection of a carefully curated selection of chapters that serves as the solution to the pressing challenge of keeping pace with the dynamic advancements in these critical disciplines. This anthology is designed to address the informational gap by providing scholars with a consolidated and authoritative source that sheds light on critical issues, innovative theories, and transformative developments in the field. It acts as a single reference point, offering insights into conceptual, methodological, technical, and managerial issues while also providing a glimpse into emerging trends and future opportunities.
Publisher: IGI Global
ISBN:
Category : Computers
Languages : en
Pages : 1509
Book Description
In the evolving environment of bioinformatics, genomics, and computational biology, academic scholars are facing a challenging challenge – keeping informed about the latest research trends and findings. With unprecedented advancements in sequencing technologies, computational algorithms, and machine learning, these fields have become indispensable tools for drug discovery, disease research, genome sequencing, and more. As scholars strive to decode the language of DNA, predict protein structures, and navigate the complexities of biological data analysis, the need for a comprehensive and up-to-date resource becomes paramount. The Research Anthology on Bioinformatics, Genomics, and Computational Biology is a collection of a carefully curated selection of chapters that serves as the solution to the pressing challenge of keeping pace with the dynamic advancements in these critical disciplines. This anthology is designed to address the informational gap by providing scholars with a consolidated and authoritative source that sheds light on critical issues, innovative theories, and transformative developments in the field. It acts as a single reference point, offering insights into conceptual, methodological, technical, and managerial issues while also providing a glimpse into emerging trends and future opportunities.
Financial Cryptography and Data Security
Author: Ahmad-Reza Sadeghi
Publisher: Springer
ISBN: 3642398847
Category : Computers
Languages : en
Pages : 419
Book Description
This book constitutes the thoroughly refereed post-conference proceedings of the 17th International Conference on Financial Cryptography and Data Security (FC 2013), held at Bankoku Shinryokan Busena Terrace Beach Resort, Okinawa, Japan, April 1-5, 2013. The 14 revised full papers and 17 short papers were carefully selected and reviewed from 125 submissions. The papers are grouped in the following topical sections: electronic payment (Bitcoin), usability aspects, secure computation, passwords, privacy primitives and non-repudiation, anonymity, hardware security, secure computation and secret sharing, authentication attacks and countermeasures, privacy of data and communication, and private data retrieval.
Publisher: Springer
ISBN: 3642398847
Category : Computers
Languages : en
Pages : 419
Book Description
This book constitutes the thoroughly refereed post-conference proceedings of the 17th International Conference on Financial Cryptography and Data Security (FC 2013), held at Bankoku Shinryokan Busena Terrace Beach Resort, Okinawa, Japan, April 1-5, 2013. The 14 revised full papers and 17 short papers were carefully selected and reviewed from 125 submissions. The papers are grouped in the following topical sections: electronic payment (Bitcoin), usability aspects, secure computation, passwords, privacy primitives and non-repudiation, anonymity, hardware security, secure computation and secret sharing, authentication attacks and countermeasures, privacy of data and communication, and private data retrieval.
Theory of Cryptography
Author: Eike Kiltz
Publisher: Springer Nature
ISBN: 3031223683
Category : Computers
Languages : en
Pages : 254
Book Description
The three-volume set LNCS 13747, LNCS 13748 and LNCS 13749 constitutes the refereed proceedings of the 20th International Conference on Theory of Cryptography, TCC 2022, held in Chicago, IL, USA, in November 2022. The total of 60 full papers presented in this three-volume set was carefully reviewed and selected from 139 submissions. They cover topics on post-quantum cryptography; interactive proofs; quantum cryptography; secret-sharing and applications; succinct proofs; identity-based encryption and functional encryption; attribute-based encryption and functional encryption; encryption; multi-party computation; protocols: key agreement and commitments; theory: sampling and friends; lattices; anonymity, verfiability and robustness; ORAM, OT and PIR; and theory.
Publisher: Springer Nature
ISBN: 3031223683
Category : Computers
Languages : en
Pages : 254
Book Description
The three-volume set LNCS 13747, LNCS 13748 and LNCS 13749 constitutes the refereed proceedings of the 20th International Conference on Theory of Cryptography, TCC 2022, held in Chicago, IL, USA, in November 2022. The total of 60 full papers presented in this three-volume set was carefully reviewed and selected from 139 submissions. They cover topics on post-quantum cryptography; interactive proofs; quantum cryptography; secret-sharing and applications; succinct proofs; identity-based encryption and functional encryption; attribute-based encryption and functional encryption; encryption; multi-party computation; protocols: key agreement and commitments; theory: sampling and friends; lattices; anonymity, verfiability and robustness; ORAM, OT and PIR; and theory.
Advances in Cryptology – CRYPTO 2018
Author: Hovav Shacham
Publisher: Springer
ISBN: 3319968785
Category : Computers
Languages : en
Pages : 788
Book Description
The three volume-set, LNCS 10991, LNCS 10992, and LNCS 10993, constitutes the refereed proceedings of the 38th Annual International Cryptology Conference, CRYPTO 2018, held in Santa Barbara, CA, USA, in August 2018. The 79 revised full papers presented were carefully reviewed and selected from 351 submissions. The papers are organized in the following topical sections: secure messaging; implementations and physical attacks prevention; authenticated and format-preserving encryption; cryptoanalysis; searchable encryption and differential privacy; secret sharing; encryption; symmetric cryptography; proofs of work and proofs of stake; proof tools; key exchange; symmetric cryptoanalysis; hashes and random oracles; trapdoor functions; round optimal MPC; foundations; lattices; lattice-based ZK; efficient MPC; quantum cryptography; MPC; garbling; information-theoretic MPC; oblivious transfer; non-malleable codes; zero knowledge; and obfuscation.
Publisher: Springer
ISBN: 3319968785
Category : Computers
Languages : en
Pages : 788
Book Description
The three volume-set, LNCS 10991, LNCS 10992, and LNCS 10993, constitutes the refereed proceedings of the 38th Annual International Cryptology Conference, CRYPTO 2018, held in Santa Barbara, CA, USA, in August 2018. The 79 revised full papers presented were carefully reviewed and selected from 351 submissions. The papers are organized in the following topical sections: secure messaging; implementations and physical attacks prevention; authenticated and format-preserving encryption; cryptoanalysis; searchable encryption and differential privacy; secret sharing; encryption; symmetric cryptography; proofs of work and proofs of stake; proof tools; key exchange; symmetric cryptoanalysis; hashes and random oracles; trapdoor functions; round optimal MPC; foundations; lattices; lattice-based ZK; efficient MPC; quantum cryptography; MPC; garbling; information-theoretic MPC; oblivious transfer; non-malleable codes; zero knowledge; and obfuscation.
Computational Complexity
Author: Oded Goldreich
Publisher: Cambridge University Press
ISBN: 9780521884730
Category : Computers
Languages : en
Pages : 632
Book Description
This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.
Publisher: Cambridge University Press
ISBN: 9780521884730
Category : Computers
Languages : en
Pages : 632
Book Description
This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.
Decision and Game Theory for Security
Author: Stefan Rass
Publisher: Springer
ISBN: 3319687115
Category : Computers
Languages : en
Pages : 543
Book Description
This book constitutes the refereed proceedings of the 8th International Conference on Decision and Game Theory for Security, GameSec 2017, held in Vienna, Austria, in October 2017. The 24 revised full papers presented together with 4 short papers were carefully reviewed and selected from 71 submissions.The papers address topics such as Game theory and mechanism design for security and privacy; Pricing and economic incentives for building dependable and secure systems; Dynamic control, learning, and optimization and approximation techniques; Decision making and decision theory for cybersecurity and security requirements engineering; Socio-technological and behavioral approaches to security; Risk assessment and risk management; Security investment and cyber insurance; Security and privacy for the Internet-of-Things (IoT), cyber-physical systems, resilient control systems; New approaches for security and privacy in cloud computing and for critical infrastructure; Security and privacy of wireless and mobile communications, including user location privacy; Game theory for intrusion detection; and Empirical and experimental studies with game-theoretic or optimization analysis for security and privacy.
Publisher: Springer
ISBN: 3319687115
Category : Computers
Languages : en
Pages : 543
Book Description
This book constitutes the refereed proceedings of the 8th International Conference on Decision and Game Theory for Security, GameSec 2017, held in Vienna, Austria, in October 2017. The 24 revised full papers presented together with 4 short papers were carefully reviewed and selected from 71 submissions.The papers address topics such as Game theory and mechanism design for security and privacy; Pricing and economic incentives for building dependable and secure systems; Dynamic control, learning, and optimization and approximation techniques; Decision making and decision theory for cybersecurity and security requirements engineering; Socio-technological and behavioral approaches to security; Risk assessment and risk management; Security investment and cyber insurance; Security and privacy for the Internet-of-Things (IoT), cyber-physical systems, resilient control systems; New approaches for security and privacy in cloud computing and for critical infrastructure; Security and privacy of wireless and mobile communications, including user location privacy; Game theory for intrusion detection; and Empirical and experimental studies with game-theoretic or optimization analysis for security and privacy.