scientific article; zbMATH DE number 3767009

MaRDI QIDQ3948568zbMATH OpenFDO

Authors A. V. Aho, John Hopcroft, Jeffrey D. Ullman

Publication date 1983

Cited in

(only showing first 100 items - show all)

Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
Abstract models for dialogue protocols
Improved grid search method: an efficient tool for global computation of periodic orbits. Application to Hill's problem
\(\mathcal H\)-OCSP: A protocol to reduce the processing burden in online certificate status validation
Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
On the average internal path length of m-ary search trees
Top-down synthesis of divide-and-conquer algorithms
Grid methods in simulation and random variate generation
A simulated annealing approach to the multiconstraint zero-one knapsack problem
An \(O(ND)\) difference algorithm and its variations
On finding a worst-case optimal fourth normal form database decomposition
On-line sorting of twisted sequences in linear time
On efficient parallel computations for some dynamic programming problems
Applications of the theory of records in the study of random trees
Parallel multischeme computation
On the balance property of Patricia tries: External path length viewpoint
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
On The variance of the extremal path length in a symmetric digital trie
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.
A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
Impact of knowledge on election time in anonymous networks
An improved algorithm for the longest common subsequence problem
Learning local transductions is hard
Segmentation and hashing of time series in stock market prediction
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
Multi-constrained matroidal knapsack problems
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
Liar's domination in graphs: complexity and algorithm
Efficient representation of state spaces for some dynamic models
Solving a class of multiplicative programs with 0-1 knapsack constraints
Construction of simple path graphs in transport networks. I: General solutions and examples
\texttt{FASTSET}: a fast data structure for the representation of sets of integers
Representative families for matroid intersections, with applications to location, packing, and covering problems
Temporal cliques admit sparse spanners
Simpler proofs with decentralized invariants
Indexing possibilistic numerical data using interval \(B^+\)-trees
Unconditionally stable and parallel discontinuous Galerkin solver
Exact algorithms for the repetition-bounded longest common subsequence problem
The community structure of human cellular signaling network
Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity
Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster
An adaptive, hanging-node, discontinuous isogeometric analysis method for the first-order form of the neutron transport equation with discrete ordinate \((S_{\mathrm{N}})\) angular discretisation
A selectable sloppy heap
An algorithm for computing the spectral radius of nonnegative tensors
A new sorting algorithm
Smoothed analysis of binary search trees
Discontinuous isogeometric analysis methods for the first-order form of the neutron transport equation with discrete ordinate (\(S_N\)) angular discretisation
A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
A tree labeling problem with an application to optimal approximation of continuous functions
Adaptive multiscale detection of filamentary structures in a background of uniform random points
The network-untangling problem: from interactions to activity timelines
On the upper bound of the complexity of sorting
Solving longest common subsequence problems via a transformation to the maximum clique problem
Towards classifying the polynomial-time solvability of temporal betweenness centrality
A fast retrieval technique for large graph structures
Fast insertion methods of a double-array structure
Sieving for rational points on hyperelliptic curves
Optimal gathering of oblivious robots in anonymous graphs
Hybridizations of metaheuristics with branch \& bound derivates
Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
A real elementary approach to the master recurrence and generalizations
A dichotomy theorem for circular colouring reconfiguration
Un nuevo resultado sobre la complejidad del problema delP-centro
Construction of tree automata from regular expressions
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
State-of-the-art sparse direct solvers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3948568)