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
[3]
Hilfe
Suche: Author="Valiant, Leslie"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of symmetric Boolean parity Holant problems
Heng Guo
,
Pinyan Lu
,
Leslie G. Valiant
Lecture Notes in Computer Science
6755
, 2011, pp. 712-723
A bridging model for multi-core computing
Leslie G. Valiant
Journal of Computer and System Sciences
77
(1), 2011, pp. 154-166
Some observations on holographic algorithms
Leslie G. Valiant
Lecture Notes in Computer Science
6034
, 2010, pp. 577-590
Evolvability
Leslie G. Valiant
Journal of the ACM
56
(1), 2009, pp. 3: 1-21
Knowledge Infusion: In pursuit of robustness in Artificial Intelligence
Leslie G. Valiant
Leibniz International Proceedings in Informatics (LIPIcs)
2
, 2008
A bridging model for multi-core computing
Leslie G. Valiant
Lecture Notes in Computer Science
5193
, 2008, pp. 13-28
Holographic algorithms
Leslie G. Valiant
SIAM Journal on Computing
37
(5), 2008, pp. 1565-1594
Evolvability
Leslie G. Valiant
Lecture Notes in Computer Science
4708
, 2007, pp. 22-43
Holographic circuits
Leslie G. Valiant
Lecture Notes in Computer Science
3580
, 2005, pp. 1-15
Completeness for parity problems
Leslie G. Valiant
Lecture Notes in Computer Science
3595
, 2005, pp. 1-8
Three problems in computer science
Leslie G. Valiant
Journal of the ACM
50
(1), 2003, pp. 96-99
Erratum to ''Expressiveness of matchgates''
Leslie G. Valiant
Theoretical Computer Science
299
(1), 2003, pp. 795
Quantum circuits that can be simulated classically in polynomial time
Leslie G. Valiant
SIAM Journal on Computing
31
(4), 2002, pp. 1229-1254
Expressiveness of matchgates
Leslie G. Valiant
Theoretical Computer Science
289
(1), 2002, pp. 457-471
Quantum computers that can be simulated classically in polynomial time
Leslie G. Valiant
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 114-123
A neuroidal architecture for cognitive computation
Leslie G. Valiant
Journal of the ACM
47
(5), 2000, pp. 854-882
Robust logics
Leslie G. Valiant
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 642-651
A neuroidal architecture for cognitive computation
Leslie G. Valiant
Lecture Notes in Computer Science
1443
, 1998, pp. 642-669
Bulk synchronous parallel computing - A paradigm for transportable software
Thomas Cheatham
,
Amr Fahmy
,
Dan C. Stefanescu
,
Leslie G. Valiant
Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, HICSS-28. Vol.~II: Software Technology (Kihei, Hawaii, January 3-6, 1995)
, 1995, pp. 268-275
Cognitive computation
Leslie G. Valiant
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 2-3
Direct bulk-synchronous parallel algorithms
Alexandros V. Gerbessiotis
,
Leslie G. Valiant
Journal Parallel Distributed Computing
22
(2), 1994, pp. 251-267
Learning boolean formulas
Michael Kearns
,
Ming Li
,
Leslie Valiant
Journal of the ACM
41
(6), 1994, November, pp. 1298-1328
Cryptographic limitations on learning boolean formulae and finite automata
Michael Kearns
,
Leslie Valiant
Journal of the ACM
41
(1), 1994, January, pp. 67-95
A fast parallel algorithm for routing in permutation networks
Gavriela Freund Lev
,
Nicholas Pippenger
,
Leslie G. Valiant
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice, 1994, pp. 88-95
A combining mechanism for parallel computers
Leslie G. Valiant
Lecture Notes in Computer Science
678
, 1993, pp. 1-10
Seiten 1
2
>