From post

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.

, , , , , , , и . FUN, том 100 из LIPIcs, стр. 3:1-3:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

 

Другие публикации лиц с тем же именем

Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks., , , , , , , , , и . ICML, том 119 из Proceedings of Machine Learning Research, стр. 5533-5543. PMLR, (2020)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , и . Graphs Comb., 36 (2): 251-267 (2020)The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm., , , и . ICDCS, стр. 348-357. IEEE Computer Society, (2014)Infinite All-Layers Simple Foldability., , , , , и . Graphs Comb., 36 (2): 231-244 (2020)Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible., , , , , , , и . FUN, том 100 из LIPIcs, стр. 3:1-3:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Power of Choice in Priority Scheduling., , , и . PODC, стр. 283-292. ACM, (2017)Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms., , , и . PODC, стр. 377-386. ACM, (2018)Inherent Limitations of Hybrid Transactional Memory., , , , и . DISC, том 9363 из Lecture Notes in Computer Science, стр. 185-199. Springer, (2015)The SprayList: a scalable relaxed priority queue., , , и . PPoPP, стр. 11-20. ACM, (2015)Distributionally Linearizable Data Structures., , , , и . SPAA, стр. 133-142. ACM, (2018)