scientific article; zbMATH DE number 3635458
From MaRDI portal
Publication:4195901
zbMath0408.68003MaRDI QIDQ4195901
Ellis Horowitz, Sartaj K. Sahni
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Data structures (68P05) General topics in the theory of software (68N01)
Related Items
On growing random binary trees, Optimal task assignment with precedence in distributed computing systems, Implementation techniques for the vehicle routing problem, A general backtrack algorithm for the isomorphism problem of combinatorial objects, Eliminating the flag in threaded binary search trees, Effect of data organization in a system of interleaved memories on the performance of parallel search, Linear-time optimal augmentation for componentwise bipartite-completeness of graphs, The location of central structures in trees, Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree, An adaptive local mesh refinement method for time-dependent partial differential equations, On the complexity of entailment in propositional multivalued logics, Algorithms for the inverse and a generalization of the state space approach to finite automata, Cache Optimized Solution for Sparse Linear System over Large Order Finite Field, An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube, Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search, The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk., Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints., Compiling problem specifications into SAT, On the Most Probable Shape of a Search Tree Grown from a Random Permutation, GBSSS: The generalized big square small square method for planar single- facility location, Pattern associativity and the retrieval of semantic networks, On the entropy production of time series with unidirectional linearity, Binary search trees with binary comparison cost, Computing Hough transforms on hypercube multicomputers, Syntactic methodology of pruning large lexicons in cursive script recognition, Graphix a graph theory sub language, A linear time approximation algorithm for multiprocessor scheduling, Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's, Page-queries as a tool for organizing secondary memory auxiliary databases. II: Optimal selection of SADB contents, Locating an absolute center on graphs that are almost trees, From Tessellations to Table Interpretation, Equal sums of four seventh powers, A comparative study of 2-3 trees and AVL trees, Scheduling unit-time tasks with integer release times and deadlines, On the complexity of partitioning sparse matrix representations, Computing a longest common subsequence for a set of strings, An efficient external sorting with minimal space requirement, Dynamic cycle detection, A parallel search algorithm for directed acyclic graphs, On the average internal path length of m-ary search trees, An applicative random-access stack
