Author of the publication

Finding and Counting Permutations via CSPs.

, , and . IPEC, volume 148 of LIPIcs, page 1:1-1:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

 

Other publications of authors with the same name

Fast approximation of search trees on trees with centroid trees., , , and . CoRR, (2022)Group Testing with Geometric Ranges., and . ISIT, page 868-873. IEEE, (2022)Proving the correctness of implementations of shared data abstractions.. Symposium on Programming, volume 137 of Lecture Notes in Computer Science, page 227-241. Springer, (1982)Selection from heaps, row-sorted matrices and X+Y using soft heaps., , , and . CoRR, (2018)Optimization with pattern-avoiding input., , and . CoRR, (2023)A time- and space-optimal algorithm for the many-visits TSP., , , and . SODA, page 1770-1782. SIAM, (2019)Splay trees on trees., and . SODA, page 1875-1900. SIAM, (2022)Binary search trees, rectangles and patterns.. Saarland University, Saarbrücken, Germany, (2016)Pairing heaps: the forward variant., , , and . MFCS, volume 117 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Privacy by Fake Data: A Geometric Approach., , and . CCCG, Carleton University, Ottawa, Canada, (2013)