scientific article

Publication date: 1983

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

linear programming sorting dynamic programming Pascal arithmetic geometric algorithms NP-completeness graph algorithms pattern matching searching numerical analysis parsing exhaustive search string processing mathematical algorithms special-purpose hardware

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of software (68N01) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99) Discrete mathematics in relation to computer science (68Rxx)

Related Items (76)

Point placement algorithms for Delaunay triangulation of polygonal domains ⋮ Optimal multi-file read policies for optical discs ⋮ The principle of optimality in the design of efficient algorithms ⋮ Upper and lower bounds for fully retroactive graph problems ⋮ Shortest paths in Euclidean graphs ⋮ Cost-based filtering techniques for stochastic inventory control under service level constraints ⋮ Worst-case efficient external-memory priority queues ⋮ A babystep-giantstep method for faster deterministic integer factorization ⋮ Approximate single linkage cluster analysis of large data sets in high-dimensional spaces ⋮ On the computational complexity of dynamic graph problems ⋮ A sweepline algorithm for Voronoi diagrams ⋮ Motion planning in the presence of movable obstacles ⋮ The period of the Fibonacci random number generator ⋮ Generation of convex polygons with individual angular constraints ⋮ COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗ ⋮ A QUEUEING MODELLING APPROACH TO CLUSTERED HETEROGENEOUS DISCRETE EVENT DYNAMIC SYSTEMS ⋮ An algorithm for profile and wavefront reduction of sparse matrices ⋮ Convex hull of planarh-polyhedra ⋮ Invited paper Data rate optimization in synchronous circuits ⋮ A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times ⋮ On alternativep-center problems ⋮ Weighted domination of cocomparability graphs ⋮ Assessing fast Fourier transform algorithms. ⋮ Modeling the functional network of primary intercellular Ca\(^{2+}\) wave propagation in astrocytes and its application to study drug effects ⋮ A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data ⋮ Analysis and test of efficient methods for building recursive deterministic perceptron neural networks ⋮ Analysis of quickselect : an algorithm for order statistics ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ String matching algorithms and automata ⋮ Computing of high breakdown regression estimators without sorting on graphics processing units ⋮ Differential and integral equations for the 2-iterated Bernoulli, 2-iterated Euler and Bernoulli-Euler polynomials ⋮ An analysis of the Karp-Rabin string matching algorithm ⋮ Designing and proving correct a convex hull algorithm with hypermaps in Coq ⋮ Enumeration of idempotents in planar diagram monoids ⋮ The emergence of computational sociology ⋮ Assessing hierarchy and balance in dynamic network models ⋮ On tries, contention trees and their analysis ⋮ Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems ⋮ Three priority queue applications revisited ⋮ Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers ⋮ Generation of three‐dimensional unstructured grids by the advancing‐front method ⋮ Martingales and large deviations for binary search trees ⋮ Generating the states of a binary stochastic system ⋮ Remarks on History and Presence of Game Tree Search and Research ⋮ Computing finite semigroups ⋮ A comparison of algorithms for exact goodness-of-fit tests for multinomial data ⋮ The unambiguity of segmented morphisms ⋮ On the modeling of pedestrian motion ⋮ The travelling salesman problem: selected algorithms and heuristics† ⋮ Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem. ⋮ A combinatorial approach to Golomb forests ⋮ Adaptive remeshing for transient problems ⋮ Efficient memo-table management strategies ⋮ A general transposition method for a matrix on auxiliary store ⋮ Computer Go ⋮ A FORTRAN program for profile and wavefront reduction ⋮ The Diophantine Equation 𝑥⁴+2𝑦⁴=𝑧⁴+4𝑤⁴ ⋮ Assembly planning with an ordering genetic algorithm ⋮ New perspectives on rhythmic canons and the spectral conjecture ⋮ Unnamed Item ⋮ An algorithm for the multiprocessor assignment problem ⋮ An algorithm for drawing general undirected graphs ⋮ Thinning algorithms for scattered data interpolation ⋮ A note on optimal parallel transformations of regular expressions to nondeterministic finite automata ⋮ Integer Sets with Distinct Subset-Sums ⋮ An optimal parallel algorithm to convert a regular expression into its Glushkov automaton ⋮ Percolation in quantum computation and ⋮ A simplified correctness proof for a well-known algorithm computing strongly connected components. ⋮ Square tilings with prescribed combinatorics ⋮ Split sequence hash search ⋮ Worst-case choice for the stable marriage problem ⋮ The relationship between the threshold dimension of split graphs and various dimensional parameters ⋮ Using Gale transforms in computational geometry ⋮ Improved upper bounds on Shellsort ⋮ Structure learning of Bayesian networks using global optimization with applications in data classification ⋮ Adaptive thinning for bivariate scattered data

This page was built for publication: