Zentralblatt MATH

88 Computer science68-04 Explicit machine computation and programs(not the theory of computation orprogramming)68-06 Proceedings, conferences, collections,etc.68Mxx Computer system organization68M01 General68M07 Mathematical problems of computer architecture68M10 Network design and communication[See also 68R10, 90B18]68M11 Internet topics [See also 68U35]68M12 Network protocols68M14 Distributed systems68M15 Reliability, testing and fault tolerance[See also 94C12]68M20 Performance evaluation; queueing;scheduling [See also 60K25, 90Bxx]68M99 None of the above, but in this section68Nxx Software68N01 General68N15 Programming languages68N17 Logic programming68N18 Functional programming and lambdacalculus [See also 03B40]68N19 Other programming techniques (objectoriented,sequential, concurrent, automatic,etc.)68N20 Compilers and interpreters68N25 Operating systems68N30 Mathematical aspects of software engineering(specification, verification, metrics,requirements, etc.)68N99 None of the above, but in this section68Pxx Theory of data68P01 General68P05 Data structures68P10 Searching and sorting68P15 Database theory68P20 Information storage and retrieval68P25 Data encryption [See also 94A60, 81P94]68P30 Coding and information theory (compaction,compression, models of communication,encoding schemes, etc.)[See also 94Axx]68P99 None of the above, but in this section68Qxx Theory of computing68Q01 General68Q05 Models of computation(Turing machines, etc.)[See also 03D10, 68Q12, 81P68]68Q10 Modes of computation (nondeterministic,parallel, interactive, probabilistic,etc.) [See also 68Q85]68Q12 Quantum algorithms and complexity[See also 68Q05, 81P68]68Q15 Complexity classes (hierarchies, relationsamong complexity classes, etc.)[See also 03D15, 68Q17, 68Q19]68Q17 Computational difficulty of problems(lower bounds, completeness, difficultyof approximation, etc.) [See also 68Q15]68Q19 Descriptive complexity and finite models[See also 03C13]68Q25 Analysis of algorithms and problemcomplexity [See also 68W40]68Q30 Algorithmic information theory (Kolmogorovcomplexity, etc.) [See also 03D32]68Q32 Computational learning theory[See also 68T05]68Q42 Grammars and rewriting systems68Q45 Formal languages and automata[See also 03D05, 68Q70, 94A45]68Q55 Semantics [See also 03B70, 06B35, 18C50]68Q60 Specification and verification(program logics, model checking, etc.)[See also 03B70]68Q65 Abstract data types; algebraic specification[See also 18C50]68Q70 Algebraic theory of languages and automata[See also 18B20, 20M35]68Q80 Cellular automata [See also 37B15]68Q85 Models and methods for concurrent anddistributed computing (process algebras,bisimulation, transition nets, etc.)68Q87 Probability in computer science (algorithmanalysis, random structures,phase transitions, etc.) [See also 68W20,68W40]68Q99 None of the above, but in this section68Rxx Discrete mathematics in relation tocomputer science68R01 General