Aviad Rubinstein

Available identifiers

zbMath Open rubinstein.aviadMaRDI QIDQ1698393

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126359	2024-04-09	Paper
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria	2023-12-19	Paper
Exponential communication separations between notions of selfishness	2023-11-14	Paper
Settling the complexity of Nash equilibrium in congestion games	2023-11-14	Paper
The randomized communication complexity of randomized auctions	2023-11-14	Paper
The Limitations of Optimization from Samples	2023-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q5875712	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875764	2023-02-03	Paper
An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model	2022-12-01	Paper
Communication complexity of approximate Nash equilibria	2022-07-15	Paper
On the complexity of dynamic mechanism design	2022-07-15	Paper
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria	2022-01-07	Paper
https://portal.mardi4nfdi.de/entity/Q4993300	2021-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q4993305	2021-06-15	Paper
Reducing approximate Longest Common Subsequence to approximate Edit Distance	2021-02-02	Paper
Does preprocessing help in fast sequence comparisons?	2021-01-19	Paper
Constant-factor approximation of near-linear edit distance in near-linear time	2021-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q5111408	2020-05-27	Paper
An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model	2020-01-30	Paper
Near-linear time insertion-deletion codes and (1+ ε )-approximating edit distance via indexing	2020-01-30	Paper
Fine-grained Complexity Meets IP = PSPACE	2019-10-15	Paper
An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation	2019-10-15	Paper
Hardness of approximate nearest neighbor search	2019-08-22	Paper
On the complexity of dynamic mechanism design	2018-07-16	Paper
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions	2018-07-16	Paper
Sorting from Noisier Samples	2018-07-16	Paper
ETH Hardness for Densest-k-Subgraph with Perfect Completeness	2018-07-16	Paper
Combinatorial Prophet Inequalities	2018-07-16	Paper
Inapproximability of Nash Equilibrium	2018-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q4638096	2018-05-03	Paper
The hunting of the SNARK	2018-02-15	Paper
Robust Probabilistic Inference	2017-10-05	Paper
Beyond matroids: secretary problem and prophet inequality with general constraints	2017-09-29	Paper
Communication complexity of approximate Nash equilibria	2017-08-17	Paper
The limitations of optimization from samples	2017-08-17	Paper
Can Almost Everybody be Almost Happy?	2016-04-15	Paper
On the Computational Complexity of Optimal Simple Mechanisms	2016-04-15	Paper
Boolean functions whose Fourier transform is concentrated on pairwise disjoint subsets of the input	2015-12-30	Paper
Inapproximability of Nash Equilibrium	2015-08-21	Paper
On Simplex Pivoting Rules and Complexity Theory	2014-06-02	Paper
Converting Online Algorithms to Local Computation Algorithms	2013-08-12	Paper
Determining Sets for the Discrete Laplacian	2007-06-26	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Aviad Rubinstein