Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Hellerstein, Lisa"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Max-throughput for (conservative)
k
-of-
n
testing
Lisa Hellerstein
,
Özgür Özkan
,
Linda Sellie
Lecture Notes in Computer Science
7074
, 2011, pp. 703-713
Minimizing disjunctive normal form formulas and AC
^0
circuits given a truth table
Eric Allender
,
Lisa Hellerstein
,
Paul McCabe
,
Toniann Pitassi
,
Michael Saks
SIAM Journal on Computing
38
(1), 2008, pp. 63-84
On PAC learning algorithms for rich Boolean function classes
Lisa Hellerstein
,
Rocco A. Servedio
Theoretical Computer Science
384
(1), 2007, pp. 66-76
Exact learning of DNF formulas using DNF hypotheses
Lisa Hellerstein
,
Vijay Raghavan
Journal of Computer and System Sciences
70
(4), 2005, pp. 435-470
Exact learning of DNF formulas using DNF hypotheses
Lisa Hellerstein
,
Vijay Raghavan
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 465-473
Attribute-efficient learning in query and mistake-bound models
Nader Bshouty
,
Lisa Hellerstein
Journal of Computer and System Sciences
56
(3), 1998, pp. 310-319
On the power of finite automata with both nondeterministic and probabilistic states
Anne Condon
,
Lisa Hellerstein
,
Samuel Pottle
,
Avi Wigderson
SIAM Journal on Computing
27
(3), 1998, pp. 739-762
Conjunctions of unate DNF formulas: Learning and structure
Aaron Feigelson
,
Lisa Hellerstein
Information and Computation
140
(2), 1998, pp. 203-228
The forbidden projections of unate functions
Aaron Feigelson
,
Lisa Hellerstein
Discrete Applied Mathematics
77
(3), 1997, pp. 221-236
Independence and port oracles for matroids, with an application to computational learning theory
Collette R. Coullard
,
Lisa Hellerstein
Combinatorica
16
(2), 1996, pp. 189-208
Learning in the presence of finitely or infinitely many irrelevant attributes
Avrim Blum
,
Lisa Hellerstein
,
Nick Littlestone
Journal of Computer and System Sciences
50
(1), 1995, pp. 32-40
Learning Boolean read-once formulas over generalized bases
Nader H. Bshouty
,
Thomas R. Hancock
,
Lisa Hellerstein
Journal of Computer and System Sciences
50
(3), 1995, pp. 521-542
Learning arithmetic read-once formulas
Nader H. Bshouty
,
Thomas R. Hancock
,
Lisa Hellerstein
SIAM Journal on Computing
24
(4), 1995, August, pp. 706-735
How many queries are needed to learn?
Lisa Hellerstein
,
Krishnan Pillaipakkamnatt
,
Vijay Raghavan
,
Dawn Wilkins
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 190-199
On the power of finite automata with both nondeterministic and probabilistic states
Anne Condon
,
Lisa Hellerstein
,
Samuel Pottle
,
Avi Wigderson
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 676-685
PAC learning with irrelevant attributes
Aditi Dhagat
,
Lisa Hellerstein
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 64-74
Learning binary matroid ports
Lisa Hellerstein
,
Collette Coullard
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 328-335
Functions that are read-once on a subset of their inputs
Lisa Hellerstein
Discrete Applied Mathematics
46
(3), 1993, pp. 235-251
Read-thrice DNF is hard to learn with membership and equivalence queries
Howard Aizenstein
,
Lisa Hellerstein
,
Leonard Pitt
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 523-532
Learning arithmetic read-once formulas
Nader H. Bshouty
,
Thomas R. Hancock
,
Lisa Hellerstein
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 370-381
On the time-space complexity of reachibility queries for preprocessed graphs
Lisa Hellerstein
,
Philip Klein
,
Robert Wilber
Information Processing Letters
35
, 1990, pp. 261-267
Learning read-once formulas with queries
Dana Angluin
,
Lisa Hellerstein
,
Marek Karpinski
Technical Report (TR-89-050), 1989, August
On the time-space complexity of reachability queries for preprocessed graphs
Lisa Hellerstein
,
Philip Klein
,
Robert Wilber
Technical Report (TR-02-89), 1989
Notes on the complexity of systolic programs
Stephen Taylor
,
Lisa Hellerstein
,
Shmuel Safra
,
Ehud Shapiro
Journal Parallel Distributed Computing
4
, 1987, pp. 250-265
Notes on the complexity of systolic programs
Stephen Taylor
,
Lisa Hellerstein
,
Shmuel Safra
,
Ehud Shapiro
Technical Report (CS 86-16), 1985, November