Showing results 1 to 20 of 36
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
A Theory of Composition for Differential Obliviousness Proceeding/Conference:EUROCRYPT 2023 (23/04/2023-27/04/2023, Lyon) | 15-Apr-2023 | ||
Aggregate queries for discrete and continuous probabilistic XML Proceeding/Conference:ICDT '10 - Proceedings of the 13th International Conference on Database Theory | 2010 | ||
Approximating TSP on metrics with bounded global growth Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2008 | ||
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort Proceeding/Conference:Symposium on Simplicity in Algorithms Proceedings | 2020 | ||
Cache-Oblivious and Data-Oblivious Sorting and Applications Proceeding/Conference:Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018 | ||
Communication Complexity of Byzantine Agreement, Revisited Proceeding/Conference:Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC '19) | 2019 | ||
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams Proceeding/Conference:Lecture Notes in Computer Science | 2012 | ||
Double Auction for Resource Allocation in Cloud Computing Proceeding/Conference:International Conference on Cloud Computing and Services Science, CLOSER 2017 | 2017 | ||
Fast convergence for consensus in dynamic networks Proceeding/Conference:Lecture Notes in Computer Science | 2011 | ||
Finding subgraphs with maximum total density and limited overlap Proceeding/Conference:Proceedings of the 8th ACM International Conference on Web Search and Data Mining | 2015 | ||
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election Proceeding/Conference:41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021: Proceedings. Part II, Multi-Party Computation; Lattice Cryptography; and Lattice Cryptanalysis | 2021 | ||
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem Proceeding/Conference:International Conference on Applied Cryptography and Network Security, ACNS 2023 (19/06/2023-22/06/2023, Kyoto) | 28-May-2023 | ||
Large Scale Density-friendly Graph Decomposition via Convex Programming Proceeding/Conference:International Conference on World Wide Web (WWW), 2017 | 2017 | ||
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs Proceeding/Conference:Conference on Information and Knowledge Management, CIKM 2017 Proceedings | 2017 | ||
Metric embeddings with relaxed guarantees Proceeding/Conference:Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS | 2005 | ||
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 | ||
Oblivious data structures Proceeding/Conference:ACM Conference on Computer and Communications Security Proceedings | 2014 | ||
On hierarchical routing in doubling metrics Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2005 | ||
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 |