The following pages link to (Q4154035):
Displaying 50 items.
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center (Q378186) (← links)
- A data modeling abstraction for describing triangular mesh algorithms (Q678220) (← links)
- On the discretization in time for a parabolic integrodifferential equation with a weakly singular kernel. I: Smooth initial data (Q687200) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Exact admission-control for integrated aperiodic and periodic tasks (Q858323) (← links)
- Worst-case analysis of a generalized heapsort algorithm (Q917307) (← links)
- Formalizing non-interference for a simple bytecode language in Coq (Q931434) (← links)
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem (Q976006) (← links)
- Stable marriages by coroutines (Q1050775) (← links)
- Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés (Q1073816) (← links)
- Numerical study of a relaxed variational problem from optimal design (Q1075125) (← links)
- Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching (Q1100911) (← links)
- A select and insert sorting algorithm (Q1115197) (← links)
- On the relationship between son-trees and symmetric binary B-trees (Q1133900) (← links)
- Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees (Q1148683) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Fundamental solutions of the eight queens problem (Q1161301) (← links)
- Usort: An efficient hybrid of distributive partitioning sorting (Q1162815) (← links)
- Minimal spanning trees and partial sorting (Q1166430) (← links)
- An introduction to three algorithms for sorting in situ (Q1167544) (← links)
- The two phase drum with the deepest bass note (Q1179779) (← links)
- Smoothsort revisited (Q1183408) (← links)
- Progressions in every two-coloration of \(Z_ n\) (Q1199996) (← links)
- The analysis of Quicksort programs (Q1225454) (← links)
- On a new approach to representation independent data classes (Q1234589) (← links)
- Insertion merge sorting (Q1244815) (← links)
- On a class of recursive procedures and equivalent iterative ones (Q1255777) (← links)
- Data structures to vectorize CG algorithms for general sparsity patterns (Q1262077) (← links)
- On the creation of a macromodel of social development (Q1333704) (← links)
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← links)
- Fast deterministic parsers for transition networks (Q1789065) (← links)
- A ``geometric'' view of the dynamics of trajectories of computer programs (Q1813776) (← links)
- An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences (Q1816324) (← links)
- ECLR-attributed grammars: a practical class of LR-attributed grammars (Q1822525) (← links)
- Updating a balanced search tree in 0(1) rotations (Q1838042) (← links)
- On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation (Q1857099) (← links)
- Formalized program specifications and transformation synthesis (Q1899896) (← links)
- Algebraic-grammatical models of parallel computation (Q1910963) (← links)
- Programming from Galois connections (Q1931902) (← links)
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems (Q2261720) (← links)
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← links)
- Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580) (← links)
- List partitions (Q2366166) (← links)
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← links)
- A memetic algorithm for the job-shop with time-lags (Q2468490) (← links)
- Incremental programming language development (Q2485088) (← links)
- A new adaptive mesh refinement strategy for numerically solving evolutionary PDE's (Q2499799) (← links)
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (Q2630015) (← links)
- Efficient data structures for adaptive remeshing with the FEM (Q2639620) (← links)
