Logic Design for Printability Using OPC Methods. - Kevin Lucas; Chi-Min Yuan; Robert Boone; Karl Wimmer; Kirk Strozewski; Olivier Toublan (IEEE Des. Test Comput., 2006)

Approximation by DNF: Examples and Counterexamples. - Ryan O'Donnell; Karl Wimmer (ICALP, 2007)

Agnostically Learning under Permutation Invariant Distributions. - Karl Wimmer (FOCS, 2010)

Polynomial regression under arbitrary product distributions. - Eric Blais; Ryan O'Donnell; Karl Wimmer (Mach. Learn., 2010)

Testing Fourier Dimensionality and Sparsity. - Parikshit Gopalan; Ryan O'Donnell; Rocco A. Servedio; Amir Shpilka; Karl Wimmer (SIAM J. Comput., 2011)

Testing Linear-Invariant Function Isomorphism. - Karl Wimmer; Yuichi Yoshida (ICALP (1), 2013)

Tight Lower Bounds for Testing Linear Isomorphism. - Elena Grigorescu; Karl Wimmer; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2013)

KKL, Kruskal-Katona, and Monotone Nets. - Ryan O'Donnell; Karl Wimmer (SIAM J. Comput., 2013)

Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates. - Karl Wimmer (CCC, 2014)

Optimal Query Complexity for Estimating the Trace of a Matrix. - Karl Wimmer; Yi Wu 002; Peng Zhang 052 (ICALP (1), 2014)

New results for random walk learning. - Jeffrey C. Jackson; Karl Wimmer (J. Mach. Learn. Res., 2014)

Approximate resilience, monotonicity, and the complexity of agnostic learning. - Dana Dachman-Soled; Vitaly Feldman; Li-Yang Tan; Andrew Wan; Karl Wimmer (SODA, 2015)

AC0 circ MOD2 lower bounds for the Boolean Inner Product. - Mahdi Cheraghchi; Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2015)

Herausforderungen für Pumpspeicher zur Integration zentraler und dezentraler erneuerbarer Erzeugung. - Karl Wimmer (Elektrotech. Informationstechnik, 2015)

AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product. - Mahdi Cheraghchi; Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (ICALP, 2016)

Testing k-Monotonicity. - Clément L. Canonne; Elena Grigorescu; Siyao Guo; Akash Kumar 003; Karl Wimmer (Electron. Colloquium Comput. Complex., 2016)

Agnostic Learning in Permutation-Invariant Domains. - Karl Wimmer (ACM Trans. Algorithms, 2016)

K-Monotonicity is Not Testable on the Hypercube. - Elena Grigorescu; Akash Kumar 003; Karl Wimmer (Electron. Colloquium Comput. Complex., 2017)

AC0∘MOD2 lower bounds for the Boolean Inner Product. - Mahdi Cheraghchi; Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (J. Comput. Syst. Sci., 2018)

Invariance Principle on the Slice. - Yuval Filmus; Guy Kindler; Elchanan Mossel; Karl Wimmer (ACM Trans. Comput. Theory, 2018)

Flipping Out with Many Flips: Hardness of Testing k-Monotonicity. - Elena Grigorescu; Akash Kumar 003; Karl Wimmer (SIAM J. Discret. Math., 2019)

Testing k-Monotonicity: The Rise and Fall of Boolean Functions. - Clément L. Canonne; Elena Grigorescu; Siyao Guo; Akash Kumar 003; Karl Wimmer (Theory Comput., 2019)

Testing Data Binnings. - Clément L. Canonne; Karl Wimmer (Electron. Colloquium Comput. Complex., 2020)

List Learning with Attribute Noise. - Mahdi Cheraghchi; Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (AISTATS, 2021)

Identity Testing Under Label Mismatch. - Clément L. Canonne; Karl Wimmer (ISAAC, 2021)

Hardness of Maximum Likelihood Learning of DPPs. - Elena Grigorescu; Brendan Juba; Karl Wimmer; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2022)