Adam Freilich

Learn More
We focus on (partial) functions that map input strings to a monoid such as the set of integers with addition and the set of output strings with concatenation. The notion of regularity for such functions has been defined using two-way finite-state transducers, (one-way) cost register automata, and MSO-definable graph transformations. In this paper, we give(More)
In the problem of high-dimensional convexity testing, there is an unknown set S ⊆ R which is promised to be either convex or ε-far from every convex body with respect to the standard multivariate normal distribution N (0, 1). The job of a testing algorithm is then to distinguish between these two cases while making as few inspections of the set S as(More)
  • 1