• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 266
  • 52
  • 27
  • 25
  • 18
  • 10
  • 6
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 3
  • Tagged with
  • 468
  • 468
  • 350
  • 332
  • 179
  • 98
  • 63
  • 61
  • 56
  • 51
  • 50
  • 49
  • 48
  • 48
  • 46
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

Timber Ho! an examination of the properties of special balanced search trees /

Barkan, David. January 1900 (has links)
Thesis (B.A.)--Haverford College, Dept. of Computer Science, 2002. / Includes bibliographical references.
42

A paging scheme for pointer-based quadtrees /

Brown, Patrick R., January 1992 (has links)
Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1992. / Vita. Abstract. Includes bibliographical references (leaves 72-74). Also available via the Internet.
43

Expected-case planar point location /

Malamatos, Theocharis. January 2002 (has links)
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2002. / Includes bibliographical references (leaves 80-83). Also available in electronic version. Access restricted to campus users.
44

Fast labeled tree comparison via better matching algorithms /

Sung, Wing-kin. January 1998 (has links)
Thesis (Ph. D.)--University of Hong Kong, 1999. / Includes bibliographical references (leaves 90-93).
45

Trading off time for space for the string matching problem /

Lai, Shiao-bun. January 1996 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1997. / Includes bibliographical references (leaf 64-66).
46

Optimal expected-case planar point location /

Wong, Ka Chun. January 2005 (has links)
Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2005. / Includes bibliographical references (leaves 19-20). Also available in electronic version.
47

Self-adjusting computation /

Acar, Umut A. January 1900 (has links)
Thesis (Ph. D.)--Carnegie Mellon University, 2005. / "May 2005." Includes bibliographical references.
48

CubiST++ a new approach to improving the performance of ad-hoc cube queries /

Fu, Lixin. January 2001 (has links) (PDF)
Thesis (Ph. D.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains x, 100 p.; also contains graphics. Vita. Includes bibliographical references (p. 95-99).
49

Enhanced classification through exploitation of hierarchical structures

Punera, Kunal Vinod Kumar, January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.
50

Lock-free linked lists and skip lists /

Fomitchev, Mikhail. January 2003 (has links)
Thesis (M.Sc.)--York University, 2003. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 224-226). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL:http://gateway.proquest.com/openurl?url%5Fver=Z39.88-2004&res%5Fdat=xri:pqdiss&rft%5Fval%5Ffmt=info:ofi/fmt:kev:mtx:dissertation&rft%5Fdat=xri:pqdiss:MQ99307

Page generated in 0.086 seconds