Conference Papers by Lisa Hellerstein

  • On the generation of 2-dimensional index workloads. Proceedings of the International Conference on Database Theory (ICDT), Lecture Notes in Computer Science, Vol. 1540, 1999, (with J. M. Hellerstein and G. Kollios). (postscript file) (c) Springer-Verlag

  • Attribute efficient learning with queries. Proceedings of the Ninth Annual ACM Conference on Computational Learning Theory (COLT), 1996 (with Nader Bshouty).

  • Learning conjunctions of two unate DNF formulas: Computational and informational results. Proceedings of the Ninth Annual ACM Conference on Computational Learning Theory (COLT), 1996 (with Aaron Feigelson).

  • How many queries are needed to learn? Proceedings of the 1995 ACM Symposium on the Theory of Computing (STOC), (with Krishnan Pillaipakkamnatt, Vijay Raghavan, and Dawn Wilkins).

  • PAC learning with irrelevant attributes. Proceedings of the 35th IEEE Conference on the Foundations of Computer Science (FOCS), 1994 (with Aditi Dhagat).

  • On the power of finite automata with both nondeterministic and probablistic states. Proceedings of the 1994 ACM Symposium on the Theory of Computing (STOC), (with Anne Condon, Samuel Pottle, and Avi Wigderson).

  • Learning binary matroid ports. Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994 (with Collette Coullard).

  • Read-thrice DNF is hard to learn with membership and equivalence queries. Proceedings of the 33rd IEEE Conference on the Foundations of Computer Science (FOCS), 1992 (with Howard Aizenstein and Leonard Pitt).

  • Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates. Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (COLT), 1992 (with Nader Bshouty and Thomas Hancock).

  • Learning arithmetic read-once formulas. Proceedings of the 24th ACM Symposium on the Theory of Computing (STOC), 1992 (with Nader Bshouty and Thomas Hancock).

  • Learning read-once formulas over fields and extended bases. Proceedings of the Fourth Annual ACM Workshop on Computational Learning Theory (COLT), 1991 (with Thomas Hancock).

  • Learning in the presence of finitely or infinitely many irrelevant attributes. Proceedings of the Fourth ACM Annual Workshop on Computational Learning Theory (COLT), 1991 (with Avrim Blum and Nick Littlestone).

  • Learning read-once formulas using membership queries. Proceedings of the Second Annual Workshop on Computational Learning Theory (COLT), 1989 (with Marek Karpinski).

  • Coding techniques for handling failures in large disk arrays. Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS III), 1989 (with G. Gibson, R.M. Karp, R.H. Katz, and D.A. Patterson).

  • Implementing parallel algorithms in Concurrent Prolog: The MAXFLOW experience. Proceedings of the International Symposium on Logic Programming, 1984 (with Ehud Shapiro).