C2 - Ed. Board
Scaled dimension and nonuniform complexity
Robust learning—rich and poor
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
On approximating weighted sums with exponentially many terms
Minimal DFA for testing divisibility
A lower bound on the quantum query complexity of read-once functions
On relations between counting communication complexity classes
Network QoS games: stability vs optimality tradeoff
Papers to Appear
Contents