pith. sign in

Mark Braverman

Identifiers

  • name variant Mark Braverman 0.60 · backfill

Papers (51)

  1. Hardness of Approximate Hylland-Zeckhauser Equilibria cs.GT · 2026 · author #1
  2. RubiConv -- Efficient Boundary-Respecting Convolutions cs.LG · 2026 · author #6
  3. AI Alignment via Incentives and Correction cs.LG · 2026 · author #3
  4. Learning from Equivalence Queries, Revisited cs.LG · 2026 · author #1
  5. Sorted Top-k in Rounds cs.DS · 2019 · author #1
  6. Calibration, Entropy Rates, and Memory in Language Models cs.CL · 2019 · author #1
  7. Space-bounded Church-Turing thesis and computational tractability of closed systems cs.CC · 2019 · author #1
  8. The Price of Uncertain Priors in Source Coding cs.IT · 2018 · author #1
  9. Selling to a No-Regret Buyer cs.GT · 2017 · author #1
  10. Multi-armed Bandit Problems with Strategic Arms cs.GT · 2017 · author #1
  11. On Simultaneous Two-player Combinatorial Auctions cs.GT · 2017 · author #1
  12. Network coding in undirected graphs is either very helpful or not helpful at all cs.IT · 2016 · author #1
  13. Parallel Algorithms for Select and Partition with Noisy Comparisons cs.DS · 2016 · author #1
  14. Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions cs.GT · 2015 · author #1
  15. Tight space-noise tradeoffs in computing the ergodic measure cs.CC · 2015 · author #1
  16. Coding for interactive communication correcting insertions and deletions cs.DS · 2015 · author #1
  17. Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality cs.LG · 2015 · author #1
  18. Near-optimal bounds on bounded-round quantum communication complexity of disjointness cs.CC · 2015 · author #1
  19. ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness cs.CC · 2015 · author #1
  20. Information complexity is computable cs.IT · 2015 · author #1
  21. Simulating Noisy Channel Interaction cs.IT · 2014 · author #1
  22. Contracting Experts With Unknown Cost Structures cs.GT · 2014 · author #1
  23. Optimal Provision-After-Wait in Healthcare cs.GT · 2013 · author #1
  24. Tight Bounds for Set Disjointness in the Message Passing Model cs.DS · 2013 · author #1
  25. Search using queries on indistinguishable items cs.DS · 2013 · author #1
  26. On the Convergence of the Hegselmann-Krause System cs.DS · 2012 · author #2
  27. Truthful Mechanisms for Competing Submodular Processes cs.GT · 2012 · author #2
  28. Finding Endogenously Formed Communities cs.DS · 2012 · author #3
  29. Noise vs computational intractability in dynamics cs.CC · 2012 · author #1
  30. A discrepancy lower bound for information complexity cs.CC · 2011 · author #1
  31. Information Equals Amortized Communication cs.IT · 2011 · author #1
  32. Inapproximability of NP-Complete Variants of Nash Equilibrium cs.CC · 2011 · author #2
  33. The Grothendieck constant is strictly smaller than Krivine's bound math.FA · 2011 · author #1
  34. Matching with Couples Revisited cs.GT · 2010 · author #2
  35. Thurston equivalence to a rational map is decidable math.DS · 2010 · author #2
  36. Computability of Brolin-Lyubich Measure math.DS · 2010 · author #2
  37. Nash Equilibria in Perturbation Resilient Games cs.GT · 2010 · author #2
  38. Pebbles and Branching Programs for Tree Evaluation cs.CC · 2010 · author #4
  39. Sorting from Noisy Information cs.DS · 2009 · author #1
  40. The rate of convergence of the Walk on Spheres Algorithm math.PR · 2008 · author #2
  41. On ad hoc routing with guaranteed delivery cs.DC · 2008 · author #1
  42. Noisy Sorting Without Resampling cs.DS · 2007 · author #1
  43. Computability of Julia sets math.DS · 2006 · author #1
  44. Mafia: A theoretical study of players and coalitions in a partial information environment math.PR · 2006 · author #1
  45. Constructing Non-Computable Julia Sets math.DS · 2006 · author #1
  46. On computability of Julia sets: answers to questions of Milnor and Shub math.DS · 2006 · author #1
  47. Computing over the Reals: Foundations for Scientific Computing cs.CC · 2005 · author #1
  48. On computational complexity of Riemann mapping math.CV · 2005 · author #2
  49. Parabolic Julia Sets are Polynomial Time Computable math.DS · 2005 · author #1
  50. On the Complexity of Real Functions cs.CC · 2005 · author #1
  51. Non-computable Julia sets math.DS · 2004 · author #1

Mentions

  • 1511.02831 #1 · backfill · confidence 0.70 Mark Braverman
  • 1508.05372 #1 · backfill · confidence 0.70 Mark Braverman
  • 1508.00514 #1 · backfill · confidence 0.70 Mark Braverman
  • 1506.07216 #1 · backfill · confidence 0.70 Mark Braverman
  • math/0505036 #1 · arxiv_oai · confidence 0.70 Mark Braverman
  • 1505.03110 #1 · backfill · confidence 0.70 Mark Braverman
  • 1504.08352 #1 · backfill · confidence 0.70 Mark Braverman
  • 1502.02971 #1 · backfill · confidence 0.70 Mark Braverman
  • 2606.00951 #1 · arxiv_oai · confidence 0.70 Mark Braverman
  • 1409.4290 #1 · backfill · confidence 0.70 Mark Braverman
  • 1404.7239 #1 · backfill · confidence 0.70 Mark Braverman
  • 1312.1955 #1 · backfill · confidence 0.70 Mark Braverman
  • 1305.4696 #1 · backfill · confidence 0.70 Mark Braverman
  • 1302.0892 #1 · backfill · confidence 0.70 Mark Braverman
  • 1211.1909 #2 · backfill · confidence 0.70 Mark Braverman
  • 1202.2097 #2 · backfill · confidence 0.70 Mark Braverman
  • 1201.4899 #3 · backfill · confidence 0.70 Mark Braverman
  • 1201.0488 #1 · backfill · confidence 0.70 Mark Braverman
  • 1112.2000 #1 · backfill · confidence 0.70 Mark Braverman
  • 1106.3595 #1 · backfill · confidence 0.70 Mark Braverman
  • 1104.3760 #2 · backfill · confidence 0.70 Mark Braverman
  • 1103.6161 #1 · backfill · confidence 0.70 Mark Braverman
  • 1011.2121 #2 · backfill · confidence 0.70 Mark Braverman
  • 1009.5713 #2 · backfill · confidence 0.70 Mark Braverman
  • 1009.3464 #2 · backfill · confidence 0.70 Mark Braverman
  • 1008.1827 #2 · backfill · confidence 0.70 Mark Braverman
  • 1005.2642 #4 · backfill · confidence 0.70 Mark Braverman
  • 0910.1191 #1 · backfill · confidence 0.70 Mark Braverman
  • 0810.3343 #2 · backfill · confidence 0.70 Mark Braverman
  • 0804.0862 #1 · backfill · confidence 0.70 Mark Braverman
  • 0707.1051 #1 · backfill · confidence 0.70 Mark Braverman

Frequent Coauthors