Discovery - Top 10
Type
Date issued
Journal/Proceeding/Conference
(2)
HKU Organizations
Search
Add filters:
Use filters to refine the search results.
| Title | Author(s) | Issue Date | |
|---|---|---|---|
| 2009 | |||
| 2010 | |||
| 2010 | |||
| 2009 | |||
| 2009 | |||
| 2009 | |||
| 2010 | |||
| 2010 | |||
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs Journal:Proceedings of the VLDB Endowment | 2020 | ||
Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search Proceeding/Conference:The World Wide Web Conference (WWW) 2019 | 2019 | ||
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 | ||
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms Journal:Journal of the ACM | 2018 | ||
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity Journal:ACM Transactions on Algorithms | 2018 | ||
Foundations of Differentially Oblivious Algorithms Proceeding/Conference:Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019) | 2019 | ||
Communication Complexity of Byzantine Agreement, Revisited Proceeding/Conference:Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC '19) | 2019 | ||
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort Proceeding/Conference:Symposium on Simplicity in Algorithms Proceedings | 2020 | ||
Oblivious data structures Proceeding/Conference:ACM Conference on Computer and Communications Security Proceedings | 2014 | ||
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 | ||
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 | ||
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 | ||
Double Auction for Resource Allocation in Cloud Computing Proceeding/Conference:International Conference on Cloud Computing and Services Science, CLOSER 2017 | 2017 | ||
Online Submodular Maximization Problem with Vector Packing Constraint Proceeding/Conference:The Annual European Symposium on Algorithms | 2017 | ||
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs Proceeding/Conference:Conference on Information and Knowledge Management, CIKM 2017 Proceedings | 2017 | ||
Large Scale Density-friendly Graph Decomposition via Convex Programming Proceeding/Conference:International Conference on World Wide Web (WWW), 2017 | 2017 | ||
Finding k most influential edges on flow graphs Journal:Information Systems | 2017 |