Showing results 6 to 25 of 37
< previous
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
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 | ||
Generalized Sorting with Predictions Revisited Proceeding/Conference:Frontier of Algorithmic Wisdom - International Joint Conference, IJTCS-FAW 2023 (14/08/2023-18/08/2023, Macau) | 26-Aug-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 | ||
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 | ||
Optimizing social welfare for network bargaining games in the face of unstability, greed and spite Proceeding/Conference:Lecture Notes in Computer Science | 2012 |