The following pages link to (Q3992671):
Displaying 32 items.
- A linear time algorithm for metric dimension of cactus block graphs (Q278723) (← links)
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
- K-M-P string matching revisited (Q293129) (← links)
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Resolving error propagation in distributed systems (Q294777) (← links)
- Trading uninitialized space for time (Q834884) (← links)
- A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
- On the longest increasing subsequence of a circular list (Q845894) (← links)
- Variety and connectivity in kinematic chains (Q945479) (← links)
- The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing (Q945942) (← links)
- Efficient intensity map splitting algorithms for intensity-modulated radiation therapy (Q963365) (← links)
- Two flow network simplification algorithms (Q1045934) (← links)
- Models for concurrent product and process design (Q1046061) (← links)
- Data-movement-intensive problems: Two folk theorems in parallel computation revisited (Q1184985) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Enumerating \(k\)-way trees (Q1313764) (← links)
- A chained-matrices approach for parallel computation of continued fractions and its applications (Q1332396) (← links)
- Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures (Q1903780) (← links)
- Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control (Q1922638) (← links)
- All-pairs-shortest-length on strongly chordal graphs (Q1923609) (← links)
- Massively parallel tabu search for the quadratic assignment problem (Q2367011) (← links)
- Winograd's algorithm statistically revisited: it pays to weigh than to count! (Q2383729) (← links)
- Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)
- An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
- On completeness for NP via projection translations (Q4285624) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- Enhanced Modified-Polygon Method for Point-in-Polygon Problem (Q5141345) (← links)
- (Q5389685) (← links)
- Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels (Q5859660) (← links)
- Automating the approximate record-matching process (Q5938831) (← links)
- Topological recognition of polyhedral objects from multiple views (Q5940959) (← links)
