Data Structure

Related Fields

Parent Topic:

Computer Science, Programming language

Child Topic:

Stack, Page cache, Insertion sort, Symbol table, Random access, Sorting algorithm, Function pointer, Multiple inheritance, Software bloat, Language primitive, Revision control, Source code, XML validation, God object, Environment variable, Lookup table, Iliffe vector, Polymorphism, Quadratic probing, String searching algorithm, Radix sort, Factory, Object modeling language, Byte addressing, Extendible hashing, Spaghetti code, Association list, Threaded binary tree, Union type, Common Object Request Broker Architecture, Boyer–Moore string search algorithm, Zipper, Recursion, Fibonacci heap, Nibble, Finalization, Curiously recurring template pattern, Multimap, Three address code, Software archaeology, Proxy pattern, Universal hashing, Encapsulation, Self-modifying code, Software distribution, Boolean data type, Addressing mode, Range searching, k-d tree, Hash table, Linked data structure, Computer file, Tombstone, Declaration, Quadtree, Radix tree, Variable, Linear probing, Concurrent data structure, Memory address register, Basic block, Sequential access, string, Approximate string matching, Stride of an array, Object type, Binomial heap, Decorator pattern, Forward declaration, Wait state, Undefined behavior, General Inter-ORB Protocol, Modular programming, Collection, In-place algorithm, Flyweight pattern, Dynamic array, Class implementation file, Comparison sort, Java collections framework, Peephole optimization, Memory safety, Interpolation search, External Data Representation, Interpreter, Stream, Octree, Generics in Java, Offset, Memory management, Randomization function, Ternary tree, Variable-length array, Database index, Data hierarchy, Identifier, Memory leak, Exponential tree, Bit field, C data types, Class, Object composition, Creational pattern, Class variable, Call stack, Memory pool, Trie, Mask, Wirth's law, Process control block, Linear hashing, Weak reference, Modula-2, Space partitioning, Skew heap, Interface, Iterator pattern, Potential method, Segment tree, Data type, Uninitialized variable, Smoothsort, Disjoint-set, Data, Debugging, Demand paging, Type system, Protocol stack, FM-index, Skip list, Range tree, Feature creep, Binary heap, Pointer swizzling, Prefix sum, Buffer underrun, Pointer, Global variable, Index locking, Type safety, Protocol, Pairing heap, Cocktail sort, Treap, Static variable, Set, scanf format string, Tree of primitive Pythagorean triples, Architecture domain, Move-to-front transform, Thread-local storage, Control table, Plain Old CLR Object, Zero page, Algorithmic program debugging, Dynamization, Label, String literal, Generic programming, Wavelet Tree, Locality of reference, Cycle detection, exit, Exponential search, Serialization, Heapsort, Dependency inversion principle, Oberon-2, HIPO model, Object-oriented operating system, Double-ended priority queue, Abstract factory pattern, Advanced Configuration and Power Interface, Quad-edge, Judy array, Substring, Accounting method, Page fault, Memory model, Software framework, Command pattern, Sparse array, Copy-on-write, Component-based software engineering, Computer programming, Merge sort, Value type, Introsort, Octet, Memory-mapped file, Facade pattern, T-tree, Peek, Scapegoat tree, Interface segregation principle, Finalizer, Object, Access method, Bitmap index, Finger tree, Abstraction layer, Fusion tree, Z-order curve, Lazy deletion, Circular buffer, R-tree, Composite data type, Abstract type, Linked list, Tagged pointer, mmap, 2–3 tree, Directed acyclic word graph, Memento pattern, Just-in-time compilation, Perfect hash function, Van Emde Boas tree, Single responsibility principle, Self-balancing binary search tree, Row-major order, Unspecified behavior, Late binding, Policy-based design, Interface description language, Double-ended queue, CICS, Counting sort, Subroutine, Shellsort, Dynamic perfect hashing, Open/closed principle, Marshalling, Rabin–Karp algorithm, Priority queue, Word, Software lockout, B-tree, K-ary tree, Software rot, this, Double hashing, Delegate, Array data structure, d-ary heap, Asymptotically optimal algorithm, Programming language implementation, Bit, Weight-balanced tree, Hilbert R-tree, Data buffer, Leftist tree, Compressed suffix array, Range query, Arithmetic overflow, Bit array, Optimizing compiler, Method, Bogosort, Object-oriented programming, Garbage collection, Return type, Amortized analysis, Executable, Binary tree, Hash tree, Open addressing, M-tree, Documentation, Divide and conquer algorithms, Bubble sort, JEDEC memory standards, C string handling, Ternary search tree, Difference list, XML schema, Object code, Associative array, Decision table, Tree rotation, Attribute–value pair, Ephemeron, Operand, Data structure alignment, Tree traversal, Vantage-point tree, ABA problem, exec, Marker interface pattern, Fork, Doubly linked list, Session layer, Key Sequenced Data Set, Bucket sort, Collision, Abstract data type, long double, First-class citizen, File system fragmentation, Optimal binary search tree, Strategy pattern, Bridge pattern, 3SUM, Robustness, Sentinel value, Symbolic link, inode, Selection sort, Bounds checking, Operator overloading, Bin, Queue, Tree structure, Language interoperability, Tree sort, Skeleton, Null Object pattern, Parallel Extensions, Handle, Locality-sensitive hashing, Matrix representation, Partition refinement, Log-structured merge-tree, Exception handling, Structural pattern, Primitive wrapper class, List, Conway's law, Object model, Logic error, Behavioral pattern, Overhead, Enumerated type, Merge algorithm, Static memory allocation, HyperTalk, troff, Threaded code, Hybrid algorithm, Compile time, Persistent data structure, Logical block addressing, Buffer overflow, Constant folding, Compiler, Partial evaluation, Modula-3, Fletcher's checksum, AP Computer Science, Type conversion, Interval tree, Binary search tree, Bitboard, Tree, Branch table, Virtual function, Strong and weak typing, Jump search, Pseudocode, Parallel array, Segmentation fault, typedef, Self-documenting, Instance variable, AVL tree, Computer network programming, Algorithmic efficiency, Java concurrency, Database storage structures, SUHA, Business object, Consistent hashing, Succinct data structure, External sorting, Curl, Precomputation, Coalesced hashing, Working directory, Include directive, Separation of concerns, Hash function, Memory segmentation, Sentinel node, Metric tree, Chain-of-responsibility pattern, AA tree, Schematron, Lowest common ancestor, Northbound interface, JavaBeans, Smart pointer, Foreach loop, Variant type, Application virtualization, Field, Index mapping, Hand coding, Standard Template Library, Placement syntax, MinHash, Test data generation, Indirection, Compare-and-swap, Interface, System image, Software design pattern, Remote procedure call, Composite pattern, Obfuscation, Bit manipulation, Random binary tree, Service-oriented programming, Master theorem, Java syntax, Bitwise operation, Address space, Sorted array, Implicit data structure, Self-organizing list, Java hashCode, Software portability, Retroactive data structures, Managed code, Heap, Bloom filter, Rope, Common subexpression elimination, Concept, Logical shift, Byte, Free list, Memory map, Initialization, Integer sorting, User identifier, Tabulation hashing, C file input/output, C dynamic memory allocation, Complex data type, RELAX NG, Dangling pointer, Primitive data type, Pascal, Cartesian tree, Process Environment Block, Access modifiers, Run-time type information, Red–black tree, Program optimization, Hooking, Splay tree, Has-a, Member variable, Abstract syntax tree, Recursive descent parser, Boilerplate code, Adaptive sort, Array data type, Trait, Graph, Linear search, Search tree, Self, Container, Factory method pattern, Reference counting, Odd–even sort, Grid file, Explicit Data Graph Execution, Ada, Information hiding, Persistence, Visitor pattern, Record, Cover tree, Calling convention, Integer, Binary search algorithm, Memory address, Space–time tradeoff, Cuckoo hashing

Top Authors

Paper Recommendation
1988 Numerical Recipes in C: The Art of Scientific Computing

2001 Introduction To Algorithms

1991 Vector Quantization and Signal Compression

1987 Concurrency Control and Recovery in Database Systems

1978 A Method For Obtaining Digital Signatures and Public-key Cryptosystems

1999 Genetic Algorithms + Data Structures=evolution Programs

1989 Automatic Text Processing: The Transformation, Analysis, and Retrieval of information By Computer

1986 Bootstrap Methods For Standard Errors, Confidence intervals, and Other Measures of Statistical Accuracy

1983 Data Structures and Algorithms

1973 Introduction To Linear and Nonlinear Programming

1978 Digital Signal Processing

2003 Identity-Based Encryption From The Weil Pairing

1987 The Connection Machine

1984 How To Generate Cryptographically Strong Sequences of Pseudo-random Bits

1982 Cryptography and Data Security

1988 Numerical Recipes in C: The Art of Scientific Computing

1983 Data Structures and Network Algorithms

1970 A Relational Model For Large Shared Data Banks

1989 The Knowledge Complexity of interactive Proof Systems

1996 Genetic Algorithms + Data Structures = Evolution Programs