501 search results - page 11 / 101 » Communication Lower Bounds Using Dual Polynomials |
117
Voted
ISSAC
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
128
Voted
SIGECOM
2008
ACM
15 years 2 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
108
Voted
STOC
1997
ACM
15 years 6 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
123
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
154
Voted
ICDCS
1995
IEEE
15 years 6 months ago
1995
IEEE
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...