Mathematics and computer science : algorithms, trees, combinatorics and probabilities
著者
書誌事項
Mathematics and computer science : algorithms, trees, combinatorics and probabilities
(Trends in mathematics)
Birkhäuser, c2000-
- II
- III
大学図書館所蔵 全26件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references
VOL.II: editor:Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Abdelkader Mokkadem
VOL.III: editor:Michael Drmota, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger
"These are the Proceedings of the International Colloquium of Mathematics and Computer Science held at Vienna University of Technology, September 13-17, 2004."--Foreword of III
内容説明・目次
- 巻冊次
-
ISBN 9783764364304
内容説明
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.
- 巻冊次
-
II ISBN 9783764369330
内容説明
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.
目次
n-Colored Maps and Multilabel n-Colored Trees.- Limit Laws for Basic Parameters of Lattice Paths with Unbounded Jumps.- Counting Walks in the Quarter Plane.- Bijective Construction of Equivalent Eco-systems.- Random Boundary of a Planar Map.- Enumeration des 2-arbres k-gonaux.- Breadth First Search, Triangle-Free Graphs and Brownian Motion.- Random Planar Lattices and Integrated SuperBrownian Excursion.- The Diameter of a Long-Range Percolation Graph.- Giant Components for Two Expanding Graph Processes.- Coloring Random Graphs - an Algorithmic Perspective.- A Sharp Threshold for a Non-monotone Digraph Property.- Approximability of Paths Coloring Problem in Mesh and Torus Networks.- Minimal Spanning Trees for Graphs with Random Edge Lengths.- Generalized Pattern Matching Statistics.- A Note on Random Suffix Search Trees.- On the Profile of Random Forests.- On the Number of Heaps and the Cost of Heap Construction.- A Combinatorial Problem Arising in Information Theory: Precise Minimax Redundancy for Markov Sources.- Analysis of Quickfind with Small Subfiles.- Distribution of the Size of Simplified or Reduced Trees.- Digits and Beyond.- Growth Rate and Ergodicity Conditions for a Class of Random Trees.- Ideals in a Forest, One-Way Infinite Binary Trees and the Contraction Method.- On Random Walks in Random Environment on Trees and Their Relationship with Multiplicative Chaos.- Note on Exact and Asymptotic Distributions of the Parameters of the Loop-Erased Random Walk on the Complete Graph.- Convergence Rate for Stable Weighted Branching Processes.- Reduced Branching Processes in Random Environment.- A Cooperative Approach to Renyi's Parking Problem on the Circle.- On the Noise Sensitivity of Monotone Functions.- Apprentissage de Sequences Non-Independantes d'Exemples.- Entropy Reduction Strategies on Tree Structured Retrieval Spaces.- Zero-One Law Characterizations of ?0.- Further Applications of Chebyshev Polynomials in the Derivation of Spanning Tree Formulas for Circulant Graphs.- Key words.- List of Authors.
- 巻冊次
-
III ISBN 9783764371289
内容説明
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.
目次
I. Combinatorics and Random Structures.- Common Intervals of Permutations.- Overpartitions and Generating Functions for Generalized Frobenius Partitions.- Enumerative Results on Integer Partitions Using the ECO Method.- 321-Avoiding Permutations and Chebyshev Polynomials.- Iterated Logarithm Laws and the Cycle Lengths of a Random Permutation.- Transcendence of Generating Functions of Walks on the Slit Plane.- Some Curious Extensions of the Classical Beta Integral Evaluation.- Divisor Functions and Pentagonal Numbers.- II. Graph Theory.- On Combinatorial Hoeffding Decomposition and Asymptotic Normality of Subgraph Count Statistics.- Avalanche Polynomials of Some Families of Graphs.- Perfect Matchings in Random Graphs with Prescribed Minimal Degree.- Estimating the Growth Constant of Labelled Planar Graphs.- The Number of Spanning Trees in P4-Reducible Graphs.- III. Analysis of Algorithms.- On the Stationary Search Cost for the Move-to-Root Rule with Random Weights.- Average-Case Analysis for the Probabilistic Bin Packing Problem.- Distribution of Wht Recurrences.- Probabilistic Analysis for Randomized Game Tree Evaluation.- Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables.- An Efficient Generic Algorithm for the Generation of Unlabelled Cycles.- Using Tries for Universal Data Compression.- IV. Trees.- New Strahler Numbers for Rooted Plane Trees.- An Average-Case Analysis of Basic Parameters of the Suffix Tree.- Arms and Feet Nodes Level Polynomial in Binary Search Trees.- Random Records and Cuttings in Complete Binary Trees.- Multidimensional Interval Trees.- Edit Distance between Unlabelled Ordered Trees.- Number of Vertices of a Given Outdegree in a Galton-Watson Forest.- Destruction of Recursive Trees.- V. Probability.- Restrictions on the Position of the Maximum/Minimum in a Geometrically Distributed Sample.- Dual Random Fragmentation and Coagulation and an Application to the Genealogy of Yule Processes.- Semi-Markov Walks in Queueing and Risk Theory.- Representation of Fixed Points of a Smoothing Transformation.- Stochastic Fixed Points for the Maximum.- The Number of Descents in Samples of Geometric Random Variables.- Large Deviations for Cascades and Cascades of Large Deviations.- Partitioning with Piecewise Constant Eigenvectors.- Yaglom Type Limit Theorem for Branching Processes in Random Environment.- Two-Dimensional Limit Theorem for a Critical Catalytic Branching Random Walk.- VI. Combinatorial Stochastic Processes.- A Combinatorial Approach to Jumping Particles II: General Boundary Conditions.- Stochastic Deformations of Sample Paths of Random Walks and Exclusion Models.- A Markov Chain Algorithm for Eulerian Orientations of Planar Triangular Graphs.- Regenerative Composition Structures: Characterisation and Asymptotics of Block Counts.- Random Walks on Groups With a Tree-Like Cayley Graph.- Nested Regenerative Sets and Their Associated Fragmentation Process.- VII. Applications.- Real Numbers with Bounded Digit Averages.- Large Deviation Analysis of Space-Time Trellis Codes.- A Zero-One Law for First-Order Logic on Random Images.- Coarse and Sharp Transitions for Random Generalized Satisfyability Problems.- Stochastic Chemical Kinetics with Energy Parameters.- Large Deviations of Bellinger Distance on Partitions.- Estimation of the Offspring Mean for a General Class of Size-Dependent Branching Processes. Application to Quantitative Polymerase Chain Reaction.- A Constrained Version of Sauer's Lemma.- Author Index.
「Nielsen BookData」 より