Search results

Records found: 11  
Your query: Author Sysno/Doc.kind = "^hk_us_auth m0539462 amg^"
  1. The art of computer programming. Volume 4. Fascicle 0, Introduction to combinatorial algorithms and boolean functions / Donald E. Knuth . Upper Saddle River : Addison-Wesley, 2005 . xi, 216 s . ISBN 978-0-321-53496-5 (dotisk : brož.). ISBN 0-321-53496-4 (brož.) .   [1, currently available 1]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0100
    The art of computer programming

    book

  2. The art of computer programming. Volume 1, Fundamental algorithms / Donald E. Knuth . Reading : Addison-Wesley, 1997 . xix, 652 s . ISBN 978-0-321-75104-1 (dotisk : soubor). ISBN 0-321-75104-3 (soubor). ISBN 978-0-201-89683-1 (dotisk : 1. díl : váz.). ISBN 0-201-89683-4 (1. díl : váz.) .   [2, currently available 2]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0200
    The art of computer programming

    book

  3. The art of computer programming. Volume 1, Fundamental algorithms / Donald E. Knuth . Reading : Addison-Wesley, 1997 . xix, 650 s . ISBN 0-201-89683-4 (váz.) .   [1, currently available 1]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0100
    The art of computer programming

    book

  4. The art of computer programming. Volume 2, Seminumerical algorithms / Donald E. Knuth . Reading : Addison-Wesley, c1998 . xiii, 764 s . ISBN 978-0-321-75104-1 (dotisk : soubor). ISBN 0-321-75104-3 (soubor). ISBN 978-0-201-89684-8 (dotisk : 2. díl : váz.). ISBN 0-201-89684-2 (2. díl : váz.) .   [2, currently available 2]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0200
    The art of computer programming

    book

  5. The art of computer programming. Volume 3, Sorting and searching / Donald E. Knuth . Reading : Addison-Wesley, c1998 . xiii, 782 s . ISBN 978-0-321-75104-1 (dotisk : soubor). ISBN 0-321-75104-3 (soubor). ISBN 978-0-201-89685-5 (dotisk : 3. díl : váz.). ISBN 0-201-89685-0 (3. díl : váz.) .   [1, currently available 1]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0100
    The art of computer programming

    book

  6. The art of computer programming. Volume 4. Fascicle 4, Generating all trees. History of combinatorial generation / Donald E. Knuth . Upper Saddle River : Addison-Wesley, c2006 . vi, 120 s . ISBN 0-321-33570-8 (brož.) .   [1, currently available 1]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0100
    The art of computer programming

    book

  7. The art of computer programming. Volume 4A, Combinatorial algorithms. Part 1 / Donald E. Knuth . Reading : Addison-Wesley, c2011 . xv, 883 s . ISBN 978-0-321-75104-1 (dotisk : soubor). ISBN 0-321-75104-3 (soubor). ISBN 978-0-201-03804-0 (dotisk : 4A díl : váz.) .   [1, currently available 1]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0100
    The art of computer programming

    book

  8. Concrete mathematics : a foundation for computer science / Ronald L. Graham, Donald E. Knuth, Oren Patashnik . Upper Saddle River : Addison-Wesley, 1994 . xiii, 657 s . ISBN 978-0-201-55802-9 (dotisk : váz.). ISBN 0-201-55802-5 (váz.) .   [3, currently available 3]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0300
    Concrete mathematics

    book

  9. The METAFONTbook . Reading : Addison-Wesley, 1992 . 359s . ISBN 0-201-13444-6 : .   [1, currently available 1]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0100
    The METAFONTbook

    book

  10. Stable marriage and its relation to other combinatorial problems : an introduction to the mathematical analysis of algorithms / Donald E. Knuth . Providence : American Mathematical Society, 1996 . 74 s . ISBN 0-8218-0603-3 : .   [1, currently available 1]
    Branch Inaccesible Available Issued Reserved
    Univerzitní knihovna UHK0100
    Stable marriage and its relation to other combinatorial problems

    book


  This site uses cookies to make them easier to browse. Learn more about how we use cookies.