Computing with Noisy Information
Abstract
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In
Copyright
History
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Noisy Sorting CapacityIEEE Transactions on Information Theory, Vol. 70, No. 9 | 1 Sep 2024
- Energy efficient sorting, selection and searchingTheoretical Computer Science, Vol. 1002 | 1 Jun 2024
- Crowdsourcing of labeling image objects: an online gamification application for data collectionMultimedia Tools and Applications, Vol. 83, No. 7 | 4 August 2023
- Complexity of Round-Robin Allocation with Potentially Noisy QueriesAlgorithmic Game Theory | 31 August 2024
- Noisy Computing of the OR and MAX FunctionsIEEE Journal on Selected Areas in Information Theory, Vol. 5 | 1 Jan 2024
- Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) | 6 Nov 2023
- Noisy Tree Data Structures and Quantum ApplicationsMathematics, Vol. 11, No. 22 | 20 November 2023
- Optimizing Algorithms from Pairwise User Preferences2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) | 1 Oct 2023
- The Societal Impacts of Algorithmic Decision-Making8 September 2023
- Variable-Length Insertion-Based Noisy Sorting2023 IEEE International Symposium on Information Theory (ISIT) | 25 Jun 2023
- On the Optimal Bounds for Noisy Computing2023 IEEE International Symposium on Information Theory (ISIT) | 25 Jun 2023
- Optimal Parallel Sorting with Comparison ErrorsProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures | 17 June 2023
- Optimal Bounds for Noisy SortingProceedings of the 55th Annual ACM Symposium on Theory of Computing | 2 June 2023
- Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic TreesAlgorithmica, Vol. 85, No. 6 | 8 October 2022
- Faster quantum sampling of Markov chains in nonregular graphs with fewer qubitsPhysical Review A, Vol. 107, No. 2 | 27 February 2023
- Energy Efficient Sorting, Selection and SearchingWALCOM: Algorithms and Computation | 13 March 2023
- The Communication Complexity of Functions with Large OutputsStructural Information and Communication Complexity | 25 May 2023
- External-Memory Sorting with Comparison ErrorsAlgorithms and Data Structures | 28 July 2023
- Noisy Sorting Capacity2022 IEEE International Symposium on Information Theory (ISIT) | 26 Jun 2022
- Noisy Adaptive Group Testing via Noisy Binary SearchIEEE Transactions on Information Theory, Vol. 68, No. 5 | 1 May 2022
- The power of adaptivity in source identification with time queries on the pathTheoretical Computer Science, Vol. 911 | 1 Apr 2022
- Quantum Algorithms for Some Strings Problems Based on Quantum String ComparatorMathematics, Vol. 10, No. 3 | 26 January 2022
- Quantum version of self-balanced binary search tree with strings as keys and applicationsInternational Conference on Micro- and Nano-Electronics 2021 | 31 Jan 2022
- Approximate Minimum Selection with Unreliable ComparisonsAlgorithmica, Vol. 84, No. 1 | 1 November 2021
- Search tree with probabilistic key comparison and quantum string sortingProceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications" | 1 January 2022
- Crowdsourcing of Labeling Image Objects: An Online Gamification Application for Data CollectionSSRN Electronic Journal, Vol. 9 | 1 Jan 2022
- Skyline in Crowdsourcing with Imprecise ComparisonsProceedings of the 30th ACM International Conference on Information & Knowledge Management | 30 October 2021
- How to design robust algorithms using noisy comparison OracleProceedings of the VLDB Endowment, Vol. 14, No. 10 | 26 October 2021
- Navigating in Trees with Permanently Noisy AdviceACM Transactions on Algorithms, Vol. 17, No. 2 | 6 June 2021
- An Efficient Noisy Binary Search in Graphs via Median ApproximationCombinatorial Algorithms | 30 June 2021
- Robust parallel decision-making in neural circuits with nonlinear inhibitionProceedings of the National Academy of Sciences, Vol. 117, No. 41 | 2 October 2020
- Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed banditsProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 22 June 2020
- Longest Increasing Subsequence under Persistent Comparison ErrorsTheory of Computing Systems, Vol. 64, No. 4 | 20 February 2020
- Optimal Dislocation with Persistent Errors in Subquadratic TimeTheory of Computing Systems, Vol. 64, No. 3 | 3 December 2019
- Communication Complexity30 January 2020
- Communication Complexity of Discrete Fair DivisionSIAM Journal on Computing, Vol. 49, No. 1 | 27 February 2020
- Skyline Computation with Noisy ComparisonsCombinatorial Algorithms | 29 May 2020
- Communication for Generating Correlation: A Unifying SurveyIEEE Transactions on Information Theory, Vol. 66, No. 1 | 1 Jan 2020
- Multi-Party Protocols, Information Complexity and PrivacyACM Transactions on Computation Theory, Vol. 11, No. 2 | 17 March 2019
- Binary Search in Graphs RevisitedAlgorithmica, Vol. 81, No. 5 | 22 August 2018
- Information complexity and applicationsJapanese Journal of Mathematics, Vol. 14, No. 1 | 5 March 2019
- The Dependent Doors ProblemACM Transactions on Algorithms, Vol. 14, No. 4 | 21 August 2018
- A Rating-Ranking Method for Crowdsourced Top-k ComputationProceedings of the 2018 International Conference on Management of Data | 27 May 2018
- Selecting the Top-Quality Item Through Crowd ScoringACM Transactions on Modeling and Performance Evaluation of Computing Systems, Vol. 3, No. 1 | 13 February 2018
- Compressed Communication Complexity of Longest Common PrefixesString Processing and Information Retrieval | 14 September 2018
- Longest Increasing Subsequence Under Persistent Comparison ErrorsApproximation and Online Algorithms | 29 November 2018
- Inversions from Sorting with Distance-Based ErrorsSOFSEM 2018: Theory and Practice of Computer Science | 22 December 2017
- Crowdsourced OperatorsCrowdsourced Data Management | 13 October 2018
- Microscopy as a statistical, Rényi-Ulam, half-lie game: a new heuristic search strategy to accelerate imagingScientific Reports, Vol. 7, No. 1 | 7 November 2017
- Partial Sorting Problem on Evolving DataAlgorithmica, Vol. 79, No. 3 | 10 March 2017
- CrowdK: Answering top- k queries with crowdsourcingInformation Sciences, Vol. 399 | 1 Aug 2017
- A novel technique for stochastic root-finding: Enhancing the search with adaptive d-ary searchInformation Sciences, Vol. 393 | 1 Jul 2017
- Comparison-based ChoicesProceedings of the 2017 ACM Conference on Economics and Computation | 20 June 2017
- Exponential separation of quantum communication and classical informationProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 19 June 2017
- Optimization with Uniform Size QueriesAlgorithmica, Vol. 78, No. 1 | 10 May 2016
- Resilient Dynamic ProgrammingAlgorithmica, Vol. 77, No. 2 | 13 October 2015
- LCA*: an entropy-based measure for taxonomic assignment within assembled metagenomesBioinformatics, Vol. 32, No. 23 | 11 August 2016
- Towards a Reverse Newman’s Theorem in Interactive Information ComplexityAlgorithmica, Vol. 76, No. 3 | 12 January 2016
- Clustering with an oracle2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) | 1 Sep 2016
- Crowdsourced Data Management: A SurveyIEEE Transactions on Knowledge and Data Engineering, Vol. 28, No. 9 | 1 Sep 2016
- Deterministic and probabilistic binary search in graphsProceedings of the forty-eighth annual ACM symposium on Theory of Computing | 19 June 2016
- Crowdsourced top-k algorithmsProceedings of the VLDB Endowment, Vol. 9, No. 8 | 1 April 2016
- Sorting and Selection with Imprecise ComparisonsACM Transactions on Algorithms, Vol. 12, No. 2 | 17 November 2015
- Quantum Walks Can Find a Marked Element on Any GraphAlgorithmica, Vol. 74, No. 2 | 3 March 2015
- Shortest Paths on Evolving GraphsComputational Social Networks | 12 July 2016
- Optimization of Orchestration of Geocrowdsourcing ActivitiesInformation Systems for Crisis Response and Management in Mediterranean Countries | 2 October 2016
- The communication complexity of additionCombinatorica, Vol. 35, No. 6 | 22 October 2014
- Information Complexity and the Quest for Interactive CompressionACM SIGACT News, Vol. 46, No. 2 | 4 June 2015
- The Importance of Being ExpertProceedings of the 2015 ACM SIGMOD International Conference on Management of Data | 27 May 2015
- Skyline Queries with Noisy ComparisonsProceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 20 May 2015
- Data-driven crowdsourcing: Management, mining, and applications2015 IEEE 31st International Conference on Data Engineering | 1 Apr 2015
- How to Select the Top k Elements from Evolving Data?Algorithms and Computation | 27 November 2015
- Top-k and Clustering with Noisy ComparisonsACM Transactions on Database Systems, Vol. 39, No. 4 | 30 December 2014
- Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random ComparisonsAlgorithmica, Vol. 68, No. 4 | 25 October 2012
- Collaborative 20 Questions for Target LocalizationIEEE Transactions on Information Theory, Vol. 60, No. 4 | 1 Apr 2014
- Crowd-powered find algorithms2014 IEEE 30th International Conference on Data Engineering | 1 Mar 2014
- Data structures resilient to memory faultsACM Journal of Experimental Algorithmics, Vol. 18 | 19 April 2013
- A hard-to-compress interactive task?2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton) | 1 Oct 2013
- Element Distinctness, Frequency Moments, and Sliding Windows2013 IEEE 54th Annual Symposium on Foundations of Computer Science | 1 Oct 2013
- Direct Products in Communication Complexity2013 IEEE 54th Annual Symposium on Foundations of Computer Science | 1 Oct 2013
- Towards a Reverse Newman's Theorem in Interactive Information Complexity2013 IEEE Conference on Computational Complexity | 1 Jun 2013
- Using the crowd for top-k and group-by queriesProceedings of the 16th International Conference on Database Theory | 18 March 2013
- How to Compress Interactive CommunicationSIAM Journal on Computing, Vol. 42, No. 3 | 25 June 2013
- Bisection Search with Noisy ResponsesSIAM Journal on Control and Optimization, Vol. 51, No. 3 | 28 May 2013
- The K-armed dueling bandits problemJournal of Computer and System Sciences, Vol. 78, No. 5 | 1 Sep 2012
- Improved direct product theorems for randomized query complexitycomputational complexity, Vol. 21, No. 2 | 2 June 2012
- So who won?Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data | 20 May 2012
- Making polynomials robust to noiseProceedings of the forty-fourth annual ACM symposium on Theory of computing | 19 May 2012
- Reliability of Nanoelectronic VLSIAdvanced Circuits for Emerging Technologies | 7 May 2012
- Max algorithms in crowdsourcing environmentsProceedings of the 21st international conference on World Wide Web | 16 April 2012
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERSParallel Processing Letters, Vol. 22, No. 01 | 8 April 2012
- Large-scale validation and analysis of interleaved search evaluationACM Transactions on Information Systems, Vol. 30, No. 1 | 6 March 2012
- The Geometry of Generalized Binary SearchIEEE Transactions on Information Theory, Vol. 57, No. 12 | 1 Dec 2011
- Randomized ShellsortJournal of the ACM, Vol. 58, No. 6 | 1 December 2011
- User rankings from comparisons: Learning permutations in high dimensions2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) | 1 Sep 2011
- How to compress interactive communicationProceedings of the forty-second ACM symposium on Theory of computing | 5 June 2010
- Sample complexity for 1-bit compressed sensing and sparse classification2010 IEEE International Symposium on Information Theory | 1 Jun 2010
- Resilient Algorithms and Data StructuresAlgorithms and Complexity | 1 Jan 2010
- Experimental Study of Resilient Algorithms and Data StructuresExperimental Algorithms | 1 Jan 2010
- Data Structures Resilient to Memory Faults: An Experimental Study of DictionariesExperimental Algorithms | 1 Jan 2010
- Improving the Round Complexity of Traitor Tracing SchemesApplied Cryptography and Network Security | 1 Jan 2010
- Finding Is as Easy as Detecting for Quantum WalksAutomata, Languages and Programming | 1 Jan 2010
- Resilient dictionariesACM Transactions on Algorithms, Vol. 6, No. 1 | 28 December 2009
- Optimal resilient sorting and searching in the presence of memory faultsTheoretical Computer Science, Vol. 410, No. 44 | 1 Oct 2009
- Computing in fault tolerant broadcast networks and noisy decision treesRandom Structures & Algorithms, Vol. 34, No. 4 | 4 November 2008
- The Price of Resiliency: a Case Study on Sorting with Memory FaultsAlgorithmica, Vol. 53, No. 4 | 21 January 2009
- Sorting and Selection with Imprecise ComparisonsAutomata, Languages and Programming | 1 Jan 2009
- Sorting and Searching in Faulty MemoriesAlgorithmica, Vol. 52, No. 3 | 27 October 2007
- The Bayesian Learner is Optimal for Noisy Binary Search  (and Pretty Good for Quantum as Well)2008 49th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2008
- Lower Bounds for Noisy Wireless Networks using Sampling Algorithms2008 49th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2008
- Finding the K largest metrics in a noisy broadcast network2008 46th Annual Allerton Conference on Communication, Control, and Computing | 1 Sep 2008
- Lower Bounds for the Noisy Broadcast ProblemSIAM Journal on Computing, Vol. 37, No. 6 | 26 March 2008
- Designing reliable algorithms in unreliable memoriesComputer Science Review, Vol. 1, No. 2 | 1 Dec 2007
- Improved algorithms for quantum identification of Boolean oraclesTheoretical Computer Science, Vol. 378, No. 1 | 1 Jun 2007
- Optimal Resilient Dynamic DictionariesAlgorithms – ESA 2007 | 1 Jan 2007
- Reliably Executing Tasks in the Presence of Untrusted Entities2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) | 1 Oct 2006
- Optimal Resilient Sorting and Searching in the Presence of Memory FaultsAutomata, Languages and Programming | 1 Jan 2006
- Robust Quantum Algorithms with ε-Biased OraclesComputing and Combinatorics | 1 Jan 2006
- The Price of Resiliency: A Case Study on Sorting with Memory FaultsAlgorithms – ESA 2006 | 1 Jan 2006
- Quantum Identification of Boolean OraclesQuantum Computation and Information | 1 Jan 2006
- Query Complexity of Quantum Biased OraclesQuantum Computation and Information | 1 Jan 2006
- Majority Multiplexing—Economical Redundant Fault-Tolerant Designs for NanoarchitecturesIEEE Transactions On Nanotechnology, Vol. 4, No. 4 | 1 Jul 2005
- Computation in Noisy Radio NetworksSIAM Journal on Discrete Mathematics, Vol. 19, No. 1 | 1 August 2006
- Designing Reliable Algorithms in Unreliable MemoriesAlgorithms – ESA 2005 | 1 Jan 2005
- Robust Polynomials and Quantum AlgorithmsSTACS 2005 | 1 Jan 2005
- Lower Bounds for the Noisy Broadcast Problem46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) | 1 Jan 2005
- General Bounds for Quantum Biased OraclesIPSJ Digital Courier, Vol. 1 | 1 Jan 2005
- Quantum Biased OraclesIPSJ Digital Courier, Vol. 1 | 1 Jan 2005
- Sorting and searching in the presence of memory faults (without redundancy)Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 13 June 2004
- Computing in fault tolerance broadcast networksProceedings. 19th IEEE Annual Conference on Computational Complexity, 2004. | 1 Jan 2004
- Playing by searching: two strategies against a linearly bounded liarTheoretical Computer Science, Vol. 282, No. 2 | 1 Jun 2002
- A Fault-Tolerant Merge Sorting AlgorithmComputing and Combinatorics | 29 August 2002
- Searching games with errors—fifty years of coping with liarsTheoretical Computer Science, Vol. 270, No. 1-2 | 1 Jan 2002
- On the Decisional Complexity of Problems Over the RealsInformation and Computation, Vol. 167, No. 1 | 1 May 2001
- Sorting and selection with structured costsProceedings 42nd IEEE Symposium on Foundations of Computer Science | 1 Jan 2001
- Average-Case Lower Bounds for Noisy Boolean Decision TreesSIAM Journal on Computing, Vol. 28, No. 2 | 28 July 2006
- Design of reliable combinatorial algorithms using certificatesAlgorithms and Complexity | 3 June 2005
- A fast randomized LOGSPACE algorithm for graph connectivityTheoretical Computer Science, Vol. 169, No. 2 | 1 Dec 1996
- Approximate quantum Fourier transform and decoherencePhysical Review A, Vol. 54, No. 1 | 1 July 1996
View Options
Get Access
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].