Pages that link to "Item:Q625104"

The following pages link to Fault-tolerant search algorithms. Reliable computation with unreliable information (Q625104):

Displaying 32 items.

• Interval group testing for consecutive positives (Q526226) (← links)
• The Rényi-Ulam games and many-valued logics (Q679806) (← links)
• The solution space of sorting with recurring comparison faults (Q726101) (← links)
• A simple solution to Ulam's liar game with one lie (Q952012) (← links)
• Conditioning a state by a Łukasiewicz event: a probabilistic approach to Ulam games (Q1978507) (← links)
• Optimal dislocation with persistent errors in subquadratic time (Q1987515) (← links)
• Approximate minimum selection with unreliable comparisons (Q2072098) (← links)
• Search for a moving element with the minimum total cardinality of tests (Q2190927) (← links)
• Bounds for the capacity error function for unidirectional channels with noiseless feedback (Q2219054) (← links)
• On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice (Q2290640) (← links)
• Truth tellers and liars with fewer questions (Q2342617) (← links)
• Coding with noiseless feedback (Q2364460) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• Rota-Metropolis cubic logic and Ulam-Rényi games (Q2704221) (← links)
• The Solution Space of Sorting with Recurring Comparison Faults (Q2819522) (← links)
• Recurring Comparison Faults: Sorting and Finding the Minimum (Q2947883) (← links)
• Decoding Genomic Information (Q3295748) (← links)
• Optimal Dislocation with Persistent Errors in Subquadratic Time (Q3304135) (← links)
• (Q4281693) (← links)
• Effective Search Problems (Q4304108) (← links)
• (Q5075792) (← links)
• Resilient Dictionaries for Randomly Unreliable Memory (Q5075817) (← links)
• Sorting with Recurrent Comparison Errors (Q5136257) (← links)
• A Combinatorial Model of Two-Sided Search (Q5895055) (← links)
• Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
• Least adaptive optimal search with unreliable tests (Q5958337) (← links)
• Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies (Q5962511) (← links)
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
• Correcting a single error in feedback channels (Q6173470) (← links)
• Contract scheduling with predictions (Q6488786) (← links)
• Improved lower bound for estimating the number of defective items (Q6606192) (← links)
• Non-adaptive and adaptive two-sided search with fast objects (Q6660956) (← links)