scientific article
From MaRDI portal
Publication:4023849
zbMath0798.68002MaRDI QIDQ4023849
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items (29)
A heap-based algorithm for the study of one-dimensional particle systems. ⋮ Path-based depth-first search for strong and biconnected components ⋮ Fast computation of multiphase flow in porous media by implicit discontinuous Galerkin schemes with optimal ordering of elements ⋮ A redundancy eliminating approach to linearly independent rings selection in the ring perception problem ⋮ In-place calculation of minimum-redundancy codes ⋮ The complexity of modular decomposition of Boolean functions ⋮ Intelligent transportation systems -- Enabling technologies ⋮ Polymorphic constitutive equations in finite element codes ⋮ Evaluating systems of equations: Toward a formal approach ⋮ Reverse polish notation method ⋮ Randomized Shortest-Path Problems: Two Related Models ⋮ Reconstruction of rooted trees from subtrees ⋮ A new algorithm for the minimal-area convex enclosure problem ⋮ The Impact of Compilation Flags and Choosing Single- or Double-Precision Variables in Linear Systems Solvers ⋮ Numerical geometric acoustics: an eikonal-based approach for modeling sound propagation in 3D environments ⋮ Факторное моделирование для инновационно-активных предприятий ⋮ An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification ⋮ Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture ⋮ Application of genetic algorithms to the design optimization of an active vehicle suspension system ⋮ A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays ⋮ Quasi-Monte Carlo algorithms for diffusion equations in high dimensions ⋮ A QMC approach for high dimensional Fokker-Planck equations modelling polymeric liquids ⋮ On well-separated sets and fast multipole methods ⋮ Dichotomic Selection on Words: A Probabilistic Analysis ⋮ Fast search algorithms for look‐up tables ⋮ The complete-tree-like matching mc-DFA and their implementation ⋮ A note on mc-DFA and its minimization ⋮ A note concerning the closest point pair algorithm. ⋮ On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
This page was built for publication:
