|
|
Journals in DBLP
J. ACM
2007, volume: 54, number: 3
- Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
Approximation via cost sharing: Simpler and better approximation algorithms for network design. [Citation Graph (0, 0)][DBLP]
J. ACM, 2007, v:54, n:3, pp:11- [Journal]
- Irit Dinur
The PCP theorem by gap amplification. [Citation Graph (0, 0)][DBLP]
J. ACM, 2007, v:54, n:3, pp:12- [Journal]
- Arne Andersson, Mikkel Thorup
Dynamic ordered sets with exponential search trees. [Citation Graph (0, 0)][DBLP]
J. ACM, 2007, v:54, n:3, pp:13- [Journal]
- Vincent Conitzer, Tuomas Sandholm, Jérôme Lang
When are elections with few candidates hard to manipulate?. [Citation Graph (0, 0)][DBLP]
J. ACM, 2007, v:54, n:3, pp:14- [Journal]
- Joseph Y. Halpern, Riccardo Pucella
Characterizing and reasoning about probabilistic and non-probabilistic expectation. [Citation Graph (0, 0)][DBLP]
J. ACM, 2007, v:54, n:3, pp:15- [Journal]
|
