The following pages link to Computing with Noisy Information (Q4312419):
Displaying 50 items.
- Quantum walks can find a marked element on any graph (Q262276) (← links)
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
- Fast error-tolerant quartet phylogeny algorithms (Q390892) (← links)
- The \(K\)-armed dueling bandits problem (Q440003) (← links)
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Resilient dynamic programming (Q513272) (← links)
- The communication complexity of addition (Q519955) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Sorting and searching in faulty memories (Q1006385) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- Optimal resilient sorting and searching in the presence of memory faults (Q1035681) (← links)
- A fast randomized LOGSPACE algorithm for graph connectivity (Q1349893) (← links)
- Playing by searching: Two strategies against a linearly bounded liar (Q1603717) (← links)
- Partial sorting problem on evolving data (Q1679242) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Optimal dislocation with persistent errors in subquadratic time (Q1987515) (← links)
- Approximate minimum selection with unreliable comparisons (Q2072098) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- The power of adaptivity in source identification with time queries on the path (Q2118878) (← links)
- A novel technique for stochastic root-finding: enhancing the search with adaptive \(d\)-ary search (Q2293151) (← links)
- Rounds vs queries trade-off in noisy computation (Q2921722) (← links)
- Fast Error-Tolerant Quartet Phylogeny Algorithms (Q3011850) (← links)
- Computing in fault tolerant broadcast networks and noisy decision trees (Q3055759) (← links)
- Estimating Computational Noise (Q3103515) (← links)
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS (Q3144930) (← links)
- Improvements of Winograd's result on computation in the presence of noise (Corresp.) (Q3222106) (← links)
- Optimal Dislocation with Persistent Errors in Subquadratic Time (Q3304135) (← links)
- (Q3833998) (← links)
- Average-Case Lower Bounds for Noisy Boolean Decision Trees (Q4210156) (← links)
- (Q4612484) (← links)
- (Q4614093) (← links)
- Selection problems in the presence of implicit bias (Q4993297) (← links)
- (Q4998871) (← links)
- (Q5002760) (← links)
- (Q5002843) (← links)
- Searching a Tree with Permanently Noisy Advice (Q5009618) (← links)
- Skyline Computation with Noisy Comparisons (Q5041199) (← links)
- (Q5075792) (← links)
- Resilient Dictionaries for Randomly Unreliable Memory (Q5075817) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- Sorting with Recurrent Comparison Errors (Q5136257) (← links)
- Longest increasing subsequence under persistent comparison errors (Q5916089) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- (Q6062152) (← links)
- Energy efficient sorting, selection and searching (Q6091161) (← links)
