This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members, What general methods are useful for listing combinatorial structures, How can these be applied to those families that are of interest to theoretical computer scientists and combinatorialists? Among those families considered are unlabeled graphs, first-order one properties, Hamiltonian graphs, graphs with cliques of...

The theory and design of integrated circuits has moved forward in leaps and bounds in recent years. This book concentrates on the design of three-dimensional, rather than traditional two-dimensional, circuits. The theory behind such circuits, together with experimental results, are presented in detail.

Contemporary distributed file systems are monolithic and only support single file abstractions. Nowadays, as Sai-Lai Lo explains, network storage devices have to accommodate new information media such as digital audio and video, with data radically different from the traditional text and binary code that contemporary file systems are optimized for. In this book, the author shows how, by combining new and traditional media, information can be recorded and presented in the most suitable way, and the value of a piece of information can be further enhanced by linking together related pieces....