scientific article; zbMATH DE number 3635458
From MaRDI portal
Publication:4195901
Cited in
(41)- Dynamic cycle detection
- On the average internal path length of m-ary search trees
- An applicative random-access stack
- On growing random binary trees
- Implementation techniques for the vehicle routing problem
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- Eliminating the flag in threaded binary search trees
- Effect of data organization in a system of interleaved memories on the performance of parallel search
- The location of central structures in trees
- Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
- An adaptive local mesh refinement method for time-dependent partial differential equations
- GBSSS: The generalized big square small square method for planar single- facility location
- Pattern associativity and the retrieval of semantic networks
- Locating an absolute center on graphs that are almost trees
- Optimal task assignment with precedence in distributed computing systems
- Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
- On the complexity of entailment in propositional multivalued logics
- Page-queries as a tool for organizing secondary memory auxiliary databases. II: Optimal selection of SADB contents
- Scheduling unit-time tasks with integer release times and deadlines
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
- Compiling problem specifications into SAT
- A linear time approximation algorithm for multiprocessor scheduling
- Algorithms for the inverse and a generalization of the state space approach to finite automata
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- Binary search trees with binary comparison cost
- From Tessellations to Table Interpretation
- A comparative study of 2-3 trees and AVL trees
- Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's
- Equal sums of four seventh powers
- An efficient external sorting with minimal space requirement
- Cache Optimized Solution for Sparse Linear System over Large Order Finite Field
- Graphix a graph theory sub language
- Computing Hough transforms on hypercube multicomputers
- Syntactic methodology of pruning large lexicons in cursive script recognition
- On the complexity of partitioning sparse matrix representations
- Computing a longest common subsequence for a set of strings
- A parallel search algorithm for directed acyclic graphs
- An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
- Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
- On the entropy production of time series with unidirectional linearity
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 Q4195901)
