Showing results 1 to 20 of 82
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
A feedforward unitary equivariant neural network Journal:Neural Networks | 4-Feb-2023 | |||
A PTAS for the steiner forest problem in doubling metrics Proceeding/Conference:IEEE Annual Symposium on Foundations of Computer Science, FOCS 2016 | 2016 | 51 | ||
A PTAS for the Steiner Forest Problem in Doubling Metrics Journal:SIAM Journal on Computing | 2018 | 19 | ||
A Theory of Composition for Differential Obliviousness Proceeding/Conference:EUROCRYPT 2023 (23/04/2023-27/04/2023, Lyon) | 15-Apr-2023 | |||
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics Journal:ACM Transactions on Algorithms | 2020 | 23 | ||
Aggregate queries for discrete and continuous probabilistic XML Proceeding/Conference:ICDT '10 - Proceedings of the 13th International Conference on Database Theory | 2010 | 114 | ||
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity Journal:ACM Transactions on Algorithms | 2018 | 18 | ||
Approximating TSP on metrics with bounded global growth Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2008 | 99 | ||
Approximating TSP on Metrics with Bounded Global Growth Journal:SIAM Journal on Computing | 2012 | 160 | ||
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 | ||
Capturing continuous data and answering aggregate queries in probabilistic XML Journal:ACM Transactions on Database Systems | 2011 | 171 | ||
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 | ||
Distributed approximate k-core decomposition and min–max edge orientation: Breaking the diameter barrier Journal:Journal of Parallel and Distributed Computing | 2021 | |||
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 |