The following pages link to (Q3948568):
Displaying 50 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- Using relevance queries for identification of read-once functions (Q376140) (← links)
- A hyper-heuristic for the longest common subsequence problem (Q441749) (← links)
- Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox (Q458475) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Sparse approximate inverse preconditioners on high performance GPU platforms (Q520817) (← links)
- HD tree: A novel data structure to support multi-dimensional range query for P2P networks (Q635389) (← links)
- Computing diameter constrained reliability of a network with junction points (Q649994) (← links)
- Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles (Q686739) (← links)
- The path-variance problem on tree networks (Q705500) (← links)
- Computing shortest transversals (Q757096) (← links)
- On sorting triangles in a Delaunay tessellation (Q802898) (← links)
- Efficient sorting during repetitive statistical computations: Algorithms and an application (Q804105) (← links)
- Beam search for the longest common subsequence problem (Q833536) (← links)
- Proof pearl: Mechanizing the textbook proof of Huffman's algorithm (Q839031) (← links)
- On the complexity of division and set joins in the relational algebra (Q882434) (← links)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- Binary search trees of almost optimal height (Q911247) (← links)
- Analysis of the standard deletion algorithms in exact fit domain binary search trees (Q911249) (← links)
- Optimal sequence alignment allowing for long gaps (Q912793) (← links)
- Consistency of optimal sequence alignments (Q912794) (← links)
- Clique optimization: A method to construct parsimonious ultrametric trees from similarity data (Q923556) (← links)
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path (Q930607) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Abstract models for dialogue protocols (Q1006459) (← links)
- Improved grid search method: an efficient tool for global computation of periodic orbits. Application to Hill's problem (Q1011854) (← links)
- \(\mathcal H\)-OCSP: A protocol to reduce the processing burden in online certificate status validation (Q1020575) (← links)
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm) (Q1058966) (← links)
- On the average internal path length of m-ary search trees (Q1060015) (← links)
- Top-down synthesis of divide-and-conquer algorithms (Q1062770) (← links)
- Grid methods in simulation and random variate generation (Q1069659) (← links)
- A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588) (← links)
- An \(O(ND)\) difference algorithm and its variations (Q1099955) (← links)
- On finding a worst-case optimal fourth normal form database decomposition (Q1101219) (← links)
- On-line sorting of twisted sequences in linear time (Q1104753) (← links)
- On efficient parallel computations for some dynamic programming problems (Q1109691) (← links)
- Applications of the theory of records in the study of random trees (Q1110339) (← links)
- Parallel multischeme computation (Q1119348) (← links)
- On the balance property of Patricia tries: External path length viewpoint (Q1124339) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- Uniform random generation of expressions respecting algebraic identities (Q1179541) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Computer programs and mathematical proofs (Q1181864) (← links)
- A characterization of digital search trees from the successful search viewpoint (Q1183573) (← links)
- Postorder trees and Eulerian numbers (Q1186520) (← links)
- Efficient learning of context-free grammars from positive structural examples (Q1186808) (← links)
- Resolving ambiguity in nonmonotonic inheritance hierarchies (Q1193489) (← links)
