The following pages link to (Q4065051):
Displaying 50 items.
- The jogger's problem (Q593786) (← links)
- On aggregation of normed structures (Q646150) (← links)
- Optimal heapsort algorithm (Q671366) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- A method for solving systems of non-linear differential equations with moving singularities (Q709416) (← links)
- Four-index integral transformation exploiting symmetry (Q709698) (← links)
- Handwritten chinese text line segmentation by clustering with distance metric learning (Q733043) (← links)
- Unbounded hardware is equivalent to deterministic Turing machines (Q789180) (← links)
- Efficient polynomial algorithms for distributive lattices (Q810071) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- A restarted and modified simplex search for unconstrained optimization (Q833553) (← links)
- On the reduction of Yutsis graphs (Q878649) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Joint co-clustering: Co-clustering of genomic and clinical bioimaging data (Q929160) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
- Dynamic cycle detection (Q1055194) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- Analysis of algorithms on problems in general abelian groups (Q1062753) (← links)
- A linear time solution to the single function coarsest partition problem (Q1063420) (← links)
- A heuristic approach to hard constrained shortest path problems (Q1063522) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Transitive closure and related semiring properties via eliminants (Q1089083) (← links)
- On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees (Q1090335) (← links)
- Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery (Q1095944) (← links)
- On the detection of unstructuredness in flowgraphs (Q1098619) (← links)
- A parallel approach for theorem proving in propositional logic (Q1102766) (← links)
- A parallel algorithm for bisection width in trees (Q1103410) (← links)
- An algorithm for determining an opaque minimal forest of a convex polygon (Q1107998) (← links)
- On a recursion connected with tree balancing algorithms (Q1108022) (← links)
- Applications of the theory of records in the study of random trees (Q1110339) (← links)
- The evaluation of an alternative sum with applications to the analysis of some data structures (Q1111028) (← links)
- Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley (Q1112824) (← links)
- Efficient parallel circuits and algorithms for division (Q1114393) (← links)
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm (Q1115210) (← links)
- A unified framework for disambiguating finite transductions (Q1115635) (← links)
- Complementing deterministic Büchi automata in polynomial time (Q1116702) (← links)
- Strong tree-cographs are Birkhoff graphs (Q1119942) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- On some decision problems for RAM programs (Q1159463) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- Radix sort on the hypercube (Q1178199) (← links)
- Online matching with blocked input (Q1178205) (← links)
- Defining families of trees with E0L grammars (Q1179185) (← links)
- Propagating belief functions through constraint systems (Q1183369) (← links)
- Breadth-first traversal of trees and integer sorting in parallel (Q1186572) (← links)
- Complexity of preprocessing of recursive filters for running in parallel (Q1187929) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- A distributed selection algorithm and its expected communication complexity (Q1193632) (← links)
- A practical method for implementing string pattern matching machines (Q1193694) (← links)
