Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
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
- 2023
[c186]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal Energetic Paths for Electric Cars. ESA 2023: 42:1-42:17- [c185]Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir:
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. ESA 2023: 67:1-67:14 - [c184]Daniel Agassy, Dani Dorfman, Haim Kaplan:
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. ICALP 2023: 9:1-9:20 - [c183]Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma:
Fast Approximation of Search Trees on Trees with Centroid Trees. ICALP 2023: 19:1-19:20 - [c182]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Concurrent Shuffle Differential Privacy Under Continual Observation. ICML 2023: 33961-33982 - [c181]Haim Kaplan, David Naori, Danny Raz:
Almost Tight Bounds for Online Facility Location in the Random-Order Model. SODA 2023: 1523-1544 - [c180]Yaniv Sadeh, Haim Kaplan:
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. STACS 2023: 53:1-53:21 - [i104]Yaniv Sadeh, Haim Kaplan:
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. CoRR abs/2301.03084 (2023) - [i103]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Concurrent Shuffle Differential Privacy Under Continual Observation. CoRR abs/2301.12535 (2023) - [i102]Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer:
On Differentially Private Online Predictions. CoRR abs/2302.14099 (2023) - [i101]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal energetic paths for electric cars. CoRR abs/2305.19015 (2023) - [i100]Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR abs/2306.15338 (2023) - [i99]Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir:
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. CoRR abs/2307.14663 (2023) - 2022
- [j114]Avinatan Hassidim
, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Adversarially Robust Streaming Algorithms via Differential Privacy. J. ACM 69(6): 42:1-42:14 (2022) - [j113]Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Differentially Private Learning of Geometric Concepts. SIAM J. Comput. 51(4): 952-974 (2022) - [j112]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Optimal Weighted Load Balancing in TCAMs. IEEE/ACM Trans. Netw. 30(3): 985-998 (2022) - [c179]Olivier Bousquet, Amit Daniely, Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer:
Monotone Learning. COLT 2022: 842-866 - [c178]Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. SoCG 2022: 49:1-49:17 - [c177]Haim Kaplan, Shachar Schnapp, Uri Stemmer:
Differentially Private Approximate Quantiles. ICML 2022: 10751-10761 - [c176]Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer:
FriendlyCore: Practical Differentially Private Aggregation. ICML 2022: 21828-21863 - [c175]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Minimal Total Deviation in TCAM Load Balancing. INFOCOM 2022: 450-459 - [c174]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Coding Size of Traffic Partition in Switch Memories. ISIT 2022: 1590-1595 - [c173]Haim Kaplan, David Naori, Danny Raz:
Online Weighted Matching with a Sample. SODA 2022: 1247-1272 - [c172]Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick:
Simulating a stack using queues. SODA 2022: 1901-1924 - [c171]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC 2022: 1671-1684 - [i98]Olivier Bousquet, Amit Daniely, Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer:
Monotone Learning. CoRR abs/2202.05246 (2022) - [i97]Daniel Agassy, Dani Dorfman, Haim Kaplan:
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. CoRR abs/2205.10301 (2022) - [i96]Haim Kaplan, David Naori, Danny Raz:
Almost Tight Bounds for Online Facility Location in the Random-Order Model. CoRR abs/2207.08783 (2022) - [i95]Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma:
Fast approximation of search trees on trees with centroid trees. CoRR abs/2209.08024 (2022) - [i94]Olivier Bousquet, Haim Kaplan, Aryeh Kontorovich, Yishay Mansour, Shay Moran, Menachem Sadigurschi, Uri Stemmer:
Differentially-Private Bayes Consistency. CoRR abs/2212.04216 (2022) - [i93]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Codes for Load Balancing in TCAMs: Size Analysis. CoRR abs/2212.13256 (2022) - 2021
- [j111]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of Hypercubes and 3D Minkowski Sums with Random Sizes. Discret. Comput. Geom. 65(4): 1136-1165 (2021) - [j110]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. Discret. Math. 344(7): 112403 (2021) - [j109]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SIAM J. Comput. 50(2): 509-554 (2021) - [j108]Haim Kaplan, Shay Solomon:
Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach. ACM Trans. Parallel Comput. 8(1): 5:1-5:26 (2021) - [c170]Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour:
Online Markov Decision Processes with Aggregate Bandit Feedback. COLT 2021: 1301-1329 - [c169]Haim Kaplan, Yishay Mansour, Uri Stemmer:
The Sparse Vector Technique, Revisited. COLT 2021: 2747-2776 - [c168]Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer:
Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model. CRYPTO (3) 2021: 94-121 - [c167]Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Differentially-Private Clustering of Easy Instances. ICML 2021: 2049-2059 - [c166]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Differentially Private Multi-Armed Bandits in the Shuffle Model. NeurIPS 2021: 24956-24967 - [c165]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
How Much TCAM do we Need for Splitting Traffic? SOSR 2021: 169-175 - [c164]Haim Kaplan, Jay Tenenbaum:
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. STACS 2021: 46:1-46:16 - [i92]Haim Kaplan, Jay Tenenbaum:
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. CoRR abs/2101.04339 (2021) - [i91]Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer:
Separating Adaptive Streaming from Oblivious Streaming. CoRR abs/2101.10836 (2021) - [i90]Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour:
Online Markov Decision Processes with Aggregate Bandit Feedback. CoRR abs/2102.00490 (2021) - [i89]Haim Kaplan, David Naori, Danny Raz:
Online Weighted Bipartite Matching with a Sample. CoRR abs/2104.05771 (2021) - [i88]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Differentially Private Multi-Armed Bandits in the Shuffle Model. CoRR abs/2106.02900 (2021) - [i87]Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. CoRR abs/2106.14935 (2021) - [i86]Haim Kaplan, Shachar Schnapp, Uri Stemmer:
Differentially Private Approximate Quantiles. CoRR abs/2110.05429 (2021) - [i85]Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer:
FriendlyCore: Practical Differentially Private Aggregation. CoRR abs/2110.10132 (2021) - [i84]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR abs/2111.03980 (2021) - [i83]Haim Kaplan, Uri Stemmer:
A Note on Sanitizing Streams with Differential Privacy. CoRR abs/2111.13762 (2021) - [i82]Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Differentially-Private Clustering of Easy Instances. CoRR abs/2112.14445 (2021) - [i81]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Optimal Weighted Load Balancing in TCAMs. CoRR abs/2112.14732 (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. SoCG 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. SoCG 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]