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="Friedman, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing Betti numbers via combinatorial Laplacians
J. Friedman
Algorithmica
21
(4), 1998, pp. 331-346
Efficiently planning compliant motion in the plane
J. Friedman
,
J. Hershberger
,
J. Snoeyink
SIAM Journal on Computing
25
(3), 1996, pp. 562-599
A deterministic view of random sampling and its use in geometry
B. Chazelle
,
J. Friedman
Combinatorica
10
, 1990, pp. 229-249
A deterministic view of random sampling and its use in geometry
B. Chazelle
,
J. Friedman
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 539-549
A lower bound on strictly non-blocking networks
J. Friedman
Combinatorica
8
, 1988, pp. 185-188
Expanding graphs contain all small trees
J. Friedman
,
N. Pippenger
Combinatorica
7
(1), 1987, pp. 71-76
Non-blocking networks
P. Feldman
,
J. Friedman
,
N. Pippenger
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 247-254
Non-blocking networks
P. Feldman
,
J. Friedman
,
N. Pippenger
Technical Report (RJ 5117 (53161)), 1986, April
Expanding graphs contain all small trees
J. Friedman
,
N. Pippenger
Technical Report (RJ 5145 (53485)), 1986, May
On Newton's method for polynomials
J. Friedman
Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS'86 (Toronto, Canada, October 27-29, 1986)
, 1986, pp. 153-161
Constructing
O(n\log n)
size monotone formulae for the
k
th threshold function of n Boolean variables
J. Friedman
SIAM Journal on Computing
15
(3), 1986, August, pp. 641-654
Constructing
O(n\log n)
size monotone formulae for the
k
-th elementary symmetric polynomial of
n
Boolean variables
J. Friedman
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 506-515