Algorithms

  • Algorithms
    Algorithms
    By Kevin Wayne, Robert Sedgewick

    In the 1990s, U. Manber and E. Myers presented a linearithmic algorithm for building suffix arrays directly and a method that does preprocessing at the same time as the suffix sort to support constant-time lcp().

  • Algorithms: Main Ideas and Applications
    Algorithms: Main Ideas and Applications
    By Vladimir Uspensky, A.L. Semenov

    Maslov S.Ju. (MacIOB C.K.).) [Mas 64] MacIOB C.K.). HeKoTopLie cBoiicTBa ammapaTa KahoHHHecKHx McHMcHeHMā 9.JI. IIocTa // IIpo6HeMEI KoHCTpyKTMBHoro HampaBIeHMA. B. MaTeMaTHKe. 3. — M.–JI.: Hayka. - (TpyHH MaTeMaTWTecKoro HHCTWTyTa MM.

  • Algorithms
    Algorithms
    By Robert Sedgewick

    Algorithms

  • Algorithms
    Algorithms
    By Kevin Wayne, Robert Sedgewick

    This book is Part I of the fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms , the leading textbook on algorithms today, widely used in colleges and universities worldwide. Part I contains Chapters 1 through 3 of the book.

  • Algorithms
    Algorithms

    This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest.

  • Algorithms
    Algorithms
    By Kevin Wayne, Robert Sedgewick

    This book is Part II of the fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms , the leading textbook on algorithms today, widely used in colleges and universities worldwide. Part II contains Chapters 4 through 6 of the book.

  • Algorithms
    By Jeff Erickson

    Jeff Erickson is a computer science professor at the University of Illinois, Urbana-Champaign; this book is based on algorithms classes he has taught there since 1998.

  • Algorithms: A Functional Programming Approach
    Algorithms: A Functional Programming Approach
    By Guy Lapalme, Fethi Rabhi

    A student introduction to the design of algorithms for problem solving. Written from a functional programming perspective, the text should appeal to anyone studying algorithms.

  • Algorithms
    Algorithms
    By Kevin Wayne, Robert Sedgewick

    The algorithms in this book -- including 50 algorithms every programmer should know -- represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science ...

  • Algorithms: Design Techniques and Analysis
    Algorithms: Design Techniques and Analysis
    By M. H. Alsuwaiyel

    Algorithmic analysis in connection with example algorithms are explored in detail. Each technique or strategy is covered in its own chapter through numerous examples of problems and their algorithms.

  • Algorithms: Design and Analysis
    Algorithms: Design and Analysis
    By Mangey Ram, Sushil C. Dimri, Preeti Malik

    The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects.

  • Algorithms: A Top-Down Approach
    Algorithms: A Top-Down Approach
    By Rodney R Howell

    [1] G. M. Adel'son-Vel'ski ̆ı and E. M. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady ... Acta Informatica, 1:290–306, 1972. [9] R. Bayer and E. M. McCreight. Organization and maintenance of large ...

  • Algorithms
    Algorithms
    By Panos Louridas

    Arguing that every educated person today needs to have some understanding of algorithms and what they do, in this volume in the MIT Press Essential Knowledge series, Panos Louridas offers an introduction to algorithms that is accessible to ...

  • Algorithms: Design Techniques and Analysis
    Algorithms: Design Techniques and Analysis
    By M. H. Alsuwaiyel

    This book advocates the study of algorithm design techniques by presenting most of the useful algorithm design techniques and illustrating them through numerous examples.

  • Algorithms
    Algorithms
    By Robert Sedgewick

    Software -- Programming Techniques.

  • Algorithms: Design Techniques and Analysis(Revised Edition)
    Algorithms: Design Techniques and Analysis(Revised Edition)
    By M H Alsuwaiyel

    ... element, is extracted. Next, the median of these medians, denoted by mm, is computed recursively. Step 6 of the ... the 13th smallest element in A as follows. First, we divide the set of numbers into five groups of five elements ...

  • Algorithms
    Algorithms
    By Kevin Wayne, Robert Sedgewick

    ... edge, then we check for v among all the vertices that we can reach from s by following two edges, and so forth. DFS is analogous to one person exploring a maze. BFS is analogous to a group of searchers exploring by fanning out in all ...