

Methods and techniques for developing efficient algorithms, especially graph algorithms, parallel algorithms and architectures, graph drawing, computational geometry, and group testing algorithms. Obstacles to proving non-trivial lower bounds in complexity theory. Properties of complexity classes, with relationships between classes and with identification of properties of problems that affect their computational complexity. | More »