397 search results - page 80 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
83
Voted
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— It has been clear since 1988 that self-propagating code can quickly spread across a network by exploiting homogeneous security vulnerabilities. However, the last few years have...