Karl Wimmer

According to our database1, Karl Wimmer authored at least 26 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Hardness of Maximum Likelihood Learning of DPPs.
Electron. Colloquium Comput. Complex., 2022

2021
Identity Testing Under Label Mismatch.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

List Learning with Attribute Noise.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Testing Data Binnings.
Electron. Colloquium Comput. Complex., 2020

2019
Testing k-Monotonicity: The Rise and Fall of Boolean Functions.
Theory Comput., 2019

Flipping Out with Many Flips: Hardness of Testing k-Monotonicity.
SIAM J. Discret. Math., 2019

2018
Invariance Principle on the Slice.
ACM Trans. Comput. Theory, 2018

AC<sup>0</sup>∘MOD<sub>2</sub> lower bounds for the Boolean Inner Product.
J. Comput. Syst. Sci., 2018

2017
K-Monotonicity is Not Testable on the Hypercube.
Electron. Colloquium Comput. Complex., 2017

2016
Agnostic Learning in Permutation-Invariant Domains.
ACM Trans. Algorithms, 2016

Testing k-Monotonicity.
Electron. Colloquium Comput. Complex., 2016

AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Herausforderungen für Pumpspeicher zur Integration zentraler und dezentraler erneuerbarer Erzeugung.
Elektrotech. Informationstechnik, 2015

AC<sup>0</sup> \circ MOD<sub>2</sub> lower bounds for the Boolean Inner Product.
Electron. Colloquium Comput. Complex., 2015

Approximate resilience, monotonicity, and the complexity of agnostic learning.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
New results for random walk learning.
J. Mach. Learn. Res., 2014

Optimal Query Complexity for Estimating the Trace of a Matrix.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates.
Proceedings of the IEEE 29th Conference on Computational Complexity, 2014

2013
KKL, Kruskal-Katona, and Monotone Nets.
SIAM J. Comput., 2013

Tight Lower Bounds for Testing Linear Isomorphism.
Electron. Colloquium Comput. Complex., 2013

Testing Linear-Invariant Function Isomorphism.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2011
Testing Fourier Dimensionality and Sparsity.
SIAM J. Comput., 2011

2010
Polynomial regression under arbitrary product distributions.
Mach. Learn., 2010

Agnostically Learning under Permutation Invariant Distributions.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2007
Approximation by DNF: Examples and Counterexamples.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Logic Design for Printability Using OPC Methods.
IEEE Des. Test Comput., 2006


  Loading...