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