NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 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.

Search results

Showing 1 to 2 of 2 (0.092 seconds)

Spelling suggestions: "subject:"eomputer algorithms. foding theory."" "subject:"eomputer algorithms. eoding theory.""

1

Combinatorial property of prefix-free trees with some regular constraints /

Yeung, Siu Yin. January 2004 (has links)
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 67-68). Also available in electronic version. Access restricted to campus users.
Computer algorithms. Coding theory.
2

Code strings: a new program plan recognition model /

Garvin, Michael James, January 1900 (has links)
Thesis (M.App.Sc.) - Carleton University, 2002. / Includes bibliographical references (p. 69-70). Also available in electronic format on the Internet.

Page generated in 0.0947 seconds