You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Mathematics and Computer Science III contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the Third International Colloquium on Mathematics and Computer Science, held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers.
Promoting original mathematical methods to determine the invariant measure of two-dimensional random walks in domains with boundaries, the authors use Using Riemann surfaces and boundary value problems to propose completely new approaches to solve functional equations of two complex variables. These methods can also be employed to characterize the transient behavior of random walks in the quarter plane.
Computation is ubiquitous: modern life would be inconceivable without it.Written as a series of conversations with influential computer scientists, mathematicians and physicists, this book provides access to the inner thinking of those who have made essential contributions to the development of computing and its applications. You will learn about the interviewees' education, career path, influences, methods of work, how they cope with failure and success, how they relax, how they see the future, and much more.The conversations are presented in jargon-free language suitable for a general audience, but with enough technical detail for more specialized readers. The aim of the book is not only to inform and entertain, but also to motivate and stimulate.
Computer and Information Sciences is a unique and comprehensive review of advanced technology and research in the field of Information Technology. It provides an up to date snapshot of research in Europe and the Far East (Hong Kong, Japan and China) in the most active areas of information technology, including Computer Vision, Data Engineering, Web Engineering, Internet Technologies, Bio-Informatics and System Performance Evaluation Methodologies.
This is the second volume in a series of innovative proceedings entirely devoted to the connections between mathematics and computer science. Here mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep and innovative mathematical approaches. The book serves as an outstanding tool and a main information source for a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. It provides an overview of the current questions in computer science and the related modern and powerful mathematical methods. The range of applications is very wide and reaches beyond computer science.
This proceedings volume gathers together original articles and survey works that originate from presentations given at the conference Transient Transcendence in Transylvania, held in Brașov, Romania, from May 13th to 17th, 2019. The conference gathered international experts from various fields of mathematics and computer science, with diverse interests and viewpoints on transcendence. The covered topics are related to algebraic and transcendental aspects of special functions and special numbers arising in algebra, combinatorics, geometry and number theory. Besides contributions on key topics from invited speakers, this volume also brings selected papers from attendees.
Probabilistic Analysis of Algorithms begins with a presentation of the "tools of the trade" currently used in probabilistic analyses, and continues with an applications section in which these tools are used in the analysis ofr selected algorithms. The tools section of the book provides the reader with an arsenal of analytic and numeric computing methods which are then applied to several groups of algorithms to analyze their running time or storage requirements characteristics. Topics covered in the applications section include sorting, communications network protocols and bin packing. While the discussion of the various algorithms is sufficient to motivate their structure, the emphasis throu...
The papers in this volume were presented at the International Conference on Database Theory, held in Berlin, Germany, October 14-16, 1992. This conference initiated the merger of two series of conferences on theoretical aspects of databases that were formed in parallel by different scientific communities in Europe. The first series was known as the International Conference on Database Theory and the second as the Symposium on Mathematical Fundamentals of Database Systems. In the future, ICDT will be organized every two years, alternating with the more practically oriented series of conferences on Extending Database Technology (EDBT). The volume contains 3 invited lectures and 26 contributed papers selected from a total of 107 submissions. The papers are organized into sections on constraints and decomposition, query languages, updates and active databases, concurrency control and recovery, knowledge bases, datalog complexity and optimization, object orientation, information capacity and security, and data structures and algorithms. Two of the invited papers survey research into theoretical database issues done in Eastern Europe during the past decade.
This book constitutes the refereed proceedings of the 17th International Conference on Rewriting Techniques and Applications, RTA 2006, held in Seattle, WA, USA in August 2006. The book presents 23 revised full papers and 4 systems description papers together with 2 invited talks and a plenary talk of the hosting FLoC conference. Topics include equational reasoning, system verification, lambda calculus, theorem proving, system descriptions, termination, higher-order rewriting and unification, and more.
This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.