Showing results 2 to 21 of 49
< previous
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Sublinear-Round Byzantine Agreement Under Corrupt Majority Proceeding/Conference:Public-Key Cryptography – PKC 2020: IACR International Conference on Practice and Theory of Public-Key Cryptography | 2020 | 9 | ||
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree Proceeding/Conference:Lecture Notes in Computer Science | 2012 | 171 | ||
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels Proceeding/Conference:Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020) | 2020 | 20 | ||
An SDP primal-dual algorithm for approximating the lovász-theta function Proceeding/Conference:IEEE International Symposium on Information Theory - Proceedings | 2009 | 114 | ||
SCORAM: oblivious RAM for secure computation Proceeding/Conference:ACM Conference on Computer and Communications Security Proceedings | 2014 | 39 | ||
Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search Proceeding/Conference:The World Wide Web Conference (WWW) 2019 | 2019 | 18 | ||
Revealing optimal thresholds for generalized secretary problem via continuous LP: impacts on online K-item auction and bipartite K-matching with random arrival order Proceeding/Conference:Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2015 | |||
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2014 | 63 | ||
A random-surfer web-graph model Proceeding/Conference:Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics | 2006 | 89 | ||
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics Proceeding/Conference:Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms | 2010 | |||
Private and continual release of statistics Proceeding/Conference:Lecture Notes in Computer Science | 2010 | 202 | ||
Privacy-preserving stream aggregation with fault tolerance Proceeding/Conference:Lecture Notes in Computer Science | 2012 | 376 | ||
Privacy-Preserving Aggregation of Time-Series Data Proceeding/Conference:Annual Network & Distributed System Security Symposium (NDSS) | 2011 | |||
Optimizing social welfare for network bargaining games in the face of unstability, greed and spite Proceeding/Conference:Lecture Notes in Computer Science | 2012 | |||
Optimal lower bound for differentially private multi-party aggregation Proceeding/Conference:Lecture Notes in Computer Science | 2012 | |||
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 | 83 | ||
Online Submodular Maximization Problem with Vector Packing Constraint Proceeding/Conference:The Annual European Symposium on Algorithms | 2017 | |||
Online algorithms for covering and packing problems with convex objectives Proceeding/Conference:IEEE Annual Symposium on Foundations of Computer Science (FOCS) Proceedings | 2016 | |||
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 | |||
On hierarchical routing in doubling metrics Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2005 | 109 |