Listing 1 - 10 of 10 |
Sort by
|
Choose an application
Data structures --- Algorithm Analysis --- Design Method --- Computational Complexity --- Data structures (Computer science) --- Algorithms
Choose an application
In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects can be performed). Especially for more complex searching problems as they arise in such fields as computational geometry, database design and computer graphics, only static data structures are available. This book aims at remedying this lack of flexibility by providing a number of general techniques for turning static data structures for searching problems into dynamic structures. Although the approach is basically theoretical, the techniques offered are often practically applicable. The book is written in such a way that it is readable for those who have some elementary knowledge of data structures and algorithms. Although this monograph was first published in 1983, it is still unique as a general treatment of methods for constructing dynamic data structures.
Programming --- 681.3*E1 --- Data structures: arrays; graphs; lists; tables; trees --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees --- Data structures (Computer science) --- Structures de données (Informatique) --- Structures de données (Informatique) --- Computer science. --- Information theory. --- Computer graphics. --- Data structures (Computer scienc. --- Computer Applications. --- Theory of Computation. --- Science, Humanities and Social Sciences, multidisciplinary. --- Computer Graphics. --- Data Structures. --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Communication theory --- Communication --- Cybernetics --- Informatics --- Science --- Digital techniques
Choose an application
There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in network optimization are covered in detail, including a development of the data structures they use and an analysis of their running time. Data Structures and Network Algorithms attempts to provide the reader with both a practical understanding of the algorithms, described to facilitate their easy implementation, and an appreciation of the depth and beauty of the field of graph algorithms.
Data structures (Computer science) --- Algorithms --- Trees (Graph theory) --- Structures de données (Informatique) --- Algorithmes --- Arbres (Théorie des graphes) --- Computer algorithms --- 681.3 *C2 --- 681.3*E1 --- Graph theory --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Computer communication networks: data communications; OSI; security and protection --- Data structures: arrays; graphs; lists; tables; trees --- Computer algorithms. --- Data structures (Computer science). --- Trees (Graph theory). --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees --- 681.3 *C2 Computer communication networks: data communications; OSI; security and protection --- Structures de données (Informatique) --- Arbres (Théorie des graphes)
Choose an application
Geometry --- Computational complexity. --- Coding theory. --- Data structures (Computer science) --- Géométrie --- Complexité de calcul (Informatique) --- Codage --- Structures de données (Informatique) --- Data processing. --- Informatique
Choose an application
Database management --- 681.3*E1 --- 681.3*H0 --- 681.3*K6 --- Data structures: arrays; graphs; lists; tables; trees --- Computerwetenschap--?*H0 --- Management of computing and information systems: economics --- Gegevensbanken --- Gegevensbanken. --- 681.3*K6 Management of computing and information systems: economics --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees
Choose an application
Input design, Computer --- Data structures (Computer science) --- Structures de données (Informatique) --- binaire representatie --- arrays --- lijsten --- boomstructuren --- opzoeken --- sorteren --- Computer input design --- Data entry design --- Data input design --- Design of computer inputs --- Entry design, Data --- Input design, Data --- Input design, Keyed --- Keyed input design --- Coding theory --- Computer input-output equipment --- Database management --- Electronic data processing --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Data entry --- Data preparation --- Input design, Computer. --- Data structures (Computer science). --- Structures de données (Informatique)
Choose an application
Data structures (Computer science) --- Computer algorithms --- Computer algorithms. --- Data structures (Computer science). --- 519.68 --- 681.3*D3 --- 681.3*D3 Programming languages --- Programming languages --- Algorithms --- 519.68 Computer programming --- Computer programming --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- #TELE:d.d. Prof. A. J. J. Oosterlinck --- 681.3*D2 --- 681.3*E1 --- 681.3*F11 --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees --- Data structures: arrays; graphs; lists; tables; trees --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 681.3*D2 Software engineering: protection mechanisms; standards--See also {681.3*K63}; {681.3*K51} --- Software engineering: protection mechanisms; standards--See also {681.3*K63}; {681.3*K51} --- Programming --- Computer science --- Information systems --- datastructuren --- algoritmen --- Programmeren --- Algoritmen --- Data processing --- Structures de données (Informatique) --- Algorithmes --- Structures de données (informatique) --- Structures de données (informatique)
Choose an application
Programming --- Discrete mathematics --- 681.3*D1 --- 681.3*D3 --- 681.3*E1 --- 681.3*F2 --- 681.3*G2 --- Programming techniques--See also {681.3*E} --- Programming languages --- Data structures: arrays; graphs; lists; tables; trees --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Discrete mathematics (Mathematics of computing) --- 681.3*G2 Discrete mathematics (Mathematics of computing) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees --- 681.3*D3 Programming languages --- 681.3*D1 Programming techniques--See also {681.3*E} --- Logic design. --- Logics and Meanings of Programs. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory
Choose an application
Information systems --- File management (Computer science) --- File systems (Computer science) --- Organization, File (Computer science) --- Logical design: data models; normal forms; schema and subschema (Database management) --- Languages: data description languages; DDL; data manupulation languages; DML;query languages; report writers (Database management) --- File organization (Computer science). --- 681.3*H21 Logical design: data models; normal forms; schema and subschema (Database management) --- 681.3*H23 Languages: data description languages; DDL; data manupulation languages; DML;query languages; report writers (Database management) --- Database design --- Data structures (Computer science) --- File organization (Computer science) --- 681.3*H21 --- 681.3*H23 --- Database management --- Electronic data processing --- Data base design --- System design --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Abstract data types (Computer science) --- Data structures (Computer science). --- Database design.
Choose an application
Programming --- Pascal (Computer program language) --- Computer programming --- 681.3*A1 --- 681.3*D1 --- 681.3*D32 --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Programming languages (Electronic computers) --- Introductory and survey --- Programming techniques--See also {681.3*E} --- language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- 681.3*D32 language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- 681.3*D1 Programming techniques--See also {681.3*E} --- 681.3*A1 Introductory and survey --- Data structures --- Recursivity --- Pascal (langage de programmation) --- Programming Language
Listing 1 - 10 of 10 |
Sort by
|