scientific article; zbMATH DE number 1047152
algorithmic designAlgorithmsComputation handbookcryptographyscheduling algorithmsVLSI layout algorithms
Collections of articles of miscellaneous specific interest (00B15) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Searching and sorting (68P10) Data encryption (aspects in computer science) (68P25) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
The present handbook outlines the fundamental concepts, ideas, methods and results appearing in algorithms, data structures and the theory of computation. Leading experts have competently written 48 chapters with a broad coverage of topics such as: algorithmic design; (average case) analysis of algorithms; (multidimensional) data structures; searching and sorting; graph algorithms; matching in strings and pattern matching; randomized and algebraic algorithms; computational geometry; robot algorithms; image processing algorithms; VLSI layout algorithms; formal languages and grammars; computability; complexity classes and measures; reducibility and completeness; computational learning theory; linear and integer programming; convex optimization; approximation and scheduling algorithms; algorithms in AI; cryptography and cryptoanalysis; parallel computation and algorithms; distributed computing; etc. This handbook is written in a simple and clear way and it is delightful to read. It is written for graduate students and researchers and offers a comprehensive and coherent exposition for all those who deal with algorithms and the theory of computation. This handbook gives an excellent survey of the state of the art in the areas mentioned above. Each contribution ends with chapters called ``Defining terms (containing a list of technical notions used in the text together with their explanations), ``References (containing relevant and actual literature on the topic discussed) and ``Further information (containing some comments on the cited literature). The handbook can be highly recommended for anyone interested in algorithms, data structures and the theory of computation. It is also an indispensable book of reference for all computer scientists, researchers and (hopefully) professional programmers.
- Tighter constant-factor time hierarchies
- The constrained longest common subsequence problem
- An algebraic representation of graphs and applications to graph enumeration
- A program for sequential allocation of three Bernoulli populations
- Obtaining splits from cut sets of tight spans
- Computational power of infinite quantum parallelism
- A scatter search for the periodic capacitated arc routing problem
- Quantum computation with coherent spin states and the close Hadamard problem
- Comparison of metaheuristics for the bilevel facility location and mill pricing problem
- scientific article; zbMATH DE number 3856408 (Why is no real title available?)
- Distributed Disaster Disclosure
- Algorithms and theory of computation handbook. General concepts and techniques.
- Algorithms and theory of computation handbook. Special topics and techniques.
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- scientific article; zbMATH DE number 54110 (Why is no real title available?)
- Handbook of practical and technical computer science
- Combinatorics of 1-particle irreducible n-point functions via coalgebra in quantum field theory
- A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}
- Encyclopedia of algorithms. In 3 volumes
- Space efficient algorithms for the Burrows-Wheeler backtransformation
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
- Variability-based model transformation: formal foundation and application
- Geometric stable roommates
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4349101)
