Complexity of Counting
Bibliographic References tagged with Complexity of Counting
Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Thaler, Justin, Jonathan Ullman, and Salil Vadhan. “Faster Algorithms for Privately Releasing Marginals”. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, and Roger Wattenhofer, Editors, Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP ‘12), Lecture Notes on Computer Science, 7391:810-21. Springer-Verlag, 2012.
Thaler, Justin, Jonathan Ullman, and Salil Vadhan. “Faster Algorithms for Privately Releasing Marginals”. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, and Roger Wattenhofer, Editors, Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP ‘12), Lecture Notes on Computer Science, 7391:810-21. Springer-Verlag, 2012.
Murtagh, Jack, and Salil Vadhan. “The Complexity of Computing the Optimal Composition of Differential Privacy”. Theory of Computing 14 (2018): 1-35.
Murtagh, Jack, and Salil Vadhan. “The Complexity of Computing the Optimal Composition of Differential Privacy”. Theory of Computing 14 (2018): 1-35.
Vadhan, Salil. “The Complexity of Counting in Sparse, Regular, and Planar Graphs.”. SIAM Journal on Computing 31, no. 2 (2001): 398-427.
Vadhan, Salil. “The Complexity of Counting in Sparse, Regular, and Planar Graphs.”. SIAM Journal on Computing 31, no. 2 (2001): 398-427.