Showing results 21 to 40 of 49
< previous
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Large Scale Density-friendly Graph Decomposition via Convex Programming Proceeding/Conference:International Conference on World Wide Web (WWW), 2017 | 2017 | 54 | ||
Locally Differentially Private Sparse Vector Aggregation Proceeding/Conference:2022 IEEE Symposium on Security and Privacy (SP) | 2022 | |||
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs Proceeding/Conference:Conference on Information and Knowledge Management, CIKM 2017 Proceedings | 2017 | 95 | ||
Metric embeddings with relaxed guarantees Proceeding/Conference:Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS | 2005 | 156 | ||
Multi-Dimensional Range Query over Encrypted Data Proceeding/Conference:Proceedings - IEEE Symposium on Security and Privacy | 2007 | |||
New Doubling Spanners: Better and Simpler Proceeding/Conference:Lecture Notes in Computer Science | 2013 | 47 | ||
Oblivious data structures Proceeding/Conference:ACM Conference on Computer and Communications Security Proceedings | 2014 | 228 | ||
Oblivious RAM with O((log N)3) worst-case cost Proceeding/Conference:Lecture Notes in Computer Science | 2011 | 187 | ||
On hierarchical routing in doubling metrics Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2005 | 109 | ||
On the Hardness of Opinion Dynamics Optimization with <i>L</i>1-Budget on Varying Susceptibility to Persuasion Proceeding/Conference:Lecture Notes in Computer Science | 24-Oct-2021 | |||
Online algorithms for covering and packing problems with convex objectives Proceeding/Conference:IEEE Annual Symposium on Foundations of Computer Science (FOCS) Proceedings | 2016 | |||
Online Submodular Maximization Problem with Vector Packing Constraint Proceeding/Conference:The Annual European Symposium on Algorithms | 2017 | |||
Online Submodular Maximization with Free Disposal: Randomization Beats ΒΌ for Partition Matroids Proceeding/Conference:Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017 | 83 | ||
Optimal lower bound for differentially private multi-party aggregation Proceeding/Conference:Lecture Notes in Computer Science | 2012 | |||
Optimizing social welfare for network bargaining games in the face of unstability, greed and spite Proceeding/Conference:Lecture Notes in Computer Science | 2012 | |||
Privacy-Preserving Aggregation of Time-Series Data Proceeding/Conference:Annual Network & Distributed System Security Symposium (NDSS) | 2011 | |||
Privacy-preserving stream aggregation with fault tolerance Proceeding/Conference:Lecture Notes in Computer Science | 2012 | 376 | ||
Private and continual release of statistics Proceeding/Conference:Lecture Notes in Computer Science | 2010 | 202 | ||
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics Proceeding/Conference:Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms | 2010 | |||
A random-surfer web-graph model Proceeding/Conference:Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics | 2006 | 89 |