Showing results 5 to 24 of 49
< previous
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Beating ratio 0.5 for weighted oblivious matching problems Proceeding/Conference:European Symposium on Algorithms, ESA 2016 Proceedings | 2016 | 40 | ||
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort Proceeding/Conference:Symposium on Simplicity in Algorithms Proceedings | 2020 | 16 | ||
Cache-Oblivious and Data-Oblivious Sorting and Applications Proceeding/Conference:Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018 | 39 | ||
Cheeger inequalities for general edge-weighted directed graphs Proceeding/Conference:Lecture Notes in Computer Science | 2015 | 59 | ||
Communication Complexity of Byzantine Agreement, Revisited Proceeding/Conference:Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC '19) | 2019 | 17 | ||
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams Proceeding/Conference:Lecture Notes in Computer Science | 2012 | 174 | ||
Double Auction for Resource Allocation in Cloud Computing Proceeding/Conference:International Conference on Cloud Computing and Services Science, CLOSER 2017 | 2017 | 36 | ||
Dynamic tree shortcut with constant degree Proceeding/Conference:Lecture Notes in Computer Science | 2015 | 50 | ||
Fast convergence for consensus in dynamic networks Proceeding/Conference:Lecture Notes in Computer Science | 2011 | 108 | ||
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 | 58 | ||
Foundations of Differentially Oblivious Algorithms Proceeding/Conference:Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019) | 2019 | 15 | ||
Fully Dynamic <i>k</i>-Center Clustering with Outliers Proceeding/Conference:Lecture Notes in Computer Science | 1-Jan-2023 | |||
Fully Dynamic k-Center Clustering Proceeding/Conference:Proceedings of the 2018 World Wide Web Conference | 2018 | 78 | ||
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 | 48 | ||
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 | 65 | ||
Metric embeddings with relaxed guarantees Proceeding/Conference:Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS | 2005 | 146 |