Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Fundamentals of Data Structures in CMarch 1992
Publisher:
  • W. H. Freeman & Co.
  • Subs. of Scientific American, Inc. 41 Madison Avenue, 37th Fl. New York, NY
  • United States
ISBN:978-0-7167-8250-6
Published:01 March 1992
Pages:
585
Skip Bibliometrics Section
Reflects downloads up to 14 Oct 2024Bibliometrics
Skip Abstract Section
Abstract

From the Publisher:

Designed to function as a textbook or as a professional reference, Fundamentals Of Data Structures In C provides in-depth coverage of all aspects of data structure implementation in ANSI C. This book goes beyond the standard fare of Stacks, Queues, and Lists to offer such features as full chapter on Search Structures and a discussion of Advanced Tree Structures.

Cited By

  1. Chu H, Kao Y and Chen Y (2015). Adaptive thermal-aware task scheduling for multi-core systems, Journal of Systems and Software, 99:C, (155-174), Online publication date: 1-Jan-2015.
  2. Rigi M and Khoshalhan F (2011). Eliciting User Preferences in Multi-Agent Meeting Scheduling Problem, International Journal of Intelligent Information Technologies, 7:2, (45-62), Online publication date: 1-Apr-2011.
  3. ACM
    Jarosz W, Jensen H and Donner C Advanced global illumination using photon mapping ACM SIGGRAPH 2008 classes, (1-112)
  4. ACM
    Chen H, Ku W, Sun M and Zimmermann R The multi-rule partial sequenced route query Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, (1-10)
  5. Choi Y, Park S, Yu F and Kim S An Implicit Cluster-Based Overlay Multicast Protocol Exploiting Tree Division for Mobile Ad Hoc Networks Information Networking. Towards Ubiquitous Networking and Services, (191-201)
  6. Younghwan Choi , Euisin Lee , Donghun Lee , Soochang Park , Fucai Yu and Sang-Ha Kim An Implicit Cluster-Based Overlay Multicast Protocol for Mobile Ad Hoc Networks Proceedings of the 2007 IEEE Wireless Communications and Networking Conference, (3507-3512)
  7. Song J, Seo M and Onosato M Path finding method for various applications Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I, (469-479)
  8. Kwak D, Lee S, Kim J and Jung E An efficient key tree management algorithm for LKH group key management Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks, (703-712)
  9. ACM
    Ueng S Out-of-core encoding of large tetrahedral meshes Proceedings of the 2003 Eurographics/IEEE TVCG Workshop on Volume graphics, (95-102)
  10. ACM
    Kim S and Won H Batch-construction of B+-trees Proceedings of the 2001 ACM symposium on Applied computing, (231-235)
  11. ACM
    Gurwitz C (1995). Achieving a uniform interface for binary tree implementations, ACM SIGCSE Bulletin, 27:1, (66-70), Online publication date: 15-Mar-1995.
  12. ACM
    Gurwitz C Achieving a uniform interface for binary tree implementations Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (66-70)
Contributors
  • University of Southern California
  • University of Florida

Recommendations