( en | de | ru )

 

Disambiguation of "Kaplan, Haim"

Author of the publication

copydeleteadd this publication to your clipboard
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications.

, , , and . ACM Trans. Algorithms, 13 (2): 26:1-26:42 (2017)

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.

Gerhard Haim

Haim Taubenhaus

Haim Abramowitsch

Gerhard Haim

Gerhard Haim

 

Other publications of authors with the same name

Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs., , , and . FOCS, page 56-65. IEEE Computer Society, (2003)Tighter estimation using bottom k sketches., and . Proc. VLDB Endow., 1 (1): 213-224 (2008)Reach for A*: Efficient Point-to-Point Shortest Path Algorithms., , and . ALENEX, page 129-143. SIAM, (2006)Algorithms and estimators for accurate summarization of internet traffic., , , , and . Internet Measurement Conference, page 265-278. ACM, (2007)LP-based Analysis of Greedy-dual-size., and . SODA, page 879-880. ACM/SIAM, (1999)Representations of Sparse Distributed Networks: A Locality-Sensitive Approach., and . CoRR, (2018)Reachability Oracles for Directed Transmission Graphs., , , and . CoRR, (2016)Optimal Cover of Points by Disks in a Simple Polygon., , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 475-486. Springer, (2010)Balanced-Replication Algorithms for Distribution Trees., and . ESA, volume 2461 of Lecture Notes in Computer Science, page 297-309. Springer, (2002)Maximum Flows by Incremental Breadth-First Search., , , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 457-468. Springer, (2011)