Computing with Noisy Information
From MaRDI portal
Recommendations
Cited in
(69)- Sorting and searching in faulty memories
- The price of resiliency: a case study on sorting with memory faults
- Optimal resilient sorting and searching in the presence of memory faults
- A fast randomized LOGSPACE algorithm for graph connectivity
- Playing by searching: Two strategies against a linearly bounded liar
- Partial sorting problem on evolving data
- Information complexity and applications.
- Binary search in graphs revisited
- On the decisional complexity of problems over the reals
- Optimal dislocation with persistent errors in subquadratic time
- Approximate minimum selection with unreliable comparisons
- An efficient noisy binary search in graphs via Median approximation
- The power of adaptivity in source identification with time queries on the path
- A novel technique for stochastic root-finding: enhancing the search with adaptive d-ary search
- Methods of knowledge discovery in ``noisy databases
- Quantum walks can find a marked element on any graph
- Rounds vs queries trade-off in noisy computation
- Noisy binary search and its applications
- Fast error-tolerant quartet phylogeny algorithms
- Computing in fault tolerant broadcast networks and noisy decision trees
- Estimating Computational Noise
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
- Improvements of Winograd's result on computation in the presence of noise (Corresp.)
- Optimal dislocation with persistent errors in subquadratic time
- Towards a reverse Newman's theorem in interactive information complexity
- scientific article; zbMATH DE number 4110630 (Why is no real title available?)
- Fast error-tolerant quartet phylogeny algorithms
- Average-Case Lower Bounds for Noisy Boolean Decision Trees
- Lower bounds for noisy Boolean decision trees
- The \(K\)-armed dueling bandits problem
- Designing reliable algorithms in unreliable memories
- Simplified separation of information and communication
- Maximum selection and sorting with adversarial comparators
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- An attempt to understand noisy posets
- Selection problems in the presence of implicit bias
- Preference-based online learning with dueling bandits: a survey
- Optimally sorting evolving data
- Algorithms for noisy broadcast with erasures
- Searching a Tree with Permanently Noisy Advice
- Skyline Computation with Noisy Comparisons
- Optimal sorting with persistent comparison errors
- Resilient Dictionaries for Randomly Unreliable Memory
- Binary search in graphs revisited
- Resilient dynamic programming
- Sorting with Recurrent Comparison Errors
- The communication complexity of addition
- Optimization with uniform size queries
- Searching games with errors -- fifty years of coping with liars
- scientific article; zbMATH DE number 7758330 (Why is no real title available?)
- Energy efficient sorting, selection and searching
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
- The communication complexity of functions with large outputs
- Edge and pair queries-random graphs and complexity
- External-memory sorting with comparison errors
- Energy efficient sorting, selection and searching
- Communication complexity of discrete fair division
- Algorithms for the generalized poset sorting problem
- Approximate selection with unreliable comparisons in sublinear time
- Improved direct product theorems for randomized query complexity
- Complexity of round-robin allocation with potentially noisy queries
- The query complexity of searching trees with permanently noisy advice
- Learning with comparison feedback: online estimation of sample statistics
- Complexity of round-robin allocation with potentially noisy queries
- The entropy of lies: playing twenty questions with a liar
- Better boosting of communication oracles, or not
- Noisy (binary) searching: simple, fast and correct
- Computational geometry with probabilistically noisy primitive operations
- Improved algorithms for quantum identification of Boolean oracles
This page was built for publication: Computing with Noisy Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4312419)
