|
|
 |
| |
Near-linear
cost construction of sparse neighborhood covers |
|
| | Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg
|
|
| | SIAM Journal on Computing (1998) 28 no. 1, 263-277.
|
|
|
abstract |
bibTeX citation |
publisher's site |
| |
Fast
distributed network decomposition |
|
| | Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg
|
|
| | Journal of Parallel and Distributed Computing (1996) 39 no. 2, 105-114.
|
|
|
abstract |
bibTeX citation |
publisher's site |
| |
Nearly
optimal algorithms and bounds for multilayer channel routing |
|
| | Bonnie Berger, Martin Brady, Donna Brown, and Tom Leighton
|
|
| | Journal of the Association for Computing Machinery (1995) 42 no. 2, 500-542.
|
|
|
abstract |
bibTeX citation |
publisher's site |
| |
Low
diameter graph decomposition is in NC |
|
| | Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg
|
|
| | Random Structures and Algorithms (1994) 5 no. 3, 441-452.
|
|
|
abstract |
bibTeX citation |
publisher's site |
| |
Efficient NC
algorithms for set cover with applications to learning and geometry
|
|
| | Bonnie Berger, John Rompel, and Peter W. Shor
|
|
| | Journal of Computer and System Sciences (1994) 49 no. 3, 454-477.
|
|
|
abstract |
bibTeX citation |
|
| |
A better
performance guarantee for approximate graph coloring |
|
| | Bonnie Berger and John Rompel
|
|
| | Algorithmica (1990) 5 no. 3, 459-466.
|
|
|
abstract |
bibTeX citation |
|
|
|
|
|
|