( en | de | ru )

 

Disambiguation of "Afshani, Peyman"

Author of the publication

copydeleteadd this publication to your clipboard
The query complexity of a permutation-based variant of Mastermind.

, , , , , and . Discret. Appl. Math., (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Peyman Afshani

Peyman Hodawandkhani

Peyman Sadeghi

Peyman Arab

Peyman Nasehpour

 

Other publications of authors with the same name

Lower Bounds for Semialgebraic Range Searching and Stabbing Problems., and . J. ACM, 70 (2): 16:1-16:26 (April 2023)Locality-of-Reference Optimality of Cache-Oblivious Algorithms., , , , and . APOCS, page 31-45. SIAM, (2022)Centerpoint Query Authentication., , , and . CIKM, page 3083-3087. ACM, (2021)The query complexity of a permutation-based variant of Mastermind., , , , , and . Discret. Appl. Math., (2019)On Approximate Range Counting and Depth., and . Discret. Comput. Geom., 42 (1): 3-21 (2009)An Optimal Lower Bound for Simplex Range Reporting., and . CoRR, (2022)Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency., , , , , , , , , and . WAFR, volume 17 of Springer Proceedings in Advanced Robotics, page 107-123. Springer, (2021)Fragile Complexity of Comparison-Based Algorithms., , , , , , , and . ESA, volume 144 of LIPIcs, page 2:1-2:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization., , , , , , and . ACM J. Exp. Algorithmics, (2018)A Lower Bound for Jumbled Indexing., , , and . SODA, page 592-606. SIAM, (2020)