The following pages link to (Q4040055):
Displaying 44 items.
- Searching for important factors in simulation models with many factors: Sequential bifurcation (Q97659) (← links)
- A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms (Q266307) (← links)
- On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms (Q288177) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- A MapReduce-based distributed SVM ensemble for scalable image classification and annotation (Q316305) (← links)
- Algorithmics for beginners. For students, teachers and pupils of the subjects of mathematics and informatics (Q380957) (← links)
- On aggregation of normed structures (Q646150) (← links)
- The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science (Q692921) (← links)
- Job distribution algorithms (Q885731) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- The generation of random numbers that are probably prime (Q1118632) (← links)
- Solving the satisfiability problem by using randomized approach (Q1190510) (← links)
- An almost-constant round interactive zero-knowledge proof (Q1198029) (← links)
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869) (← links)
- Convergence rates for steady-state derivative estimators (Q1207840) (← links)
- Characterization and processing of simple prefixed-chain recursion (Q1208145) (← links)
- New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. (Q1354031) (← links)
- The mathematical modeling of heuristics. (Q1354035) (← links)
- On the distribution for the duration of a randomized leader election algorithm (Q1354843) (← links)
- The determinant of a tree's neighborhood matrix (Q1355240) (← links)
- Perfect hashing (Q1391123) (← links)
- On \(k\)-ary \(n\)-cubes: Theory and applications. (Q1399117) (← links)
- The minimum labeling spanning trees (Q1567492) (← links)
- Fast rectangular matrix multiplication and QR decomposition (Q1893106) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs (Q2017395) (← links)
- Fixed point theorems in generalized metric spaces with applications to computer science (Q2252670) (← links)
- On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms (Q2331702) (← links)
- On quasi-metric aggregation functions and fixed point theorems (Q2445564) (← links)
- Table design in dynamic programming (Q2509355) (← links)
- (Q3094030) (← links)
- (Q3706485) (← links)
- (Q3706487) (← links)
- (Q4004292) (← links)
- (Q4320115) (← links)
- Computing the reciprocal of units in Galois rings (Q4549929) (← links)
- Analysis of quickselect : an algorithm for order statistics (Q4858843) (← links)
- Exchanging disks in the tower of hanoi (Q4870964) (← links)
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces (Q4903466) (← links)
- Lower bounds for the matrix chain ordering problem (Q5096328) (← links)
- On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms (Q5152986) (← links)
- How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems (Q5204318) (← links)
- Accelerating machines: a review (Q5451177) (← links)
- Fixed points on partially ordered quasi-metric spaces (Q6612675) (← links)
