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
[1]
Hilfe
Suche: Author="Valiant, L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the learnability of boolean formulae
M. Kearns
,
M. Li
,
L. Pitt
,
L. Valiant
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 285-295
Logarithmic time sort for linear size networks
J.H. Reif
,
L.G. Valiant
Journal of the ACM
34
(1), 1987, pp. 60-76
Recent developments in the theory of learning
L.G. Valiant
Lecture Notes in Computer Science
267
, 1987, pp. 563
NP
is as easy as detecting unique solutions
L.G. Valiant
,
V.V. Vazirani
Theoretical Computer Science
47
(1), 1986, pp. 85-93
Negation is powerless for boolean slice functions
L.G. Valiant
SIAM Journal on Computing
15
(2), 1986, May, pp. 531-535
A complexity theory based on Boolean algebra
S. Skyum
,
L.G. Valiant
Journal of the ACM
32
(2), 1985, pp. 484-502
NP
is as easy as detecting unique solutions
L.G. Valiant
,
V.V. Vazirani
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 458-463
Short monotone formulae for the majority function
L.G. Valiant
Journal of Algorithms
5
(3), 1984, pp. 363-366
A theory of the learnable
L.G. Valiant
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC'84 (Washington, DC, April 30 - May 2, 1984)
, 1984, pp. 436-445
Size bounds for superconcentrators
G. Lev
,
L.G. Valiant
Theoretical Computer Science
22
(3), 1983, pp. 233-251
A logarithmic time sort for linear size networks
J.H. Reif
,
L.G. Valiant
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 10-16
Fast parallel computation of polynomials using few processors
L.G. Valiant
,
S. Skyum
,
S. Berkowitz
,
C. Rackoff
SIAM Journal on Computing
12
(4), 1983, November, pp. 641-644
Exponential lower bounds for restricted monotone circuits
L.G. Valiant
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 110-117
A complexity theory based on Boolean algebra
S. Skyum
,
L.G. Valiant
Technical Report (CSR-97-82), 1982, January
A scheme for fast parallel communication
L.G. Valiant
SIAM Journal on Computing
11
(2), 1982, May, pp. 350-361
Parallel Computation
L.G. Valiant
Proceedings of the 7th IBM Symposium on Mathematical Foundations of Computer Science, Hakone, Kanagawa, Japan
, 1982, May
Size bounds for supercomputers
G. Lev
,
L.G. Valiant
Technical Report (CSR 95-81), 1981, December
A complexity theory based on Boolean algebra
S. Skyum
,
L.G. Valiant
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 244-253
Universal schemes for parallel communication
L.G. Valiant
,
G.J. Brebner
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC'81 (Milwaukee, WI, May 11-13, 1981)
, 1981, pp. 263-277
Fast parallel computation of polynomials using few processors
L.G. Valiant
,
S. Skyum
,
S. Berkowitz
,
C. Rackoff
Springer Lecture Notes in Computer Scienece
118
, 1981, pp. 132-139
Fast parallel computation of polynomials using few processors
L.G. Valiant
,
S. Skyum
Proceedings of the 10th International Symposium on Mathematical Foundations of Computer Science, MFCS'81 (Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981)
, 1981, pp. 132-139
Fast parallel computation of polynomials using few processors
L.G. Valiant
,
S. Skyum
Lecture Notes in Computer Science
118
, 1981, pp. 132-139
Experiments with a parallel communication scheme
L.G. Valiant
Proceedings of the 18th Allerton Conf. on Communication, Control, and Computing, University of Illinois
, 1980, pp. 802-811
Negation can be exponentially powerful
L.G. Valiant
Theoretical Computer Science
12
, 1980, pp. 303-314
Computing multivariate polynomials in parallel
L.G. Valiant
Information Processing Letters
11
(1), 1980, August, pp. 44-45
Seiten 1
2
>