scientific article

John E. Hopcrofts, A. V. Aho, Jeffrey D. Ullman

Publication date: 1983

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

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)

Related Items (only showing first 100 items - show all)

A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set ⋮ A new sorting algorithm ⋮ Smoothed analysis of binary search trees ⋮ Select with Groups of 3 or 4 ⋮ On the height of random m‐ary search trees ⋮ Discontinuous isogeometric analysis methods for the first-order form of the neutron transport equation with discrete ordinate (\(S_N\)) angular discretisation ⋮ The parallel hierarchical memory model ⋮ Fast updating of well-balanced trees ⋮ Computing a dominating pair in an asteroidal triple-free graph in linear time ⋮ Balanced search trees made simple ⋮ Unnamed Item ⋮ Marginalization in models generated by compositional expressions ⋮ A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs ⋮ AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH ⋮ Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function ⋮ The network-untangling problem: from interactions to activity timelines ⋮ A practical method for compressing sparse matrices with variant entries ⋮ A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application ⋮ On the upper bound of the complexity of sorting ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ Solving longest common subsequence problems via a transformation to the maximum clique problem ⋮ An algorithm for dynamic processing of dawg's ⋮ Towards classifying the polynomial-time solvability of temporal betweenness centrality ⋮ Relaxed balance through standard rotations ⋮ Testing the logical structure of questionnaires ⋮ Matrix shapes invariant under the symmetric QR algorithm ⋮ Hybridizations of Metaheuristics With Branch & Bound Derivates ⋮ Data Reduction for Maximum Matching on Real-World Graphs ⋮ On some generalization of rough sets ⋮ Four shades of deterministic leader election in anonymous networks ⋮ Compact scheme forests in nested normal form ⋮ Low complexity inverse mappings on sum-distinct elements of a power set ⋮ Reducing Acyclic Cover Transducers ⋮ Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality ⋮ An Application of Generalized Tree Pebbling to Sparse Matrix Factorization ⋮ Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ An efficient query recovery attack against a graph encryption scheme ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ A Short Proof of Ore’s f-Factor Theorem Using Flows ⋮ Opinion Manipulation in Social Networks ⋮ A tree labeling problem with an application to optimal approximation of continuous functions ⋮ A recursive algorithm for the multi-peg tower of hanoi problem ⋮ Unnamed Item ⋮ A fast retrieval technique for large graph structures ⋮ Sieving for rational points on hyperelliptic curves ⋮ On the approximation of shortest common supersequences and longest common subsequences ⋮ Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm ⋮ State-of-the-Art Sparse Direct Solvers ⋮ BICYCLIC SUBSEMIGROUPS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS ⋮ TOTAL UNCERTAINTY REVISITED ⋮ Quantum and classical query complexities of local search are polynomially related ⋮ Unnamed Item ⋮ A Real Elementary Approach to the Master Recurrence and Generalizations ⋮ Un nuevo resultado sobre la complejidad del problema delP-centro ⋮ Binary search trees with binary comparison cost ⋮ Flexible guidepath design for automated guided vehicle systems ⋮ Comparison of dynamic routeing techniques for automated guided vehicle system ⋮ Adaptive multiscale detection of filamentary structures in a background of uniform random points ⋮ Comparing performance of algorithms for generating concept lattices ⋮ Polynomial time algorithms for two classes of subgraph problem ⋮ A link trie structure of storing multiple attribute relationships for natural language dictionaries ⋮ Sorting shuffled monotone sequences ⋮ Combinatorial Aspects in Sparse Elimination Methods ⋮ Enumeration of subdifferentials of piecewise linear functions with abs-normal form ⋮ Amortization results for chromatic search trees, with an application to priority queues ⋮ К динамическому программированию по значениям в полугруппе ⋮ An efficient implementation of an algorithm for findingK shortest simple paths ⋮ Finding a mediocre player ⋮ Construction of tree automata from regular expressions ⋮ Unnamed Item ⋮ Selection Algorithms with Small Groups ⋮ Unnamed Item ⋮ An algorithm for computing the spectral radius of nonnegative tensors ⋮ Simulated Simulated Annealing ⋮ Universal Limit Laws for Depths in Random Trees ⋮ On the Horton-Strahler number for random tries ⋮ Unnamed Item ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs ⋮ Forbidden Factors and Fragment Assembly ⋮ Unconditionally stable and parallel discontinuous Galerkin solver ⋮ A parallel algorithm for computing Steiner trees in strongly chordal graphs ⋮ The parallel solution of domination problems on chordal and strongly chordal graphs ⋮ Automatically generating abstractions for planning ⋮ A linear-time near-optimum-length triangulation algorithm for convex polygons ⋮ Beam search for the longest common subsequence problem ⋮ Downward refinement and the efficiency of hierarchical problem solving ⋮ Proof pearl: Mechanizing the textbook proof of Huffman's algorithm ⋮ A dichotomy theorem for circular colouring reconfiguration ⋮ New results for the minimum weight triangulation problem ⋮ A locally optimized reordering algorithm and its application to a parallel sparse linear system solver ⋮ Assembly sequences for polyhedra ⋮ A simulated annealing approach to the multiconstraint zero-one knapsack problem ⋮ An \(O(ND)\) difference algorithm and its variations ⋮ A set expression based inheritance system ⋮ On finding a worst-case optimal fourth normal form database decomposition ⋮ On-line sorting of twisted sequences in linear time ⋮ General equilibrium and the theory of directed graphs ⋮ Modular technical change and genetic algorithms

This page was built for publication: