vix.ing · top · new · best · stats · spec

Mark Braverman

  1. Noisy Sorting Without Resampling
    2007/07/06 by Mark Braverman, Elchanan Mossel, Braverman, Mark +1 · 14 citations
    Computer Science · Economics, Econometrics and Finance · #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Game Theory and Voting Systems #Optimization and Search Problems
  2. Communication Lower Bounds for Statistical Estimation Problems via a\n Distributed Data Processing Inequality
    2015/06/23 by Mark Braverman, Ankit Garg, Braverman, Mark +7 · 6 citations
    Mathematics · Computer Science · #Statistical Methods and Inference #Stochastic Gradient Optimization Techniques #Privacy-Preserving Technologies in Data
  3. The Role of Randomness and Noise in Strategic Classification
    2020/05/17 by Mark Braverman, Braverman, Mark, Sumegha Garg +1 · 4 citations
    Decision Sciences · Social Sciences · #Auction Theory and Applications #Game Theory and Applications #Corruption and Economic Development
  4. Calibration, Entropy Rates, and Memory in Language Models
    2019/06/11 by Mark Braverman, Xinyi Chen, Braverman, Mark +9 · 4 citations
    Computer Science · Social Sciences · #Topic Modeling #Natural Language Processing Techniques #Language and cultural evolution
  5. Parallel Algorithms for Select and Partition with Noisy Comparisons
    2016/03/16 by Mark Braverman, Jieming Mao, Braverman, Mark +3 · 3 citations
    Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Machine Learning and Algorithms
  6. ETH Hardness for Densest-k-Subgraph with Perfect Completeness
    2015/04/30 by Mark Braverman, Young Kun-Ko, Braverman, Mark +5 · 2 citations
    Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Machine Learning and Algorithms #Machine Learning and Data Classification
  7. On the Complexity of Real Functions
    2005/02/15 by Mark Braverman, Braverman, Mark · 1 citation
    Computer Science · Mathematics · #Computational Complexity (cs.CC) #F. 1.1 #F. 4. 1 #FOS: Computer and information sciences #FOS: Mathematics #Numerical Analysis (math.NA) #cs.CC #cs.NA #math.NA
  8. Near-optimal bounds on bounded-round quantum communication complexity of\n disjointness
    2015/05/12 by Mark Braverman, Braverman, Mark, Ankit Garg +7 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)
  9. Optimality of Frequency Moment Estimation
    2024/11/04 by Mark Braverman, Or Zamir, Braverman, Mark +1 · 1 voice · 1 citation
    Computer Science · Engineering · #Structural Health Monitoring Techniques #cs.CC #cs.DS #cs.IT
  10. A New Information Complexity Measure for Multi-pass Streaming with Applications
    2024/03/29 by Mark Braverman, Sumegha Garg, Braverman, Mark +9 · 1 citation
    Computer Science · #Cloud Computing and Resource Management #Quantum Computing Algorithms and Architecture #IoT and Edge/Fog Computing