Gardy D. Mathematics and Computer Science III. Algorithms,...2004.pdf
44.10 MB
Externally indexed torrent
If you are the original uploader, contact staff to have it moved to your account
Textbook in PDF format
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
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
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
Comments need intelligible text (not only emojis or meaningless drivel). No upload requests, visit the forum or message the uploader for this. Use common sense and try to stay on topic.