Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms


Book Description

Contains 130 papers, which were selected based on originality, technical contribution, and relevance. Although the papers were not formally refereed, every attempt was made to verify the main claims. It is expected that most will appear in more complete form in scientific journals. The proceedings also includes the paper presented by invited plenary speaker Ronald Graham, as well as a portion of the papers presented by invited plenary speakers Udi Manber and Christos Papadimitriou.




Computational Complexity Theory


Book Description

Computational Complexity Theory is the study of how much of a given resource is required to perform the computations that interest us the most. Four decades of fruitful research have produced a rich and subtle theory of the relationship between different resource measures and problems. At the core of the theory are some of the most alluring open problems in mathematics. This book presents three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. The first week gives a general introduction to the field, including descriptions of the basic mo.







Computational Graph Theory


Book Description

One ofthe most important aspects in research fields where mathematics is "applied is the construction of a formal model of a real system. As for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathematical model. This is certainly one of the reasons for the rapid expansion in graph theory during the last decades. Furthermore, in recent years it also became clear that the two disciplines of graph theory and computer science have very much in common, and that each one has been capable of assisting significantly in the development of the other. On one hand, graph theorists have found that many of their problems can be solved by the use of com puting techniques, and on the other hand, computer scientists have realized that many of their concepts, with which they have to deal, may be conveniently expressed in the lan guage of graph theory, and that standard results in graph theory are often very relevant to the solution of problems concerning them. As a consequence, a tremendous number of publications has appeared, dealing with graphtheoretical problems from a computational point of view or treating computational problems using graph theoretical concepts.




Information Hiding


Book Description

This book constitutes the thoroughly refereed post-proceedings of the 4th International Information Hiding Workshop, IHW 2001, held in Pittsburgh, PA, USA, in April 2001. The 29 revised full papers presented were carefully selected during two rounds of reviewing and revision. All current issues in information hiding are addressed including watermarking and fingerprinting of digitial audio, still image and video; anonymous communications; steganography and subliminal channels; covert channels; and database inference channels.




Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques


Book Description

RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 13th workshop in the series following Bologna (1997), Barcelona (1998),Berkeley(1999),Geneva(2000),Berkeley(2001),Harvard(2002),Prin- ton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008).




Cryptographic Protocol


Book Description

"Cryptographic Protocol: Security Analysis Based on Trusted Freshness" mainly discusses how to analyze and design cryptographic protocols based on the idea of system engineering and that of the trusted freshness component. A novel freshness principle based on the trusted freshness component is presented; this principle is the basis for an efficient and easy method for analyzing the security of cryptographic protocols. The reasoning results of the new approach, when compared with the security conditions, can either establish the correctness of a cryptographic protocol when the protocol is in fact correct, or identify the absence of the security properties, which leads the structure to construct attacks directly. Furthermore, based on the freshness principle, a belief multiset formalism is presented. This formalism’s efficiency, rigorousness, and the possibility of its automation are also presented. The book is intended for researchers, engineers, and graduate students in the fields of communication, computer science and cryptography, and will be especially useful for engineers who need to analyze cryptographic protocols in the real world. Dr. Ling Dong is a senior engineer in the network construction and information security field. Dr. Kefei Chen is a Professor at the Department of Computer Science and Engineering, Shanghai Jiao Tong University.




Advances in Cryptology - CRYPTO 2000


Book Description

This book constitutes the refereed proceedings of the 20th Annual International Cryptology Conference, CRYPTO 2000, held in Santa Barbara, CA, USA in August 2000. The 32 revised full papers presented together with one invited contribution were carefully reviewed and selected from 120 submissions. The papers are organized in topical sections on XTR and NTRU, privacy for databases, secure distributed computation, algebraic cryptosystems, message authentication, digital signatures, cryptanalysis, traitor tracing and broadcast encryption, symmetric encryption, to commit or not to commit, protocols, and stream ciphers and Boolean functions.




Advances in Computer Science, Engineering and Applications


Book Description

The International conference series on Computer Science, Engineering & Applications (ICCSEA) aims to bring together researchers and practitioners from academia and industry to focus on understanding computer science, engineering and applications and to establish new collaborations in these areas. The Second International Conference on Computer Science, Engineering & Applications (ICCSEA-2012), held in Delhi, India, during May 25-27, 2012 attracted many local and international delegates, presenting a balanced mixture of intellect and research both from the East and from the West. Upon a strenuous peer-review process the best submissions were selected leading to an exciting, rich and a high quality technical conference program, which featured high-impact presentations in the latest developments of various areas of computer science, engineering and applications research.




Mathematical Morphology: 40 Years On


Book Description

Mathematical Morphology is a speciality in Image Processing and Analysis, which considers images as geometrical objects, to be analyzed through their interactions with other geometrical objects. It relies on several branches of mathematics, such as discrete geometry, topology, lattice theory, partial differential equations, integral geometry and geometrical probability. It has produced fast and efficient algorithms for computer analysis of images, and has found applications in bio-medical imaging, materials science, geoscience, remote sensing, quality control, document processing and data analysis. This book contains the 43 papers presented at the 7th International Symposium on Mathematical Morphology, held in Paris on April 18-20, 2005. It gives a lively state of the art of current research topics in this field. It also marks a milestone, the 40 years of uninterrupted development of this ever-expanding domain.