scientific article
From MaRDI portal
Publication:4065051
zbMath0307.68053MaRDI QIDQ4065051
A. V. Aho, Jeffrey D. Ullman, John E. Hopcrofts
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
The theory of languages ⋮ A model for deadlock detection based on automata and languages theory ⋮ The all-pairs quickest path problem ⋮ Finding extrema with unary predicates ⋮ A linear algorithm to decompose inheritance graphs into modules ⋮ Unique satisfiability of Horn sets can be solved in nearly linear time ⋮ A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths ⋮ The theory of languages ⋮ Fast algorithms for uniform semi-unification ⋮ Structures computable in polynomial time. I ⋮ Reverse search for enumeration ⋮ Mixed-hybrid finite element approximation of the potential fluid flow problem ⋮ Does indirect addressing matter? ⋮ Limit algebras and integer-valued cocycles, revisited ⋮ A semantic tree algorithm for the generation of sextet polynomials of hexagonal systems ⋮ On the choice of a multiplication algorithm for polynomials and polynomial matrices ⋮ Representing graphs implicitly using almost optimal space ⋮ Convergent Regular Splittings for Singular M-Matrices ⋮ Privatized rural postman problems ⋮ An efficient representation for implementing finite state machines based on the double-array ⋮ Partially Ordered Monads and Rough Sets ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems ⋮ On the complexity of reasoning in Kleene algebra ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ Subtraction-free complexity, cluster transformations, and spanning trees ⋮ Categorical Innovations for Rough Sets ⋮ Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras ⋮ A comparative study of 2-3 trees and AVL trees ⋮ La teoria della complessita’ del calcolo: Un nuovo capitolo dell’algoritmica ⋮ Query costs in HB(1) trees versus 2?3 trees ⋮ On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation ⋮ Arithmetic complexity of certain linear transformations ⋮ Determinism versus nondeterminism for linear time RAMs with memory restrictions ⋮ A token based \(k\)-resilient mutual exclusion algorithm for distributed systems ⋮ Generating new designs using union operations ⋮ Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions ⋮ Steiner polygons in the Steiner problem ⋮ A restarted and modified simplex search for unconstrained optimization ⋮ Most and least uniform spanning trees ⋮ The representation of permutations by trees ⋮ Transitive closure and related semiring properties via eliminants ⋮ On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees ⋮ Asymptotic optimal HEAPSORT algorithm ⋮ Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery ⋮ On the detection of unstructuredness in flowgraphs ⋮ On the area of intersection between two closed 2-D objects. ⋮ Algorithms for approximate graph matching ⋮ A parallel approach for theorem proving in propositional logic ⋮ A parallel algorithm for bisection width in trees ⋮ Nominative data with ordered set of names ⋮ Fast local search and guided local search and their application to British Telecom's workforce scheduling problem ⋮ An algorithm for determining an opaque minimal forest of a convex polygon ⋮ On a recursion connected with tree balancing algorithms ⋮ The decision support system GMCR in environmental conflict management ⋮ Applications of the theory of records in the study of random trees ⋮ The evaluation of an alternative sum with applications to the analysis of some data structures ⋮ Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley ⋮ Efficient parallel circuits and algorithms for division ⋮ \(BS^*:\) An admissible bidirectional staged heuristic search algorithm ⋮ A unified framework for disambiguating finite transductions ⋮ The jogger's problem ⋮ Complementing deterministic Büchi automata in polynomial time ⋮ Transversal partitioning in balanced hypergraphs ⋮ Strong tree-cographs are Birkhoff graphs ⋮ On the reduction of Yutsis graphs ⋮ Univariate polynomial factorization over finite fields ⋮ Amortization results for chromatic search trees, with an application to priority queues ⋮ Job-shop scheduling: Computational study of local search and large-step optimization methods ⋮ Activity nets: A guided tour through some recent developments ⋮ Clustering on trees ⋮ Evaluation of piecewise affine control via binary search tree ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Sequence spaces and asymmetric norms in the theory of computational complexity. ⋮ Analysis of Euclidean algorithms for polynomials over finite fields ⋮ On some decision problems for RAM programs ⋮ On aggregation of normed structures ⋮ Joint co-clustering: Co-clustering of genomic and clinical bioimaging data ⋮ A unified approach to parallel depth-first traversals of general trees ⋮ Radix sort on the hypercube ⋮ Online matching with blocked input ⋮ Defining families of trees with E0L grammars ⋮ Propagating belief functions through constraint systems ⋮ Breadth-first traversal of trees and integer sorting in parallel ⋮ Optimal heapsort algorithm ⋮ Complexity of preprocessing of recursive filters for running in parallel ⋮ A linear-time algorithm for computing the intersection of all odd cycles in a graph ⋮ Dynamic programming with convexity, concavity and sparsity ⋮ A distributed selection algorithm and its expected communication complexity ⋮ A practical method for implementing string pattern matching machines ⋮ A new upper bound on the complexity of the all pairs shortest path problem ⋮ Minimum perfect bipartite matchings and spanning trees under categorization ⋮ A sublinear parallel algorithm for some dynamic programming problems ⋮ Efficient VLSI fault simulation ⋮ Description and analysis of a bottom-up DFA minimization algorithm ⋮ An optimal parallel algorithm for computing furthest neighbors in a tree ⋮ An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem ⋮ Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming ⋮ A method for solving systems of non-linear differential equations with moving singularities ⋮ Four-index integral transformation exploiting symmetry ⋮ Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
This page was built for publication:
