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="Lynch, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The quantifier structure of sentences that characterize nondeterministic time complexity
J.F. Lynch
Proceedings of the 5th Annual Conference on Structure in Complexity Theory, CSCT'90 (Universitat Politcnica de Catalunya, Barcelona, Spain, July 8-11, 1990)
, 1990, pp. 210-222
Probabilities of sentences about very sparse random graphs
J.F. Lynch
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 689-696
A depth-size tradeoff for Boolean circuits with unbounded fan-in
J. Lynch
Lecture Notes in Computer Science
223
, 1986, pp. 234-248
Vectorized Monte Carlo photon transport
F.W. Bobrowicz
,
J.E. Lynch
,
K.J. Fischer
,
J.E. Tabor
Parallel Computing
1
(3-4), 1984, pp. 295-305