Various verification methods depend on theorem provers to obtain proofs of verification conditions. If the provers return proofs that satisfy certain structure then it may enhance the performance of the verification methods.

A central problem in Microeconomics is to design auctions with good revenue properties. Consider the following setting. Multiple bidders are participating in an auction.

We analyze the performance of random load resampling and migration strategies in parallel server systems.

A unified approach to prove the converses for the quantum channel capacity theorems is presented.

We will describe a simple linear-algebraic approach to list decode Reed-Solomon codes with evaluation points from a subfield.