501 search results - page 22 / 101 » Communication Lower Bounds Using Dual Polynomials |
134
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
124
Voted
WINE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
116
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
108
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
126
Voted
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
15 years 2 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...