Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDHaim Kaplan
Person information
- affiliation: Tel Aviv University, School of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c164]Haim Kaplan, Jay Tenenbaum:
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. STACS 2021: 46:1-46:16- [i83]Haim Kaplan, Jay Tenenbaum:
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. CoRR abs/2101.04339 (2021) - [i82]Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer:
Separating Adaptive Streaming from Oblivious Streaming. CoRR abs/2101.10836 (2021) - [i81]Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour:
Online Markov Decision Processes with Aggregate Bandit Feedback. CoRR abs/2102.00490 (2021) - 2020
- [j107]Haim Kaplan, Wolfgang Mulzer
, Liam Roditty, Paul Seiferth:
Reachability Oracles for Directed Transmission Graphs. Algorithmica 82(5): 1259-1276 (2020) - [j106]Dror Aiger, Haim Kaplan, Micha Sharir:
Output sensitive algorithms for approximate incidences and their applications. Comput. Geom. 91: 101666 (2020) - [j105]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. 64(1): 109-173 (2020) - [j104]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. 64(3): 838-904 (2020) - [j103]Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. ACM Trans. Algorithms 16(3): 40:1-40:28 (2020) - [j102]Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan:
Optimal Representations of a Traffic Distribution in Switch Memories. IEEE/ACM Trans. Netw. 28(2): 930-943 (2020) - [c163]Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour:
Apprenticeship Learning via Frank-Wolfe. AAAI 2020: 6720-6728 - [c162]Yuval Lewi, Haim Kaplan, Yishay Mansour:
Thompson Sampling for Adversarial Bit Prediction. ALT 2020: 518-553 - [c161]Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour:
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. ALT 2020: 906-934 - [c160]Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer:
Privately Learning Thresholds: Closing the Exponential Gap. COLT 2020: 2263-2285 - [c159]Haim Kaplan, Micha Sharir, Uri Stemmer:
How to Find a Point in the Convex Hull Privately. Symposium on Computational Geometry 2020: 52:1-52:15 - [c158]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Optimal approximations for traffic distribution in bounded switch memories. CoNEXT 2020: 309-322 - [c157]Aviv Rosenberg, Alon Cohen, Yishay Mansour, Haim Kaplan:
Near-optimal Regret Bounds for Stochastic Shortest Path. ICML 2020: 8210-8219 - [c156]Gal Sadeh, Edith Cohen, Haim Kaplan:
Sample Complexity Bounds for Influence Maximization. ITCS 2020: 29:1-29:36 - [c155]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Adversarially Robust Streaming Algorithms via Differential Privacy. NeurIPS 2020 - [c154]Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. NeurIPS 2020 - [c153]Haim Kaplan, David Naori, Danny Raz:
Competitive Analysis with a Sample and the Secretary Problem. SODA 2020: 2082-2095 - [c152]Haim Kaplan, Jay Tenenbaum:
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations. SWAT 2020: 28:1-28:18 - [c151]Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour:
Unknown mixing times in apprenticeship and reinforcement learning. UAI 2020: 430-439 - [i80]Alon Cohen, Haim Kaplan, Yishay Mansour, Aviv Rosenberg:
Near-optimal Regret Bounds for Stochastic Shortest Path. CoRR abs/2002.09869 (2020) - [i79]Haim Kaplan, Micha Sharir, Uri Stemmer:
How to Find a Point in the Convex Hull Privately. CoRR abs/2003.13192 (2020) - [i78]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Adversarially Robust Streaming Algorithms via Differential Privacy. CoRR abs/2004.05975 (2020) - [i77]Haim Kaplan, Jay Tenenbaum:
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations. CoRR abs/2004.07286 (2020) - [i76]Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. CoRR abs/2004.07839 (2020) - [i75]Shiri Artstein-Avidan, Haim Kaplan, Micha Sharir:
On Radial Isotropic Position: Theory and Algorithms. CoRR abs/2005.04918 (2020) - [i74]Dror Aiger, Haim Kaplan, Micha Sharir:
Output sensitive algorithms for approximate incidences and their applications. CoRR abs/2005.08193 (2020) - [i73]Dror Aiger, Haim Kaplan, Micha Sharir:
Duality-based approximation algorithms for depth queries and maximum depth. CoRR abs/2006.12318 (2020) - [i72]Haim Kaplan, Yishay Mansour, Uri Stemmer:
The Sparse Vector Technique, Revisited. CoRR abs/2010.00917 (2020)
2010 – 2019
- 2019
- [j101]Haim Kaplan, Sasanka Roy, Micha Sharir:
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. 81: 1-11 (2019) - [j100]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. 33(1): 116-137 (2019) - [c150]Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. Symposium on Computational Geometry 2019: 8:1-8:14 - [c149]Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. ESA 2019: 64:1-64:14 - [c148]Dani Dorfman, Haim Kaplan, Uri Zwick:
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. ICALP 2019: 114:1-114:14 - [c147]Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Differentially Private Learning of Geometric Concepts. ICML 2019: 3233-3241 - [c146]Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan:
Optimal Representations of a Traffic Distribution in Switch Memories. INFOCOM 2019: 2035-2043 - [c145]Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning to Screen. NeurIPS 2019: 8612-8621 - [c144]Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA 2019: 5:1-5:21 - [c143]Haim Kaplan, Or Zamir, Uri Zwick:
A sort of an adversary. SODA 2019: 1291-1310 - [c142]Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick:
Faster k-SAT algorithms using biased-PPSZ. STOC 2019: 578-589 - [i71]Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning and Generalization for Matching Problems. CoRR abs/1902.04741 (2019) - [i70]Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Differentially Private Learning of Geometric Concepts. CoRR abs/1902.05017 (2019) - [i69]Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour:
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. CoRR abs/1902.10140 (2019) - [i68]Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General techniques for approximate incidences and their application to the camera posing problem. CoRR abs/1903.07047 (2019) - [i67]Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour:
Average reward reinforcement learning with unknown mixing times. CoRR abs/1905.09704 (2019) - [i66]Yuval Lewi, Haim Kaplan, Yishay Mansour:
Thompson Sampling for Adversarial Bit Prediction. CoRR abs/1906.09059 (2019) - [i65]Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR abs/1907.01980 (2019) - [i64]Haim Kaplan, David Naori, Danny Raz:
Competitive Analysis with a Sample and the Secretary Problem. CoRR abs/1907.05350 (2019) - [i63]Gal Sadeh, Edith Cohen, Haim Kaplan:
Influence Maximization with Few Simulations. CoRR abs/1907.13301 (2019) - [i62]Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour:
Apprenticeship Learning via Frank-Wolfe. CoRR abs/1911.01679 (2019) - [i61]Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer:
Privately Learning Thresholds: Closing the Exponential Gap. CoRR abs/1911.10137 (2019) - 2018
- [j99]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. Algorithmica 80(3): 830-848 (2018) - [j98]Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford:
Accurate Traffic Splitting on SDN Switches. IEEE J. Sel. Areas Commun. 36(10): 2190-2201 (2018) - [j97]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Spanners for Directed Transmission Graphs. SIAM J. Comput. 47(4): 1585-1609 (2018) - [c141]Edith Cohen, Shiri Chechik, Haim Kaplan:
Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. AAAI 2018: 2884-2891 - [c140]Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick:
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. ESA 2018: 24:1-24:13 - [c139]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of Hypercubes and 3D Minkowski Sums with Random Sizes. ICALP 2018: 10:1-10:15 - [c138]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers Under Translation. ISAAC 2018: 26:1-26:13 - [c137]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC 2018: 50:1-50:12 - [c136]Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick:
Pairing heaps: the forward variant. MFCS 2018: 13:1-13:14 - [c135]Uri Stemmer, Haim Kaplan:
Differentially Private k-Means with Constant Multiplicative Error. NeurIPS 2018: 5436-5446 - [c134]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Prophet Secretary: Surpassing the 1-1/e Barrier. EC 2018: 303-318 - [c133]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SODA 2018: 495-514 - [c132]Haim Kaplan, Shay Solomon:
Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. SPAA 2018: 33-42 - [c131]Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford:
Accurate Traffic Splitting on Commodity Switches. SPAA 2018: 311-320 - [i60]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. CoRR abs/1801.03158 (2018) - [i59]Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR abs/1802.07041 (2018) - [i58]Haim Kaplan, Shay Solomon:
Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. CoRR abs/1802.09515 (2018) - [i57]Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour:
Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies. CoRR abs/1803.04674 (2018) - [i56]Haim Kaplan, Uri Stemmer:
Differentially Private k-Means with Constant Multiplicative Error. CoRR abs/1804.08001 (2018) - [i55]Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick:
Improved bounds for multipass pairing heaps and path-balanced binary search trees. CoRR abs/1806.08692 (2018) - [i54]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers under Translation. CoRR abs/1810.10466 (2018) - 2017
- [j96]Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov:
Upward Max-Min Fairness. J. ACM 64(1): 2:1-2:24 (2017) - [j95]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan:
Minimum-Cost Flows in Unit-Capacity Networks. Theory Comput. Syst. 61(4): 987-1010 (2017) - [j94]Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir:
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Trans. Algorithms 13(2): 26:1-26:42 (2017) - [j93]Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Hollow Heaps. ACM Trans. Algorithms 13(3): 42:1-42:27 (2017) - [c130]Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul M. Makhijani, Yuyi Wang, Roger Wattenhofer:
Min-Cost Bipartite Perfect Matching with Delays. APPROX-RANDOM 2017: 1:1-1:20 - [c129]Dror Aiger, Haim Kaplan, Micha Sharir:
Output Sensitive Algorithms for Approximate Incidences and Their Applications. ESA 2017: 5:1-5:13 - [c128]Haim Kaplan, Sasanka Roy, Micha Sharir:
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. ESA 2017: 52:1-52:13 - [c127]Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. ESA 2017: 64:1-64:14 - [c126]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. SODA 2017: 1051-1061 - [c125]Shiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan:
(1 + ∊)-Approximate f-Sensitive Distance Oracles. SODA 2017: 1479-1496 - [c124]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. SODA 2017: 2495-2504 - [i53]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time. CoRR abs/1704.02793 (2017) - [i52]Edith Cohen, Shiri Chechik, Haim Kaplan:
Clustering over Multi-Objective Samples: The one2all Sample. CoRR abs/1706.03607 (2017) - [i51]Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick:
Pairing heaps: the forward variant. CoRR abs/1709.01152 (2017) - [i50]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Prophet Secretary: Surpassing the 1-1/e Barrier. CoRR abs/1711.01834 (2017) - [i49]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR abs/1712.02913 (2017) - 2016
- [j92]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR Game. ACM Trans. Economics and Comput. 5(1): 1:1-1:22 (2016) - [j91]Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat:
Optimal In/Out TCAM Encodings of Ranges. IEEE/ACM Trans. Netw. 24(1): 555-568 (2016) - [c123]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. LATIN 2016: 536-548 - [c122]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the k-Level in Three-Dimensional Plane Arrangements. SODA 2016: 1193-1212 - [c121]Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick:
Bottleneck Paths and Trees and Deterministic Graphical Games. STACS 2016: 27:1-27:13 - [i48]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the $k$-Level in Three-Dimensional Plane Arrangements. CoRR abs/1601.04755 (2016) - [i47]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Reachability Oracles for Directed Transmission Graphs. CoRR abs/1601.07797 (2016) - [i46]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Spanners for Directed Transmission Graphs. CoRR abs/1601.07798 (2016) - [i45]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. CoRR abs/1604.03654 (2016) - [i44]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays. CoRR abs/1610.05155 (2016) - 2015
- [j90]Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir:
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. Discret. Comput. Geom. 54(4): 871-904 (2015) - [j89]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir:
Stable Delaunay Graphs. Discret. Comput. Geom. 54(4): 905-929 (2015) - [j88]Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal indices for predecessor search. Inf. Comput. 240: 12-30 (2015) - [j87]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. ACM Trans. Algorithms 11(4): 29:1-29:29 (2015) - [c120]Shiri Chechik, Edith Cohen, Haim Kaplan:
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. APPROX-RANDOM 2015: 659-679 - [c119]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Spanners and Reachability Oracles for Directed Transmission Graphs. Symposium on Computational Geometry 2015: 156-170 - [c118]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck:
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. ESA 2015: 619-630 - [c117]Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov:
The Temp Secretary Problem. ESA 2015: 631-642 - [c116]Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick:
Hollow Heaps. ICALP (1) 2015: 689-700 - [c115]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) 2015: 62-74 - [c114]Haim Kaplan, Or Zamir, Uri Zwick:
The amortized cost of finding the minimum. SODA 2015: 757-768 - [c113]Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan:
Minimum Cost Flows in Graphs with Unit Capacities. STACS 2015: 406-419 - [c112]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. STOC 2015: 625-634 - [i43]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling. CoRR abs/1501.02492 (2015) - [i42]Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
A faster algorithm for the discrete Fréchet distance under translation. CoRR abs/1501.03724 (2015) - [i41]Shiri Chechik, Edith Cohen, Haim Kaplan:
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. CoRR abs/1503.08528 (2015) - [i40]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir:
Stable Delaunay Graphs. CoRR abs/1504.06851 (2015) - [i39]Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov:
The Temp Secretary Problem. CoRR abs/1507.01732 (2015) - [i38]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. CoRR abs/1510.01072 (2015) - [i37]Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Hollow Heaps. CoRR abs/1510.06535 (2015) - 2014
- [j86]Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan:
The CB tree: a practical concurrent self-adjusting search tree. Distributed Comput. 27(6): 393-417 (2014) - [j85]Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Union of Random Minkowski Sums and Network Vulnerability Analysis. Discret. Comput. Geom. 52(3): 551-582 (2014) - [j84]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Algorithms and estimators for summarization of unaggregated data streams. J. Comput. Syst. Sci. 80(7): 1214-1244 (2014) - [j83]Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur:
Probe scheduling for efficient detection of silent failures. Perform. Evaluation 79: 73-89 (2014) - [j82]Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
Computing the Discrete Fréchet Distance in Subquadratic Time. SIAM J. Comput. 43(2): 429-449 (2014) - [j81]Dror Aiger, Haim Kaplan, Micha Sharir:
Reporting Neighbors in High-Dimensional Euclidean Space. SIAM J. Comput. 43(4): 1363-1395 (2014) - [c111]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. Symposium on Computational Geometry 2014: 377 - [c110]