权威例句
Pseudorandom generators for space-bounded computationsCommunication complexityOn the degree of Boolean functions as real polynomialsApproximation algorithms for combinatorial auctions with complement-free biddersThe communication requirements of efficient allocations and supporting pricesComputationally feasible VCG mechanismsLower bounds for non-commutative computationNon-price equilibria in markets of discrete goodsConcurrent auctions across the supply chainOn data structures and asymmetric communication complexity