pith. sign in

Vahab Mirrokni

Identifiers

  • name variant Vahab Mirrokni 0.60 · backfill

Papers (48)

  1. Language Models Need Sleep: Learning to Self-Modify and Consolidate Memories cs.LG · 2026 · author #3
  2. Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities cs.CL · 2025 · author #3100
  3. TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate cs.LG · 2025 · author #4
  4. Gemma 3 Technical Report cs.CL · 2025 · author #188
  5. Titans: Learning to Memorize at Test Time cs.LG · 2024 · author #3
  6. MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings cs.DS · 2024 · author #5
  7. Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context cs.CL · 2024 · author #666
  8. Dynamic First Price Auctions Robust to Heterogeneous Buyers cs.GT · 2019 · author #3
  9. Distributed Weighted Matching via Randomized Composable Coresets cs.DC · 2019 · author #3
  10. Massively Parallel Computation via Remote Memory Access cs.DC · 2019 · author #6
  11. Optimal Dynamic Auctions are Virtual Welfare Maximizers cs.GT · 2018 · author #1
  12. Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problems cs.LG · 2018 · author #5
  13. Massively Parallel Dynamic Programming on Trees cs.DS · 2018 · author #5
  14. Parallel and Streaming Algorithms for K-Core Decomposition cs.DS · 2018 · author #3
  15. Connected Components at Scale via Local Contractions cs.DC · 2018 · author #2
  16. Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions stat.ML · 2018 · author #5
  17. Accelerating Greedy Coordinate Descent Methods math.OC · 2018 · author #3
  18. Stochastic bandits robust to adversarial corruptions cs.LG · 2018 · author #2
  19. Optimizing cluster-based randomized experiments under a monotonicity assumption stat.ME · 2018 · author #3
  20. Robust Repeated Auctions under Heterogeneous Buyer Behavior cs.GT · 2018 · author #3
  21. ASYMP: Fault-tolerant Mining of Massive Graphs cs.DC · 2017 · author #3
  22. Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order cs.DS · 2017 · author #2
  23. Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models cs.DS · 2017 · author #3
  24. Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs cs.DS · 2017 · author #4
  25. Overcommitment in Cloud Services -- Bin packing with Chance Constraints cs.DS · 2017 · author #3
  26. Matroids Hitting Sets and Unsupervised Dependency Grammar Induction cs.DM · 2017 · author #2
  27. Distributed Coverage Maximization via Sketching cs.DS · 2016 · author #3
  28. Randomized Experimental Design via Geographic Clustering cs.SI · 2016 · author #5
  29. Almost Optimal Streaming Algorithms for Coverage Problems cs.DS · 2016 · author #3
  30. Consistent Hashing with Bounded Loads cs.DS · 2016 · author #1
  31. Optimal dynamic mechanisms with ex-post IR via bank accounts cs.GT · 2016 · author #1
  32. Tight Bounds for Approximate Carath\'eodory and Beyond cs.DS · 2015 · author #1
  33. Distributed Balanced Partitioning via Linear Embedding cs.DC · 2015 · author #3
  34. Expanders via Local Edge Flips cs.DS · 2015 · author #4
  35. Randomized Composable Core-sets for Distributed Submodular Maximization cs.DS · 2015 · author #1
  36. Multiplicative Bidding in Online Advertising cs.DS · 2014 · author #3
  37. Clinching Auctions Beyond Hard Budget Constraints cs.GT · 2014 · author #2
  38. Local Graph Clustering Beyond Cheeger's Inequality cs.DS · 2013 · author #3
  39. Clinching Auctions with Online Supply cs.GT · 2012 · author #2
  40. On the Implications of Lookahead Search in Game Playing cs.GT · 2012 · author #1
  41. Polyhedral Clinching Auctions and the Adwords Polytope cs.GT · 2012 · author #2
  42. On the Non-Progressive Spread of Influence through Social Networks cs.SI · 2011 · author #5
  43. Yield Optimization of Display Advertising with Ad Exchange math.OC · 2011 · author #3
  44. Quasi-Proportional Mechanisms: Prior-free Revenue Maximization cs.GT · 2009 · author #1
  45. Online Stochastic Matching: Beating 1-1/e cs.DS · 2009 · author #3
  46. On the complexity of Nash dynamics and Sink Equilibria cs.GT · 2009 · author #1
  47. Non-monotone submodular maximization under matroid and knapsack constraints cs.CC · 2009 · author #2
  48. Bid Optimization in Broad-Match Ad auctions cs.GT · 2009 · author #3

Mentions

  • 2405.19504 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
  • 1510.07768 #4 · backfill · confidence 0.70 Vahab Mirrokni
  • 1506.06715 #1 · backfill · confidence 0.70 Vahab Mirrokni
  • 1102.2551 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
  • 2606.03979 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
  • 1404.6727 #3 · backfill · confidence 0.70 Vahab Mirrokni
  • 1404.5000 #2 · backfill · confidence 0.70 Vahab Mirrokni
  • 1304.8132 #3 · backfill · confidence 0.70 Vahab Mirrokni
  • 1210.1456 #2 · backfill · confidence 0.70 Vahab Mirrokni
  • 1202.4134 #1 · backfill · confidence 0.70 Vahab Mirrokni
  • 1201.0404 #2 · backfill · confidence 0.70 Vahab Mirrokni
  • 1106.3826 #5 · backfill · confidence 0.70 Vahab Mirrokni
  • 2504.19874 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
  • 1102.2551 #3 · backfill · confidence 0.70 Vahab Mirrokni
  • 0909.5365 #1 · backfill · confidence 0.70 Vahab Mirrokni
  • 0905.4100 #3 · backfill · confidence 0.70 Vahab Mirrokni
  • 0902.0382 #1 · backfill · confidence 0.70 Vahab Mirrokni
  • 0902.0353 #2 · backfill · confidence 0.70 Vahab Mirrokni
  • 0901.3754 #3 · backfill · confidence 0.70 Vahab Mirrokni

Frequent Coauthors