Item Details

Two Upper Bounds for the Weighted Path Length of Binary Trees

Pradels, Jean Louis
Format
Thesis/Dissertation; Book; Online; EBook
Published
Urbana, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1973.
Language
English
Series
UIUCDCS-R-73-565
Description
iv l., 11 p. 28 cm.
Mode of access: Internet.
Dissertation Note
Thesis (M.S.)--University of Illinois at Urbana-Champaign.
Notes
Includes bibliographical references.
Logo for Creative Commons Attribution, Share-alike, Non-commercial LicenseCreative Commons Attribution, Share-alike, Non-commercial License
Technical Details

  • LEADER 01586nam a2200373 4500
    001 100701567
    003 MiAaHDL
    005 20150526000000.0
    006 m d
    007 cr bn ---auaua
    008 731205s1973 ilu b 00000 engm
    035
      
      
    a| sdr-uiuc532203
    035
      
      
    9| ACE-9622
    035
      
      
    a| (OCoLC)764345
    040
      
      
    a| DLC c| DLC d| m.c. d| UIU d| m.c.3
    050
    0
      
    a| QA76 b| .I4 no. 565 a| QA166
    082
      
      
    a| 001.6/4/08 s a| 511/.5
    100
    1
    0
    a| Pradels, Jean Louis, d| 1946-
    245
    1
    0
    a| Two upper bounds for the weighted path length of binary trees.
    260
    0
      
    a| Urbana, b| Dept. of Computer Science, University of Illinois at Urbana-Champaign, c| 1973.
    300
      
      
    a| iv l., 11 p. c| 28 cm.
    490
    0
      
    a| UIUCDCS-R-73-565
    502
      
      
    a| Thesis (M.S.)--University of Illinois at Urbana-Champaign.
    504
      
      
    a| Includes bibliographical references.
    538
      
      
    a| Mode of access: Internet.
    650
      
    0
    a| Graph theory x| Data processing
    974
      
      
    8| ia.twoupperboundsfo565prad b| UIU c| IUIUC d| 20180315 s| ia u| uiuo.ark:/13960/t87h3056m z| Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 565 y| 1973 r| cc-by-nc-sa-3.0 q| con

Access online

Google Preview