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="Shamos, M.I."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Divide and conquer for linear expected time
J.L. Bentley
,
M.I. Shamos
Information Processing Letters
7
(2), 1978, February, pp. 87-91
Divide-and-conquer in multidimensional space
J.L. Bentley
,
M.I. Shamos
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, STOC'76 (Hershey, PA, May 3-5, 1976)
, 1976, pp. 220-230
Geometric intersection problems
M.I. Shamos
,
D. Hoey
Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, FOCS'76 (Houston, TX, October 25-27, 1976)
, 1976, pp. 208-215
Lower bounds from complex function theory
M.I. Shamos
,
G. Yuval
Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, FOCS'76 (Houston, TX, October 25-27, 1976)
, 1976, pp. 268-273
Geometric complexity
M.I. Shamos
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, STOC'75 (Albuquerque, NM, May 5-7, 1975)
, 1975, pp. 224-233