Group testing has been used in medical, chemical and electrical testing, coding, drug
screening, pollution control, multiaccess channel management, and recently in data …

Combinatorial algebraic topology is a fascinating and dynamic field at the crossroads of
algebraic topology and discrete mathematics. This volume is the first comprehensive …

0. Introduction A number of questions from a variety of areas of mathematics lead one to the
problem of analyzing the topology of as implicial complex. We will see some examples in …

We discuss several complexity measures for Boolean functions: certificate complexity,
sensitivity, block sensitivity, and the degree of a representing or approximating polynomial …

This volume deals with the theory of finite topological spaces and its relationship with the
homotopy and simple homotopy theory of polyhedra. The interaction between their intrinsic …

With the advent of computers, algorithmic principles play an ever increasing role in
mathematics. Algorithms have to exploit the structure of the underlying mathematical object …

A complete treatment of fundamentals and recent advances in complexity theory Complexity
theory studies the inherent difficulties of solving algorithmic problems by digital computers …

These lecture notes for the IAS/Park City Graduate Summer School in Geometric
Combinatorics (July 2004) provide an overview of poset topology. These notes include …

This book is a revised version of my 2005 thesis [71] for the degree of Doctor of Philosophy
at the Royal Institute of Technology (KTH) in Stockholm. The whole idea of writing a …

This paper gives a full characterization of the time needed to compute a Boolean function on
a CREW PRAM with an unlimited number of processors. The characterization is given in …