25 citations · 119 across the 29 of their papers we have counts for
3 papers · 1 filter
Noisy (Binary) Searching: Simple, Fast and Correct
Dariusz Dereniowski, Aleksander Łukasiewicz, Przemysław Uznański
This work considers the problem of the noisy binary search in a sorted array. The noise is modeled by a parameter that dictates that a comparison can be incorrect with probabil…
Searching by Heterogeneous Agents
Dariusz Dereniowski, Łukasz Kuszner, Robert Ostrowski
In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search p…
The Complexity of Bicriteria Tree-Depth
Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph . We introduce a bicriteria generalization in which additionally the…