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="McCreight, E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Organization and maintenance of large ordered indexes
Rudolf Bayer
,
E. McCreight
Software Pioneers - Contributions to Software Engineering, 2002, pp. 245-262
Priority search trees
E.M. McCreight
SIAM Journal on Computing
14
(2), 1985, May, pp. 257-276
A new representation for linear lists
L.J. Guibas
,
E.M. McCreight
,
M.F. Plass
,
J.R. Roberts
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, STOC'77 (Boulder, CO, May 2-4, 1977)
, 1977, pp. 49-60
Organization of large ordered indexes
R. Bayer
,
E. McCreight
Acta Informatica
1
, 1972, pp. 173-189
Computationally complex and pseudo-random zero-one valued functions
A.R. Meyer
,
E.M. McCreight
Theory of Machines and Computations, 1971, pp. 9-42
Classes of computable functions defined by bounds on computation
E.M. McCreight
,
A.R. Meyer
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, STOC'69 (Marina del Rey, CA, May 5-7, 1969)
, 1969, pp. 79-88
Classes of computable functions defined by bounds on computation: preliminary report
E.M. McCreight
,
A.R. Meyer
misc, pp. 79-88