scientific article; zbMATH DE number 3633709
From MaRDI portal
Publication:4194455
zbMath0407.68044MaRDI QIDQ4194455
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
SortingComputational ComplexityTextbookList ProcessingAlgorithms on GraphsDesign and Analysis of Computer AlgorithmsString Matching
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)
Related Items (39)
Asymptotic optimal HEAPSORT algorithm ⋮ A fast, on-line generalization algorithm for knowledge discovery ⋮ An optimal parallel algorithm to construct a deap ⋮ Merging heaps in parallel ⋮ AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM ⋮ AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM ⋮ Reinforcement learning with replacing eligibility traces ⋮ Invited paper Data rate optimization in synchronous circuits ⋮ Optimal representation of the minimum spanning tree algorithm in associative parallel processors ⋮ Elementariness of a finite set of words is co-NP-complete ⋮ Unnamed Item ⋮ Average time behavior of distributive sorting algorithms ⋮ The design and analysis of a new hybrid sorting algorithm ⋮ Stable in situ sorting and minimum data movement ⋮ Usort: An efficient hybrid of distributive partitioning sorting ⋮ Unnamed Item ⋮ An optimal algorithm for sink-finding ⋮ Assessing hierarchy and balance in dynamic network models ⋮ Bounded arithmetic for NC, ALogTIME, L and NL ⋮ A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square ⋮ A computer program for constructing a maximum-likelihood map from linkage data and its application to human chromosome 1 ⋮ Computing the probability distribution of project duration in a PERT network ⋮ The travelling salesman problem: selected algorithms and heuristics† ⋮ A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM ⋮ ALGORITHMS FOR RETURN PROBABILITIES FOR STOCHASTIC FLUID FLOWS ⋮ A Reliability and Performance Model For Static Data Flow Machines ⋮ A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square ⋮ Unnamed Item ⋮ Why should biconnected components be identified first ⋮ Product rules for the displacement of near-Toeplitz matrices ⋮ A selectable sloppy heap ⋮ Selection Algorithms with Small Groups ⋮ Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint ⋮ La teoria della complessita’ del calcolo: Un nuovo capitolo dell’algoritmica ⋮ Heuristic and exact algorithms for the precedence-constrained knapsack problem ⋮ Efficient bounds for the stable set, vertex cover and set packing problems ⋮ Recognition and interpretation of interacting and non-interacting features using spatial decomposition and Hamiltonian path search ⋮ Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. ⋮ Sorting in linear expected time
Uses Software
This page was built for publication:
