Aviad Rubinstein
According to our database^{1},
Aviad Rubinstein
authored at least 72 papers
between 2007 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on dl.acm.org
On csauthors.net:
Bibliography
2021
CoRR, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
2020
CoRR, 2020
CoRR, 2020
CoRR, 2020
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Communication complexity of Nash equilibrium in potential games (extended abstract).
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
SIGACT News, 2019
Inf. Process. Lett., 2019
Nearlinear time insertiondeletion codes and (1+<i>ε</i>)approximating edit distance via indexing.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
ACM, ISBN: 9781947487239, 2019
2018
Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity.
ACM Trans. Economics and Comput., 2018
NearLinear Time InsertionDeletion Codes and (1+ε)Approximating Edit Distance via Indexing.
CoRR, 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
PhD thesis, 2017
SIGecom Exch., 2017
J. Cryptol., 2017
CoRR, 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
Proceedings of the 30th Conference on Learning Theory, 2017
2016
ACM Trans. Economics and Comput., 2016
Beyond matroids: secretary problem and prophet inequality with general constraints.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions.
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Proceedings of the 29th Conference on Learning Theory, 2016
2015
SIGecom Exch., 2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
Simple Mechanisms for a Combinatorial Buyer and Applications to Revenue Monotonicity.
CoRR, 2015
CoRR, 2015
CoRR, 2015
CoRR, 2015
Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash.
CoRR, 2015
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
Combining Traditional Marketing and Viral Marketing with Amphibious Influence Maximization.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
2014
CoRR, 2014
CoRR, 2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
CoRR, 2013
2012
Proceedings of the Automata, Languages, and Programming  39th International Colloquium, 2012
2011
Delegation of Computation without Rejection Problem from Designated Verifier CSProofs.
IACR Cryptol. ePrint Arch., 2011
2007
SIAM Rev., 2007