L
Lisa Hellerstein
Researcher at New York University
Publications - 94
Citations - 2033
Lisa Hellerstein is an academic researcher from New York University. The author has contributed to research in topics: Boolean function & Time complexity. The author has an hindex of 26, co-authored 91 publications receiving 1909 citations. Previous affiliations of Lisa Hellerstein include University of Calgary & Carnegie Mellon University.
Papers
More filters
Journal ArticleDOI
Learning read-once formulas with queries
TL;DR: The main results are a polynomial-time algorithm for exact identification of monotone read-once formulas using only membership queries, and a protocol based on the notion of a minimally adequate teacher using equivalence and membership queries.
Journal ArticleDOI
Coding techniques for handling failures in large disk arrays
TL;DR: This paper addresses the problem of designing erasure-correcting binary linear codes that protect against the loss of data caused by disk failures in large disk arrays, and describes how such codes can be used to encode data in disks, and gives a simple method for data reconstruction.
Journal ArticleDOI
Failure correction techniques for large disk arrays
TL;DR: This paper examines alternative choices for encodings, or codes, that reliably store information in disk arrays that are constrained to minimize performance penalties associated with updating information or recovering from catastrophic disk failures.
Journal ArticleDOI
How many queries are needed to learn
TL;DR: It is shown that an honest class is exactly polynomial-query learnable if and only if it is learnable using an oracle for Γ p 4, and a new relationship between query complexity and time complexity in exact learning is shown.
Journal ArticleDOI
Equational characterizations of Boolean function classes
TL;DR: It is shown that a class of Boolean functions can be described by an appropriate set of such first-order sentences if and only if it is closed under permutation of variables.