Algorithms and Computational Complexity Algorithms and Computational Complexity Research Group Department of Computer Science University of Warwick Research in this field is motivated by foundational questions in computer science. Persi Diaconis will be speaking on 11 May 2001. We also work on neural network methods such as Gaussian processes. An html survey of this type of work is here . We also work on deterministic routing in optical networks.
Specific problems targeted include mesh generation and load balancing.
We are particularly interested in uniformly sampling structures up to isomorphism and in related problems concerning the complexity of approximate counting. We are interested in VLSI circuit layouts of some of the fundamental networks such as the rearrangeable Benes network, the odd-even, and the bitonic sorters. Other research interests include algorithmic problems in string matching and pattern matching, boolean function complexity, computational geometry and sorting and selection. Proc. of ESA'97, Lecture Notes in Computer Science, vol.