Showing results 1 to 20 of 49
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
A PTAS for the steiner forest problem in doubling metrics Proceeding/Conference:IEEE Annual Symposium on Foundations of Computer Science, FOCS 2016 | 2016 | 60 | ||
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 | 120 | ||
Approximating TSP on metrics with bounded global growth Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2008 | 104 | ||
Beating ratio 0.5 for weighted oblivious matching problems Proceeding/Conference:European Symposium on Algorithms, ESA 2016 Proceedings | 2016 | |||
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 | 67 | ||
Communication Complexity of Byzantine Agreement, Revisited Proceeding/Conference:Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC '19) | 2019 | 16 | ||
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams Proceeding/Conference:Lecture Notes in Computer Science | 2012 | 181 | ||
Double Auction for Resource Allocation in Cloud Computing Proceeding/Conference:International Conference on Cloud Computing and Services Science, CLOSER 2017 | 2017 | |||
Dynamic tree shortcut with constant degree Proceeding/Conference:Lecture Notes in Computer Science | 2015 | 57 | ||
Fast convergence for consensus in dynamic networks Proceeding/Conference:Lecture Notes in Computer Science | 2011 | 117 | ||
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 | 62 | ||
Foundations of Differentially Oblivious Algorithms Proceeding/Conference:Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019) | 2019 | 4 | ||
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 |