Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
![]() |
Counting independent sets up to the tree thresholdWeitz, DrorAnnual ACM Symposium on Theory of Computing: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing; 21-23 May 2006, 2006, p.140-149 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
2 |
Material Type: Ata de Congresso
|
![]() |
Linear degree extractors and the inapproximability of max clique and chromatic numberZuckerman, DavidAnnual ACM Symposium on Theory of Computing: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing; 21-23 May 2006, 2006, p.681-690 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
3 |
Material Type: Ata de Congresso
|
![]() |
Searching dynamic point sets in spaces with bounded doubling dimensionCole, Richard ; Gottlieb, Lee-AdAnnual ACM Symposium on Theory of Computing: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing; 21-23 May 2006, 2006, p.574-583 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Incremental proximal methods for large scale convex optimizationBertsekas, Dimitri P.Mathematical programming, 2011-10, Vol.129 (2), p.163-195 [Periódico revisado por pares]Berlin/Heidelberg: Springer-VerlagTexto completo disponível |
5 |
Material Type: Ata de Congresso
|
![]() |
Extractors for a constant number of polynomially small min-entropy independent sourcesRao, AnupAnnual ACM Symposium on Theory of Computing: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing; 21-23 May 2006, 2006, p.497-506 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
6 |
Material Type: Ata de Congresso
|
![]() |
Deterministic extractors for small-space sourcesKamp, Jesse ; Rao, Anup ; Vadhan, Salil ; Zuckerman, DavidAnnual ACM Symposium on Theory of Computing: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing; 21-23 May 2006, 2006, p.691-700 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
A note on the complexity of Lp minimizationGe, Dongdong ; Jiang, Xiaoye ; Ye, YinyuMathematical programming, 2011-10, Vol.129 (2), p.285-299 [Periódico revisado por pares]Berlin/Heidelberg: Springer-VerlagTexto completo disponível |
8 |
Material Type: Ata de Congresso
|
![]() |
Linear time low tree-width partitions and algorithmic consequencesNešetřil, Jaroslav ; de Mendez, Patrice OssonaAnnual ACM Symposium on Theory of Computing: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing; 21-23 May 2006, 2006, p.391-400 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
9 |
Material Type: Ata de Congresso
|
![]() |
On the randomness complexity of efficient samplingDubrov, Bella ; Ishai, YuvalAnnual ACM Symposium on Theory of Computing: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing; 21-23 May 2006, 2006, p.711-720 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Adaptive Drift AnalysisDoerr, Benjamin ; Goldberg, Leslie AnnAlgorithmica, 2013, Vol.65 (1), p.224-250 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |