Cs-Cc
Graph Coalition Structure Generation
A Formalization of Polytime Functions
Synchronizing Objectives for Markov Decision Processes
Isomorphism of regular trees and words
Tight Bounds for Parallel Randomized Load Balancing
Computation with narrow CTCs
Repeated Matching Pennies with Limited Randomness
Classical and quantum computation with small space bounds (PhD thesis)
Dont Rush into a Union: Take Time to Find Your Roots
Hardness and Parameterized Algorithms on Rainbow Connectivity problem
On the Complexity of Newmans Community Finding Approach for Biological and Social Networks
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
The Clique Problem in Ray Intersection Graphs
Making the long code shorter, with applications to the Unique Games Conjecture
An additive combinatorics approach to the log-rank conjecture in communication complexity
On Approximating Four Covering and Packing Problems
Axiomatizing Resource Bounds for Measure
Automated Complexity Analysis Based on the Dependency Pair Method
Many-one reductions and the category of multivalued functions
Pseudo-random graphs and bit probe schemes with one-sided error
Approximating Fixation Probabilities in the Generalized Moran Process
Applications of Monotone Rank to Complexity Theory
