scientific article
From MaRDI portal
Publication:4023850
zbMath0826.68025MaRDI QIDQ4023850
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programmingfast Fourier transformNP-completenessparallel algorithmsdynamical programmingbranch-and-bound methodsorting algorithmsprogramming language C++
Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items (23)
Network DEA: efficiency analysis of organizations with complex internal structure ⋮ Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation ⋮ The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I ⋮ Implicit \(B\)-trees: A new data structure for the dictionary problem ⋮ Simulation of modular mechatronic systems with application to vehicle dynamics ⋮ Toward Unified Hybrid Simulation Techniques for Spiking Neural Networks ⋮ Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons ⋮ Supernode Binary Search Trees ⋮ Rotation-free Bernstein-Bézier elements for thin plates and shells -- development and validation ⋮ Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post ⋮ Uniform election in trees and polyominoids ⋮ The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II ⋮ Building a large location table to find replicas of physics objects ⋮ Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm ⋮ Model Checking LTL Formulae in RAISE with FDR ⋮ Parallel algorithms for red--black trees ⋮ Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section ⋮ Fast algorithms through divide- and combine-and-conquer strategies ⋮ Sorting, linear time and the satisfiability problem ⋮ Optimal block-tridiagonalization of matrices for coherent charge transport ⋮ The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules ⋮ In-place self-sorting fast Fourier transform algorithm with local memory references ⋮ A mixed evolutionary-statistical analysis of an algorithm's complexity
This page was built for publication:
