Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching

Authors:
Robert Sedgewick
Affiliations:
-
Venue:
Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching
Year:
1997

Citing 0
Cited 12

A note on future research in segmentation techniques applied to neurology, cardiology, mammography and pathology

Advanced algorithmic approaches to medical image segmentation
Snort - Lightweight Intrusion Detection for Networks

LISA '99 Proceedings of the 13th USENIX conference on System administration
Exact distribution of individual displacements in linear probing hashing

ACM Transactions on Algorithms (TALG)
High-level synthesis using computation-unit integrated memories

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
New algorithms research for first year students

Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Visual measurement of pile movements for the foundation work using a high-speed line-scan camera

Pattern Recognition
Proposal of search method compressed the one-way branch based on the double-array structure

ACOS'07 Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6
Distributed, large-scale latent semantic analysis by index interpolation

Proceedings of the 3rd international conference on Scalable information systems
B-tries for disk-based string management

The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network

IEEE Transactions on Information Theory
Engineering scalable, cache and space efficient tries for strings

The VLDB Journal — The International Journal on Very Large Data Bases
Redesigning the string hash table, burst trie, and BST to exploit cache

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.06

Visualization

Abstract

From the Publisher:Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.