Publication:3948568
From MaRDI portal
zbMath0487.68005MaRDI QIDQ3948568
Jeffrey D. Ullman, John E. Hopcrofts, A. V. Aho
Publication date: 1983
stacks; sorting; dynamic programming; queues; graphs; trees; memory management; fragmentation; recurrence equations; combinatorial algorithms; tries; local search algorithms; recursive algorithms; hash tables; abstract data types; divide-and-conquer; compaction; lists; garbage collection; complexity of algorithms; buddy systems; back-tracking; bit vector techniques; greedy strategies; hashed and indexed files; reference counts; Super Pascal
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68P05: Data structures
Related Items
TOTAL UNCERTAINTY REVISITED, Unnamed Item, Flexible guidepath design for automated guided vehicle systems, Comparison of dynamic routeing techniques for automated guided vehicle system, Comparing performance of algorithms for generating concept lattices, AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗, FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH, An algorithm for dynamic processing of dawg's, Testing the logical structure of questionnaires, Matrix shapes invariant under the symmetric QR algorithm, A recursive algorithm for the multi-peg tower of hanoi problem, Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm, A link trie structure of storing multiple attribute relationships for natural language dictionaries, Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles, The path-variance problem on tree networks, Cutting hyperplane arrangements, Uniform random generation of expressions respecting algebraic identities, Branch-and-bound as a higher-order function, Computer programs and mathematical proofs, A characterization of digital search trees from the successful search viewpoint, Postorder trees and Eulerian numbers, Efficient learning of context-free grammars from positive structural examples, Resolving ambiguity in nonmonotonic inheritance hierarchies, Generating the states of a binary stochastic system, Fully dynamic Delaunay triangulation in logarithmic expected per operation, Pattern associativity and the retrieval of semantic networks, Optimal path cover problem on block graphs and bipartite permutation graphs, An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations, 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, Downward refinement and the efficiency of hierarchical problem solving, New results for the minimum weight triangulation problem, A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, A set expression based inheritance system, General equilibrium and the theory of directed graphs, Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors, Noise-induced escape through a chaotic saddle: lowering of the activation energy, A general limit theorem for recursive algorithms and combinatorial structures, An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays, Efficient coordinated motion., Sparse resultant of composed polynomials. I: Mixed-unmixed case., Learning local transductions is hard, A ``geometric view of the dynamics of trajectories of computer programs, The automation of syllogistic. II: Optimization and complexity issues, Sorting, linear time and the satisfiability problem, Alternating paths in edge-colored complete graphs, Assembly sequences for polyhedra, Modular technical change and genetic algorithms, On the minimum feasible graph for four sets, Efficient representation of state spaces for some dynamic models, Solving a class of multiplicative programs with 0-1 knapsack constraints, Unnamed Item, A fast retrieval technique for large graph structures, Sieving for rational points on hyperelliptic curves, On the Horton-Strahler number for random tries, Forbidden Factors and Fragment Assembly, A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set, On the height of random m‐ary search trees, Compact scheme forests in nested normal form, Low complexity inverse mappings on sum-distinct elements of a power set, Unnamed Item, Universal Limit Laws for Depths in Random Trees
