2924 search results - page 252 / 585 » Lower Bounds in Distributed Computing |
120
Voted
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
109
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
137
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
130
click to vote
QCQC
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
128
Voted
CIAC
1997
Springer
15 years 8 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...