( en | de | ru )

 

Disambiguation of "Pankratov, Denis"

Author of the publication

copydeleteadd this publication to your clipboard
Calibree: Calibration-Free Localization Using Relative Distance Estimations.

, , , and . Pervasive, volume 5013 of Lecture Notes in Computer Science, page 146-161. Springer, (2008)

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.

Oleg Pankratov

Wladimir Denisow

Jaap Denissen

Natalja Denisjuk

Alexander Arnold Denisiuk

 

Other publications of authors with the same name

Advice Complexity of Priority Algorithms., , , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 69-86. Springer, (2018)Advice Complexity of Priority Algorithms., , , and . Theory Comput. Syst., 64 (4): 593-625 (2020)A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version., , and . SOSA, volume 61 of OASIcs, page 8:1-8:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Stabbing Planes., , , , , , and . Electron. Colloquium Comput. Complex., (2017)An Experimental Study of Algorithms for Online Bipartite Matching., , and . ACM J. Exp. Algorithmics, (2020)Information Lower Bounds via Self-reducibility., , , and . CSR, volume 7913 of Lecture Notes in Computer Science, page 183-194. Springer, (2013)On Conceptually Simple Algorithms for Variants of Online Bipartite Matching., , and . WAOA, volume 10787 of Lecture Notes in Computer Science, page 253-268. Springer, (2017)Maximum Weight Convex Polytope., , and . CCCG, page 257-263. (2022)On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem., and . SAT, volume 6175 of Lecture Notes in Computer Science, page 223-236. Springer, (2010)Random CNFs are Hard for Cutting Planes., , , and . CoRR, (2017)