검색어: online courses on data structures and algorithms (스페인어 - 영어)

hopcroft, jeffrey d. ullman, "data structures and algorithms", addison-wesley series in computer science and information processing.
hopcroft, jeffrey d. ullman, "data structures and algorithms", addison-wesley series in computer science and information processing.

isbn 0-201-00022-9*a. v. aho, j. e. hopcroft, j. d. ullman, "data structures and algorithms.
isbn 0-201-00022-9*a. v. aho, j. e. hopcroft, j. d. ullman, "data structures and algorithms.

ha servido en los consejos editoriales de más de una docena de revistas científicas internacionales; desde 2008 es editor-en-jefe de "random structures and algorithms".
he serves on the editorial boards of more than a dozen international journals, since 2008 he is the editor-in-chief of "random structures and algorithms".

*"computational aspects of vlsi", computer science press, 1984*"data structures and algorithms" (con a. v. aho y j. e. hopcroft), addison-wesley, reading ma, 1983.
*"computational aspects of vlsi", computer science press, 1984*"data structures and algorithms" (with a. v. aho and j. e. hopcroft), addison-wesley, reading ma, 1983.

este tipo de persistencia es muy difícil de manejar sin recolector de basura, para que libere la memoria de los nodos que ya no pueden ser accedidos, es por esto que esta característica es muy común en la programación funcional== referencias ==== futura lectura ==* persistent data structures and managed references - video presentation by rich hickey on clojure's use of persistent data structures and how they support concurrency* making data structures persistent by james r. driscoll, neil sarnak, daniel d. sleator, robert e. tarjan* fully persistent arrays for efficient incremental updates and voluminous reads* real-time deques, multihead turing machines, and purely functional programming* "purely functional data structures" by chris okasaki, cambridge university press, 1998, isbn 0-521-66350-4.
==see also==* persistent data* navigational database* copy-on-write* retroactive data structures==references====further reading==* persistent data structures and managed references - video presentation by rich hickey on clojure's use of persistent data structures and how they support concurrency* making data structures persistent by james r. driscoll, neil sarnak, daniel d. sleator, robert e. tarjan* fully persistent arrays for efficient incremental updates and voluminous reads* real-time deques, multihead turing machines, and purely functional programming*"purely functional data structures" by chris okasaki, cambridge university press, 1998, isbn 0-521-66350-4.