Showing results 14 to 33 of 68
< previous
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Revisiting the direct sum theorem and space lower bounds in random order streams Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2009 | 38 | ||
Reconstructing numbers from pairwise function values Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2009 | 30 | ||
Recognizing Coverage Functions Journal:SIAM Journal on Discrete Mathematics | 2015 | 40 | ||
Private matchings and allocations Proceeding/Conference:ACM Symposium on the Theory of Computing Annual Proceedings | 2014 | 42 | ||
Private Matchings and Allocations Journal:SIAM Journal on Computing | 2016 | 52 | ||
Privacy Preserving Auction Book:Encyclopedia of Algorithms | 2015 | 83 | ||
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms Journal:ACM Transactions on Algorithms | 2017 | 66 | ||
Primal dual gives almost optimal energy efficient online algorithms Proceeding/Conference:Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms | 2014 | 51 | ||
Optimal Differentially Private Algorithms for k-Means Clustering Proceeding/Conference:Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 2018 | 33 | ||
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals Journal:ACM Transactions on Algorithms | 2019 | 35 | ||
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals Proceeding/Conference:Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) | 2018 | 26 | ||
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 | 74 | ||
Online stochastic matching, poisson arrivals, and the natural linear program Proceeding/Conference:The 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC) | 2021 | 8 | ||
Online Primal Dual: Beyond Linear Programs Journal:ACM SIGACT News | 2014 | 57 | ||
Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue Proceeding/Conference:52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC) | 2020 | 11 | ||
Online Nash Welfare Maximization Without Predictions Proceeding/Conference:19th Conference on Web and Internet Economics (04/12/2023-06/12/2023, Shanghai) | 4-Dec-2023 | |||
Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs Proceeding/Conference:19th Conference on Web and Internet Economics (04/12/2023-06/12/2023, Shanghai) | 4-Dec-2023 | |||
Online Makespan Minimization: The Power of Restart Proceeding/Conference:Proceedings of the 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM 2018) | 2018 | 31 | ||
Online Combinatorial Optimization Problems with Non-linear Objectives Book:Nonlinear Combinatorial Optimization | 2019 | 60 | ||
Online auctions in IaaS clouds: welfare and profit maximization with server costs Proceeding/Conference:SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems | 2015 | 49 |