H
Research Interests
Computational Complexity Theory (counting-Based Computation, Probabilistic Computation, Unambiguous Computation, the Importance of Query Order When Accessing Databases, the Study of Efficient Algorithms for Complex Sets, Complexity-Theoretic Aspects of Security, Fault-Tolerance, and Data Compression, Etc.)
Computational Social Choice (elections, Preference Aggregation, Power Indices, Etc.)