Showing results 30 to 36 of 36
< previous
Title | Author(s) | Issue Date | |
---|---|---|---|
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 | ||
SCORAM: oblivious RAM for secure computation Proceeding/Conference:ACM Conference on Computer and Communications Security Proceedings | 2014 | ||
An SDP primal-dual algorithm for approximating the lovász-theta function Proceeding/Conference:IEEE International Symposium on Information Theory - Proceedings | 2009 | ||
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 | ||
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree Proceeding/Conference:Lecture Notes in Computer Science | 2012 | ||
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 | ||
Ultra-low-dimensional embeddings for doubling metrics Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2008 |