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
Hilfe
Suche: Author="Angluin, Dana"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Effective storage capacity of labeled graphs
Dana Angluin
,
James Aspnes
,
Rida A. Bazzi
,
Jiang Chen
,
David Eisenstat
,
Goran Konjevod
Information and Computation
234
, 2014, pp. 44-56
Optimally learning social networks with activations and suppressions
Dana Angluin
,
James Aspnes
,
Lev Reyzin
Theoretical Computer Science
411
(29-30), 2010, pp. 2729-2740
Learning a circuit by injecting values
Dana Angluin
,
James Aspnes
,
Jiang Chen
,
Yinghua Wu
Journal of Computer and System Sciences
75
(1), 2009, pp. 60-77
Learning a hidden graph using
O(\log n)
queries per edge
Dana Angluin
,
Jiang Chen
Journal of Computer and System Sciences
74
(4), 2008, pp. 546-556
The
VC
dimension of
k
-fold union
David Eisenstat
,
Dana Angluin
Information Processing Letters
101
(5), 2007, pp. 181-184
Learning a circuit by injecting values
Dana Angluin
,
James Aspnes
,
Jiang Chen
,
Yinghua Wu
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 584-593
Fast construction of overlay networks
Dana Angluin
,
James Aspnes
,
Jiang Chen
,
Yinghua Wu
,
Yitong Yin
Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2005 (Las Vegas, Nevada, USA, July 18-20, 2005)
, 2005, pp. 145-154
Queries revisited
Dana Angluin
Theoretical Computer Science
313
(2), 2004, pp. 175-194
Robot localization in a grid
Chinda Wongngamnit
,
Dana Angluin
Information Processing Letters
77
(5-6), 2001, pp. 261-267
Robot navigation with distance queries
Dana Angluin
,
Jeffery Westbrook
,
Wenhong Zhu
SIAM Journal on Computing
30
(1), 2000, pp. 110-144
Robot navigation with range queries
Dana Angluin
,
Jeffery Westbrook
,
Wenhong Zhu
Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 469-478
When won't membership queries help?
Dana Angluin
,
Michael Kharitonov
Journal of Computer and System Sciences
50
(2), 1995, pp. 336-355
Computational learning theory: Survey and selected bibliography
Dana Angluin
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 351-369
Training sequences
Dana Angluin
,
William I. Gasarch
,
Carl H. Smith
Theoretical Computer Science
66
, 1989, pp. 255-272
Learning read-once formulas with queries
Dana Angluin
,
Lisa Hellerstein
,
Marek Karpinski
Technical Report (TR-89-050), 1989, August
Learning regular sets from queries and counterexamples
Dana Angluin
Information and Computation
75
(2), 1987, November, pp. 87-106
Regular prefix relations
Dana Angluin
,
Douglas N. Hoover
Math. Systems Theory
17
, 1984, pp. 167-191
Lecture notes on the complexity of some problems in number theory
Dana Angluin
Technical Report (243), 1982, August
Finite common coverings of pairs of regular graphs
Dana Angluin
,
A. Gardiner
Journal of Combinatorial Theory Series B
30
(2), 1981, April, pp. 184-187
A note on the number of queries needed to identify regular languages
Dana Angluin
Information and Control
51
, 1981, pp. 76-87
Inductive inference of formal languages from positive data
Dana Angluin
Information and Control
45
, 1980, pp. 117-135
On relativizing auxiliary pushdown machines
Dana Angluin
Math. Systems Theory
13
, 1979/80, pp. 283-299
On the complexity of minimum inference of regular sets
Dana Angluin
Information and Control
39
, 1978, pp. 337-350