scientific article; zbMATH DE number 3511563

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

Publication date: 1974

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

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

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

Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog ⋮ An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs ⋮ Structural properties of the string statistics problem ⋮ Diameter partitioning ⋮ Algorithm for a sum of reciprocals ⋮ Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem ⋮ An optimum testing algorithm for some symmetric coherent systems ⋮ An incremental primal sieve ⋮ An O(N log N) minimal spanning tree algorithm for N points in the plane ⋮ An algorithm for the enumeration of spanning trees ⋮ Almost optimal dynamic 2-3 trees ⋮ Finding small simple cycle separators for 2-connected planar graphs ⋮ Methods for a network design problem in solar power systems ⋮ Shortest paths in Euclidean graphs ⋮ An augmenting path algorithm for linear matroid parity ⋮ A dynamic programming approach to the complete set partitioning problem ⋮ Edge-connectivity augmentation problems ⋮ Edge-skeletons in arrangements with applications ⋮ Time optimal left to right construction of position trees ⋮ Linear codes and modular curves ⋮ The monotone circuit complexity of Boolean functions ⋮ Array processing machines: an abstract model ⋮ A graph coloring algorithm for large scale scheduling problems ⋮ Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator ⋮ On the analysis of cooperation and antagonism in networks of communicating processes ⋮ Time-space efficient algorithms for computing convolutions and related problems ⋮ Computing on a free tree via complexity-preserving mappings ⋮ Systolic processing for dynamic programming problems ⋮ Geometric complexity of some location problems ⋮ A linear algorithm for eliminating hidden-lines from a polygonal cylinder ⋮ Approximation of a set of points by points of a grid ⋮ Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study ⋮ An optimal speed-up parallel algorithm for triangulating simplicial point sets in space ⋮ Bounds for min-max heaps ⋮ Constraint propagation with interval labels ⋮ The problem of space invariance for sequential machines ⋮ Data structures and algorithms for approximate string matching ⋮ Parallel construction of a suffix tree with applications ⋮ Designing networks with compact routing tables ⋮ Adamant digraphs ⋮ A practically efficient and almost linear unification algorithm ⋮ A cluster-based cylindrical algebraic decomposition algorithm ⋮ The general maximum matching algorithm of Micali and Vazirani ⋮ Geometric optimization and \(D^ P\)-completeness ⋮ On the computational complexity of the Abelian permutation group structure, membership and intersection problems ⋮ The complexity of optimization problems ⋮ Finding maximum cliques on circular-arc graphs ⋮ An efficient algorithm for the job-shop problem with two jobs ⋮ A polynomial-time algorithm, based on Newton's method, for linear programming ⋮ On efficient parallel computations for some dynamic programming problems ⋮ Isometric embeddings in Hamming graphs ⋮ A parallel graph partitioning algorithm for a message-passing multiprocessor ⋮ A satisfiability tester for non-clausal propositional calculus ⋮ How to share a secret with cheaters ⋮ Floorplan design of VLSI circuits ⋮ Establishing order in planar subdivisions ⋮ A polynomial-time algorithm for the topological type of real algebraic curve ⋮ A linear-time algorithm for linear \(L_ 1\) approximation of points ⋮ An efficient algorithm for maxdominance, with applications ⋮ Algorithms for multicommodity flows in planar graphs ⋮ k-optimal solution sets for some polynomially solvable scheduling problems ⋮ An adaptive local mesh refinement method for time-dependent partial differential equations ⋮ A generalized inverse method for asymptotic linear programming ⋮ Improved bounds for rectangular and guillotine partitions ⋮ Parallel Hermite interpolation: An algebraic approach ⋮ GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation ⋮ Tiling a simply connected figure with bars of length 2 or 3 ⋮ Techniques for exploiting structure in matrix formulae of the sparse resultant ⋮ Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages ⋮ On the complexity of algorithms for the translation of polynomials ⋮ On the relationship between son-trees and symmetric binary B-trees ⋮ The fastest exact algorithms for the isolation of the real roots of a polynomial equation ⋮ The subgraph homeomorphism problem ⋮ Applications of efficient mergeable heaps for optimization problems on trees ⋮ Depth-first K-trees and critical path analysis ⋮ Dynamic programming is optimal for certain sequential decision processes ⋮ On the average number of rebalancing operations in weight-balanced trees ⋮ Ranking arborescences in O(Km log n) time ⋮ A strong-connectivity algorithm and its applications in data flow analysis ⋮ A cryptographic system based on finite field transforms ⋮ On the complexity of computing bilinear forms with \(\{0,1\}\) constants ⋮ The problem of quasi sorting ⋮ Controlled density sorting ⋮ On the measurement of complexity in activity networks ⋮ Complexity of spanning tree problems: Part I ⋮ A simple algorithm for finding a cycle of length greater than three and without diagonals ⋮ Finding efficient solutions for rectilinear distance location problems efficiently ⋮ The complexity of basic complex operations ⋮ Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees ⋮ A linear-time algorithm for a special case of disjoint set union ⋮ Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey ⋮ Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions ⋮ Sorting in linear expected time ⋮ Possibilistic search trees ⋮ Concerning the achromatic number of graphs ⋮ On some union and intersection problems for polygons with fixed orientations ⋮ Notes on the complexity of sorting in abstract machines ⋮ Some performance tests of convex hull algorithms ⋮ Optimal algorithms for comparing trees with labeled leaves ⋮ Generalized Steiner problem in outerplanar networks

This page was built for publication: