During the last couple of decades, the term complexity has been commonly found in use in many fields of science, sometimes as a measurable quantity with a rigorous but narrow definition and other times as merely an ad hoc label. With an emphasis on pragmatic engineering applications, this thesis investigates the complexity concept defined in axiomatic design theory to avoid vague use of the ter...

The course will cover several advanced topics in algebraic and combinatorial coding theory. One of the most exciting breakthroughs in algebraic coding theory in the past decade is a new paradigm for decoding Reed-Solomon codes using bivariate (or multivariate) polynomial interpolation. The first half of the course will be devoted to an in-depth study of this subject. The second half of the cour...

The article addresses combinatorial optimization schemes for design of multi-layer communication network topology. The paper consists of three parts: (a) description of system issues as basic requirements, trends (e.g., evolution, upgradeability), and a ”system space” for contemporary network design; (b) brief description of some basic combinatorial optimization problems as follows: multicriter...

An original combinatorial proof of a combinatorial identity is presented. Key words, combinatorial enumeration, graph theory AMS(MOS) subject classification. 05A19

Game theory is becoming central to the design and analysis of computational mechanisms in which multiple entities interact strategically. The tools of mechanism design are used extensively to engineer incentives for truth revelation into resource allocation (e.g. combinatorial auctions) and preference aggregation protocols (e.g. voting). We argue that mechanism design can also be useful in the ...