2924 search results - page 45 / 585 » Lower Bounds in Distributed Computing |
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
IPL
2002
13 years 8 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
SPIRE
2001
Springer
14 years 1 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
EUROCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the...
TOC
2008
13 years 8 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....