A new fixed point approach for stable networks stable marriages
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Solutions to the Minimization Problem of Fault-Tolerant Logic Circuits
IEEE Transactions on Computers
Journal of VLSI Signal Processing Systems
The power of logical clock abstractions
Distributed Computing
Characterization of rankings generated by linear discriminant anlaysis
Journal of Multivariate Analysis
An Exact Closed-Form Formula for d-Dimensional Quadtree Decomposition of Arbitrary Hyperrectangles
IEEE Transactions on Knowledge and Data Engineering
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms and theory of computation handbook
FD covers and universal complements of simple projections
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Linear programming brings marital bliss
Operations Research Letters
Hi-index | 0.00 |
From the Publisher:Introductory Combinatorics, Third Edition, is designed for introductory courses in combinatorics, or moregenerally, discrete mathematics for students in a wide variety of disciplines: mathematics, computer science, statistics, operations research, physical sciences, and behavioral sciences. The rapid growth in the breadth and depth of the field of combinatorics in the last several decades, first in graph theory and designs and more recently in enumeration and ordered sets, has led to a recognition of combinatorics as a field with which the aspiring mathematician should become familiar. A long-overdue new edition of a popular set, Introductory Combinatorics, Third Edition, presents a broad comprehensive survey of modern combinatorics that is important to the various scientific fields of study.