Pages that link to "Item:Q3638022"
From MaRDI portal
The following pages link to Sorting and Selection with Imprecise Comparisons (Q3638022):
Displaying 16 items.
- Resilient dynamic programming (Q513272) (← links)
- Partial sorting problem on evolving data (Q1679242) (← links)
- Optimal dislocation with persistent errors in subquadratic time (Q1987515) (← links)
- Finding kings in tournaments (Q2081490) (← links)
- On the optimality of tape merge of two lists with similar size (Q2182103) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
- On the Evolution of Monotone Conjunctions: Drilling for Best Approximations (Q2830270) (← links)
- Optimal Dislocation with Persistent Errors in Subquadratic Time (Q3304135) (← links)
- (Q4614093) (← links)
- The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
- (Q4962215) (redirect page) (← links)
- (Q5075792) (← links)
- Query-Competitive Sorting with Uncertainty. (Q5092365) (← links)
- Longest increasing subsequence under persistent comparison errors (Q5916089) (← links)
- Query minimization under stochastic uncertainty (Q5925528) (← links)
