Seems you have not registered as a member of localhost.saystem.shop!

You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.

Sign up

Random Trees
  • Language: en
  • Pages: 466

Random Trees

The aim of this book is to provide a thorough introduction to various aspects of trees in random settings and a systematic treatment of the mathematical analysis techniques involved. It should serve as a reference book as well as a basis for future research.

Sequences, Discrepancies and Applications
  • Language: en
  • Pages: 517

Sequences, Discrepancies and Applications

  • Type: Book
  • -
  • Published: 2006-11-14
  • -
  • Publisher: Springer

The main purpose of this book is to give an overview of the developments during the last 20 years in the theory of uniformly distributed sequences. The authors focus on various aspects such as special sequences, metric theory, geometric concepts of discrepancy, irregularities of distribution, continuous uniform distribution and uniform distribution in discrete spaces. Specific applications are presented in detail: numerical integration, spherical designs, random number generation and mathematical finance. Furthermore over 1000 references are collected and discussed. While written in the style of a research monograph, the book is readable with basic knowledge in analysis, number theory and measure theory.

Number-Theoretic Analysis
  • Language: en
  • Pages: 230

Number-Theoretic Analysis

  • Type: Book
  • -
  • Published: 2006-11-14
  • -
  • Publisher: Springer

description not available right now.

Theory and Applications of Models of Computation
  • Language: en
  • Pages: 493

Theory and Applications of Models of Computation

  • Type: Book
  • -
  • Published: 2010-06-01
  • -
  • Publisher: Springer

Annotation This book constitutes the refereed proceedings of the 7th InternationalConference on Theory and Applications of Models of Computation, TAMC2010, held in Prague, Czech Republic, in June 2010.The 35 revised full papers presented together with 5 contributions ofspecial sessions as well as 2 plenary talks were carefully reviewed andselected from 76 submissions. The papers address the three main themesof the conference which were computability, complexity, and algorithmsand present current research in these fields with aspects to theoreticalcomputer science, algorithmic mathematics, and applications to thephysical sciences.

Classical and Modern Branching Processes
  • Language: en
  • Pages: 340

Classical and Modern Branching Processes

This IMA Volume in Mathematics and its Applications CLASSICAL AND MODERN BRANCHING PROCESSES is based on the proceedings with the same title and was an integral part of the 1993-94 IMA program on "Emerging Applications of Probability." We would like to thank Krishna B. Athreya and Peter J agers for their hard work in organizing this meeting and in editing the proceedings. We also take this opportunity to thank the National Science Foundation, the Army Research Office, and the National Security Agency, whose financial support made this workshop possible. A vner Friedman Robert Gulliver v PREFACE The IMA workshop on Classical and Modern Branching Processes was held during June 13-171994 as par...

Current Trends In Theoretical Computer Science: The Challenge Of The New Century; Vol 1: Algorithms And Complexity; Vol 2: Formal Models And Semantics
  • Language: en
  • Pages: 1319

Current Trends In Theoretical Computer Science: The Challenge Of The New Century; Vol 1: Algorithms And Complexity; Vol 2: Formal Models And Semantics

This book is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science (EATCS) during the period 2000-2003. It presents many of the most active current research lines in theoretical computer science. The material appears in two volumes, “Algorithms and Complexity” and “Formal Models and Semantics”, reflecting the traditional division of the field.The list of contributors includes many of the well-known researchers in theoretical computer science. Most of the articles are reader-friendly and do not presuppose much knowledge of the area in question. Therefore, the book constitutes very suitable supplementary reading material for various courses and seminars in computer science.

Mathematics and Computer Science
  • Language: en
  • Pages: 337

Mathematics and Computer Science

  • Type: Book
  • -
  • Published: 2012-12-06
  • -
  • Publisher: Birkhäuser

This is the first book where mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep mathematical approaches. It contains a collection of refereed papers presented at the Colloquium on Mathematics and Computer Science held at the University of Versailles-St-Quentin on September 18-20, 2000. The colloquium was a meeting place for researchers in mathematics and computer science and thus an important opportunity to exchange ideas and points of view, and to present new approaches and new results in the common areas such as algorithms analysis, trees, combinatorics, optimization, performance evaluation and probabilities. The book is intended 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 related modern mathematical methods. The range of applications is very wide and reaches beyond computer science.

Number Theory
  • Language: en
  • Pages: 1038

Number Theory

Monumental proceedings (very handsomely produced) of a major international conference. The book contains 74 refereed articles which, apart from a few survey papers of peculiar interest, are mostly research papers (63 in English, 11 in French). The topics covered reflect the full diversity of the current trends and activities in modern number theory: elementary, algebraic and analytic number theory; constructive (computational) number theory; elliptic curves and modular forms; arithmetical geometry; transcendence; quadratic forms; coding theory. (NW) Annotation copyrighted by Book News, Inc., Portland, OR

Algebraic Combinatorics
  • Language: en
  • Pages: 444

Algebraic Combinatorics

Algebraic combinatorics is the study of combinatorial objects as an extension of the study of finite permutation groups, or, in other words, group theory without groups. In the spirit of Delsarte's theory, this book studies combinatorial objects such as graphs, codes, designs, etc. in the general framework of association schemes, providing a comprehensive overview of the theory as well as pointing out to extensions.

Combinatorics, Automata and Number Theory
  • Language: en
  • Pages: 637

Combinatorics, Automata and Number Theory

This series is devoted to significant topics or themes that have wide application in mathematics or mathematical science and for which a detailed development of the abstract theory is less important than a thorough and concrete exploration of the implications and applications. Books in the Encyclopedia of Mathematics and its Applications cover their subjects comprehensively. Less important results may be summarised as exercises at the ends of chapters, For technicalities, readers can be referred to the bibliography, which is expected to be comprehensive. As a result, volumes are encyclopedic references or manageable guides to major subjects.