Twenty (simple) questions-Reference-Cited by-同舟云学术

Twenty (simple) questions

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Dagan Yuval¹,Filmus Yuval¹,Gabizon Ariel²,Moran Shay³

Affiliation:

1. Technion, Israel

2. Zerocoin Electronic Coin, USA

3. University of California at San Diego, USA / Simons Institute for the Theory of Computing Berkeley, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3055399.3055422

Reference121 articles.

1. Julia Abrahams. 1997. Julia Abrahams. 1997.

2. Code and parse trees for lossless source encoding. In Compression and Complexity of Sequences. 145–171. Code and parse trees for lossless source encoding. In Compression and Complexity of Sequences. 145–171.

3. Protocols for Asymmetric Communication Channels

4. Rudolf Ahlswede and Ingo Wegener. 1987. Rudolf Ahlswede and Ingo Wegener. 1987.

5. Search problems. John Wiley & Sons Inc. New York. Search problems. John Wiley & Sons Inc. New York.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal Sets of Questions for Twenty Questions;SIAM Journal on Discrete Mathematics;2024-01-19

2. User-Driven Toponym Disambiguation Using Dialogue;Journal of Map & Geography Libraries;2023-09-02

3. Edge and Pair Queries-Random Graphs and Complexity;The Electronic Journal of Combinatorics;2023-06-02

4. Classification via Two-Way Comparisons (Extended Abstract);Lecture Notes in Computer Science;2023

5. On the cost of unsuccessful searches in search trees with two-way comparisons;Information and Computation;2021-12