A Duality-Based Unified Approach to Bayesian Mechanism Design
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1100113
Bipartite Perfect Matching is in Quasi-NC
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1097870
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1095482
Short Presburger Arithmetic Is Hard
来源期刊:SIAM Journal on ComputingDOI:10.1137/17m1151146
A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1105049
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1099583
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
来源期刊:SIAM Journal on ComputingDOI:10.1137/17m1133245
Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1088594
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
来源期刊:SIAM Journal on ComputingDOI:10.1137/18M1201846
A Tight Space Bound for Consensus
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1096785
Exponential Separation of Communication and External Information
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1096293
Algorithmic Bayesian Persuasion
来源期刊:SIAM Journal on ComputingDOI:10.1137/16m1098334