scientific article; zbMATH DE number 3584897

zbMath0375.68005MaRDI QIDQ4154035

Niklaus Wirth

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (89)

On the creation of a macromodel of social development ⋮ List partitions ⋮ Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem ⋮ An algorithm for displaying a class of space-filling curves ⋮ Functional Pearls ⋮ A fortran procedure for drawing some space-filling curves ⋮ A new algorithm for generating hilbert curves ⋮ Formal Techniques for Deriving Binary Search Algorithms ⋮ Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching ⋮ Formalized program specifications and transformation synthesis ⋮ Efficient data structures for adaptive remeshing with the FEM ⋮ Recursive calculation of Hansen coefficients ⋮ Of Concurrent Data Structures and Iterations ⋮ Exact admission-control for integrated aperiodic and periodic tasks ⋮ Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters ⋮ Algebraic-grammatical models of parallel computation ⋮ A select and insert sorting algorithm ⋮ Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center ⋮ Syntactic methods for recursive equations and applications to differential equations ⋮ On the relationship between son-trees and symmetric binary B-trees ⋮ Programming from Galois connections ⋮ The Subject-Oriented Approach to Software Design and the Abstract State Machines Method ⋮ Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster ⋮ Exact pseudopolynomial algorithms for a balanced 2-clustering problem ⋮ Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees ⋮ Maintenance of configurations in the plane ⋮ Unnamed Item ⋮ Fundamental solutions of the eight queens problem ⋮ Usort: An efficient hybrid of distributive partitioning sorting ⋮ Worst-case analysis of a generalized heapsort algorithm ⋮ Minimal spanning trees and partial sorting ⋮ Unnamed Item ⋮ An introduction to three algorithms for sorting in situ ⋮ A note on peano polygons and gray codes ⋮ Direct transformations between sets of integers and hilbert polygons ⋮ An attributed translation grammar for PL/0 ⋮ Formalizing non-interference for a simple bytecode language in Coq ⋮ The two phase drum with the deepest bass note ⋮ Smoothsort revisited ⋮ Algorithm transformations for computational and data broadcast ⋮ A memetic algorithm for the job-shop with time-lags ⋮ A data modeling abstraction for describing triangular mesh algorithms ⋮ A linked forest manipulation system syntax rules for an attributed translation grammar for PL/0 ⋮ A linked forest manipulation system semantics rules for an attributed translation grammar for PL/0 ⋮ Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center ⋮ Progressions in every two-coloration of \(Z_ n\) ⋮ On the discretization in time for a parabolic integrodifferential equation with a weakly singular kernel. I: Smooth initial data ⋮ Converting a class of recursive procedures into non-recursive ones ⋮ Incremental programming language development ⋮ Binary search trees with binary comparison cost ⋮ The multiway trees of hanoi^† ⋮ Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems ⋮ Unnamed Item ⋮ A GRASP\(\times \)ELS approach for the capacitated location-routing problem ⋮ A note on files in pascal ⋮ The analysis of Quicksort programs ⋮ Higher order data types ⋮ Introspective sorting and selection revisited ⋮ A new adaptive mesh refinement strategy for numerically solving evolutionary PDE's ⋮ Two new approaches to robust estimation in time series ⋮ On a new approach to representation independent data classes ⋮ C++ Tools to construct our user-level language ⋮ Fast deterministic parsers for transition networks ⋮ Insertion merge sorting ⋮ Towards a Taxonomy for ECFG and RRPG Parsing ⋮ A formalization and explication of the Michael Jackson method of program design ⋮ Non-recursive top-down syntax analysis ⋮ Robotic system specification language use case ⋮ On a class of recursive procedures and equivalent iterative ones ⋮ PTAS for problems of vector choice and clustering with different centers ⋮ Data structures to vectorize CG algorithms for general sparsity patterns ⋮ A ``geometric view of the dynamics of trajectories of computer programs ⋮ An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences ⋮ Semantics of algorithmic languages ⋮ ECLR-attributed grammars: a practical class of LR-attributed grammars ⋮ Updating a balanced search tree in 0(1) rotations ⋮ Simple code optimizations ⋮ Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space ⋮ Stable marriages by coroutines ⋮ On the generation and use of space‐filling curves ⋮ Two examples of block structuring ⋮ A White Box Perspective on Behavioural Adaptation ⋮ On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation ⋮ Complexity and approximation of the smallest \(k\)-enclosing ball problem ⋮ An FPTAS for a vector subset search problem ⋮ Reasoning about Separation Using Abstraction and Reification ⋮ Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés ⋮ Using coroutines in pascal ⋮ Numerical study of a relaxed variational problem from optimal design

This page was built for publication: