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
- 2025
[c193]Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia:
Data Reconstruction: When You See It and When You Don't. ITCS 2025: 39:1-39:23- 2024
- [j116]Alexander Baumann
, Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. Discret. Comput. Geom. 71(1): 214-277 (2024) - [c192]Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir:
Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. ESA 2024: 7:1-7:20 - [c191]Yaniv Sadeh, Haim Kaplan:
Caching Connections in Matchings. ICALP 2024: 120:1-120:20 - [c190]Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning-Augmented Algorithms with Explicit Predictors. NeurIPS 2024 - [c189]Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA 2024: 299-305 - [c188]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
Minimum-cost paths for electric cars. SOSA 2024: 374-382 - [i110]Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning-Augmented Algorithms with Explicit Predictors. CoRR abs/2403.07413 (2024) - [i109]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
Minimum-cost paths for electric cars. CoRR abs/2403.16936 (2024) - [i108]Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia:
Data Reconstruction: When You See It and When You Don't. CoRR abs/2405.15753 (2024) - [i107]Gilad Yehudai, Haim Kaplan, Asma Ghandeharioun, Mor Geva, Amir Globerson:
When Can Transformers Count to n? CoRR abs/2407.15160 (2024) - [i106]Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer, Nitzan Tur:
On Differentially Private Linear Algebra. CoRR abs/2411.03087 (2024) - 2023
- [j115]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Load Balancing With Minimal Deviation in Switch Memories. IEEE Trans. Netw. Serv. Manag. 20(4): 4283-4296 (2023) - [c187]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal Energetic Paths for Electric Cars. ESA 2023: 42:1-42:17 - [c186]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 - [c185]Daniel Agassy, Dani Dorfman, Haim Kaplan:
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. ICALP 2023: 9:1-9:20 - [c184]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 - [c183]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Concurrent Shuffle Differential Privacy Under Continual Observation. ICML 2023: 33961-33982 - [c182]Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer:
Black-Box Differential Privacy for Interactive ML. NeurIPS 2023 - [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 - [i105]Yaniv Sadeh, Haim Kaplan:
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. CoRR abs/2301.03084 (2023) - [i104]Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Concurrent Shuffle Differential Privacy Under Continual Observation. CoRR abs/2301.12535 (2023) - [i103]Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer:
On Differentially Private Online Predictions. CoRR abs/2302.14099 (2023) - [i102]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal energetic paths for electric cars. CoRR abs/2305.19015 (2023) - [i101]Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR abs/2306.15338 (2023) - [i100]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) - [i99]Yaniv Sadeh, Haim Kaplan:
Caching Connections in Matchings. CoRR abs/2310.14058 (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]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 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. SoCG 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. SoCG 2014: 377 - [c110]Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick:
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. SODA 2014: 847-860 - [i36]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency labeling schemes and induced-universal graphs. CoRR abs/1404.3391 (2014) - [i35]Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir:
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. CoRR abs/1404.4851 (2014) - [i34]Haim Kaplan, Robert Endre Tarjan, Uri Zwick:
Fibonacci Heaps Revisited. CoRR abs/1407.5750 (2014) - [i33]Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky:
Epsilon-Nets for Halfspaces Revisited. CoRR abs/1410.3154 (2014) - 2013
- [j80]Moshe Hershcovitch, Haim Kaplan:
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. Algorithmica 65(2): 371-390 (2013) - [j79]Haim Kaplan, Micha Sharir:
Finding the largest Empty Disk containing a Query Point. Int. J. Comput. Geom. Appl. 23(4-5): 335-356 (2013) - [j78]Haim Kaplan, Ilia Lotosh, Tova Milo, Slava Novgorodov:
Answering Planning Queries with the Crowd. Proc. VLDB Endow. 6(9): 697-708 (2013) - [j77]Haim Kaplan, Robert Endre Tarjan, Uri Zwick:
Soft Heaps Simplified. SIAM J. Comput. 42(4): 1660-1673 (2013) - [c109]Edith Cohen, Haim Kaplan, Yishay Mansour:
Scheduling Subset Tests: One-Time, Continuous, and How They Relate. APPROX-RANDOM 2013: 81-95 - [c108]Edith Cohen, Haim Kaplan:
What You Can Do with Coordinated Samples. APPROX-RANDOM 2013: 452-467 - [c107]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of random minkowski sums and network vulnerability analysis. SoCG 2013: 177-186 - [c106]Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat:
On finding an optimal TCAM encoding scheme for packet classification. INFOCOM 2013: 2049-2057 - [c105]Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal Indices for Successor Search - (Extended Abstract). MFCS 2013: 278-289 - [c104]Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
Computing the Discrete Fréchet Distance in Subquadratic Time. SODA 2013: 156-167 - [c103]Dror Aiger, Haim Kaplan, Micha Sharir:
Reporting neighbors in high-dimensional Euclidean spaces. SODA 2013: 784-803 - [c102]Avinatan Hassidim, Haim Kaplan, Omry Tuval:
Joint Cache Partition and Job Assignment on Multi-core Processors. WADS 2013: 378-389 - [i32]Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur:
Probe Scheduling for Efficient Detection of Silent Failures. CoRR abs/1302.0792 (2013) - [i31]Sarel Cohen, Amos Fiat, Moshe Hershcovitch, Haim Kaplan:
Minimal Indices for Successor Search. CoRR abs/1306.3772 (2013) - [i30]Haim Kaplan, Yahav Nussbaum:
Min-Cost Flow Duality in Planar Networks. CoRR abs/1306.6728 (2013) - [i29]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 Techniques. CoRR abs/1310.5245 (2013) - [i28]Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Union of Random Minkowski Sums and Network Vulnerability Analysis. CoRR abs/1310.5647 (2013) - [i27]Edith Cohen, Amos Fiat, Haim Kaplan, Liam Roditty:
A Labeling Approach to Incremental Cycle Detection. CoRR abs/1310.8381 (2013) - 2012
- [j76]Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir:
Unit Distances in Three Dimensions. Comb. Probab. Comput. 21(4): 597-610 (2012) - [j75]Haim Kaplan, Jirí Matousek, Micha Sharir:
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Discret. Comput. Geom. 48(3): 499-517 (2012) - [j74]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-Free Makespan Approximation. SIAM J. Comput. 41(1): 12-25 (2012) - [j73]Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi:
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. SIAM J. Comput. 41(1): 104-127 (2012) - [j72]Natan Rubin, Haim Kaplan, Micha Sharir:
Improved Bounds for Geometric Permutations. SIAM J. Comput. 41(2): 367-390 (2012) - [c101]Haim Kaplan, Micha Sharir:
Finding the maximal empty disk containing a query point. SCG 2012: 287-292 - [c100]Tzvika Hartman, Avinatan Hassidim, Haim Kaplan, Danny Raz, Michal Segalov:
How to split a flow? INFOCOM 2012: 828-836 - [c99]Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov:
Upward Max Min Fairness. INFOCOM 2012: 837-845 - [c98]Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir:
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. SODA 2012: 338-355 - [c97]Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan:
CBTree: A Practical Concurrent Self-Adjusting Search Tree. DISC 2012: 1-15 - [c96]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR Game: Equilibrium Characterization - (Working Paper). WINE 2012: 561 - [i26]Edith Cohen, Haim Kaplan:
How to Estimate Change from Samples. CoRR abs/1203.4903 (2012) - [i25]Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
Computing the Discrete Fréchet Distance in Subquadratic Time. CoRR abs/1204.5333 (2012) - [i24]Edith Cohen, Haim Kaplan:
What you can do with Coordinated Samples. CoRR abs/1206.5637 (2012) - [i23]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR game: Equilibrium Characterization (Working Paper). CoRR abs/1210.1757 (2012) - [i22]Avinatan Hassidim, Haim Kaplan, Omry Tuval:
Joint Cache Partition and Job Assignment on Multi-Core Processors. CoRR abs/1210.4053 (2012) - [i21]Edith Cohen, Haim Kaplan:
A Case for Customizing Estimators: Coordinated Samples. CoRR abs/1212.0243 (2012) - 2011
- [j71]Haim Kaplan, Yahav Nussbaum:
Maximum Flow in Directed Planar Graphs with Vertex Capacities. Algorithmica 61(1): 174-189 (2011) - [j70]Haim Kaplan, Yahav Nussbaum:
A Simpler Linear-Time Recognition of Circular-Arc Graphs. Algorithmica 61(3): 694-737 (2011) - [j69]Haim Kaplan, Natan Rubin, Micha Sharir:
A kinetic triangulation scheme for moving points in the plane. Comput. Geom. 44(4): 191-205 (2011) - [j68]Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit:
Foreword. Discret. Appl. Math. 159(7): 497 (2011) - [j67]Haim Kaplan, Edgar Ramos, Micha Sharir:
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. Discret. Comput. Geom. 45(1): 3-33 (2011) - [j66]Haim Kaplan, Edgar Ramos, Micha Sharir:
The Overlay of Minimization Diagrams in a Randomized Incremental Construction. Discret. Comput. Geom. 45(3): 371-382 (2011) - [j65]György Elekes, Haim Kaplan, Micha Sharir:
On lines, joints, and incidences in three dimensions. J. Comb. Theory A 118(3): 962-977 (2011) - [j64]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. SIAM J. Comput. 40(5): 1402-1431 (2011) - [j63]Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir:
Optimal Cover of Points by Disks in a Simple Polygon. SIAM J. Comput. 40(6): 1647-1661 (2011) - [j62]Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Data structures for mergeable trees. ACM Trans. Algorithms 7(2): 14:1-14:30 (2011) - [c95]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Maximum Flows by Incremental Breadth-First Search. ESA 2011: 457-468 - [c94]Edith Cohen, Haim Kaplan:
Get the most out of your sample: optimal unbiased estimators using partial information. PODS 2011: 13-24 - [c93]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
Non-price equilibria in markets of discrete goods. EC 2011: 295-296 - [c92]Haim Kaplan, Yahav Nussbaum:
Minimum s-t cut in undirected planar graphs when the source and the sink are close. STACS 2011: 117-128 - [c91]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Truth, Envy, and Truthful Market Clearing Bundle Pricing. WINE 2011: 97-108 - [i20]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
Non-Price Equilibria in Markets of Discrete Goods. CoRR abs/1103.3950 (2011) - [i19]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir:
Kinetic Stable Delaunay Graphs. CoRR abs/1104.0622 (2011) - [i18]Haim Kaplan, Micha Sharir:
Finding the Maximal Empty Rectangle Containing a Query Point. CoRR abs/1106.3628 (2011) - [i17]Edith Cohen, Haim Kaplan:
Get the Most out of Your Sample: Optimal Unbiased Estimators using Partial Information. CoRR abs/1109.1325 (2011) - 2010
- [j61]Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu:
Guarding a Terrain by Two Watchtowers. Algorithmica 58(2): 352-390 (2010) - [j60]Haim Kaplan, Micha Sharir, Eugenii Shustin:
On Lines and Joints. Discret. Comput. Geom. 44(4): 838-843 (2010) - [j59]Edith Cohen, Haim Kaplan, Tova Milo:
Labeling Dynamic XML Trees. SIAM J. Comput. 39(5): 2048-2074 (2010) - [j58]Haim Kaplan, Natan Rubin, Micha Sharir:
Line Transversals of Convex Polyhedra in R3. SIAM J. Comput. 39(7): 3283-3310 (2010) - [c90]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir:
Kinetic stable Delaunay graphs. SCG 2010: 127-136 - [c89]Haim Kaplan, Natan Rubin, Micha Sharir:
A kinetic triangulation scheme for moving points in the plane. SCG 2010: 137-146 - [c88]Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir:
Optimal Cover of Points by Disks in a Simple Polygon. ESA (1) 2010: 475-486 - [c87]Natan Rubin, Haim Kaplan, Micha Sharir:
Improved Bounds for Geometric Permutations. FOCS 2010: 355-364 - [c86]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-free makespan approximation: extended abstract. EC 2010: 159-166 - [c85]Rubi Boim, Haim Kaplan, Tova Milo, Ronitt Rubinfeld:
Improved Recommendations via (More) Collaboration. WebDB 2010 - [e1]Haim Kaplan:
Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings. Lecture Notes in Computer Science 6139, Springer 2010, ISBN 978-3-642-13730-3 [contents] - [i16]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Truth and Envy in Capacitated Allocation Games. CoRR abs/1003.5326 (2010) - [i15]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
On the Interplay between Incentive Compatibility and Envy Freeness. CoRR abs/1003.5328 (2010) - [i14]Haim Kaplan, Natan Rubin, Micha Sharir:
A Kinetic Triangulation Scheme for Moving Points in The Plane. CoRR abs/1005.0912 (2010) - [i13]Natan Rubin, Haim Kaplan, Micha Sharir:
Improved Bounds for Geometric Permutations. CoRR abs/1007.3244 (2010)
2000 – 2009
- 2009
- [j57]Haim Kaplan, Natan Rubin, Micha Sharir:
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica 55(2): 283-310 (2009) - [j56]Haim Kaplan, Yahav Nussbaum:
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Discret. Appl. Math. 157(15): 3216-3230 (2009) - [j55]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Proc. VLDB Endow. 2(1): 431-442 (2009) - [j54]Edith Cohen, Haim Kaplan, Subhabrata Sen:
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. Proc. VLDB Endow. 2(1): 646-657 (2009) - [j53]Ke Chen, Haim Kaplan, Micha Sharir:
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Trans. Algorithms 5(2): 16:1-16:24 (2009) - [j52]Yoav Giyora, Haim Kaplan:
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Trans. Algorithms 5(3): 28:1-28:51 (2009) - [c84]Haim Kaplan, Yahav Nussbaum:
Maximum Flow in Directed Planar Graphs with Vertex Capacities. ESA 2009: 397-407 - [c83]Edith Cohen, Haim Kaplan:
Leveraging discarded samples for tighter estimation of multiple-set aggregates. SIGMETRICS/Performance 2009: 251-262 - [c82]Haim Kaplan, Natan Rubin, Micha Sharir:
Line transversals of convex polyhedra in R3. SODA 2009: 170-179 - [c81]Haim Kaplan, Uri Zwick:
A simpler implementation and analysis of Chazelle's soft heaps. SODA 2009: 477-485 - [c80]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Stream sampling for variance-optimal estimation of subset sums. SODA 2009: 1255-1264 - [c79]Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim:
Private coresets. STOC 2009: 361-370 - [i12]Edith Cohen, Haim Kaplan:
Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates. CoRR abs/0903.0625 (2009) - [i11]Haim Kaplan, Yahav Nussbaum:
Maximum Flow in Directed Planar Graphs with Vertex Capacities. CoRR abs/0905.0451 (2009) - [i10]György Elekes, Haim Kaplan, Micha Sharir:
On Lines, Joints, and Incidences in Three Dimensions. CoRR abs/0905.1583 (2009) - [i9]Haim Kaplan, Micha Sharir, Eugenii Shustin:
On lines and Joints. CoRR abs/0906.0558 (2009) - [i8]Edith Cohen, Haim Kaplan, Subhabrata Sen:
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. CoRR abs/0906.4560 (2009) - [i7]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-Free Makespan Approximation. CoRR abs/0909.1072 (2009) - 2008
- [j51]Edith Cohen, Nadav Grossaug, Haim Kaplan:
Processing top-k queries from samples. Comput. Networks 52(14): 2605-2622 (2008) - [j50]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. J. ACM 55(6): 28:1-28:32 (2008) - [j49]Edith Cohen, Haim Kaplan:
Tighter estimation using bottom k sketches. Proc. VLDB Endow. 1(1): 213-224 (2008) - [j48]Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin:
Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38(3): 982-1011 (2008) - [j47]Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery R. Westbrook:
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM J. Comput. 38(4): 1533-1573 (2008) - [j46]Haim Kaplan, Robert Endre Tarjan:
Thin heaps, thick heaps. ACM Trans. Algorithms 4(1): 3:1-3:14 (2008) - [j45]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Trans. Algorithms 5(1): 4:1-4:37 (2008) - [c78]Haim Kaplan, Nira Shafrir:
Path Minima in Incremental Unrooted Trees. ESA 2008: 565-576 - [c77]Edith Cohen, Haim Kaplan:
Estimating Aggregates over Multiple Sets. ICDM 2008: 761-766 - [c76]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. SODA 2008: 1194-1203 - [c75]Moshe Hershcovitch, Haim Kaplan:
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. SWAT 2008: 29-40 - [i6]Edith Cohen, Haim Kaplan:
Sketch-Based Estimation of Subpopulation-Weight. CoRR abs/0802.3448 (2008) - [i5]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Variance optimal sampling based estimation of subset sums. CoRR abs/0803.0473 (2008) - [i4]Haim Kaplan, Natan Rubin, Micha Sharir:
Line Transversals of Convex Polyhedra in R3. CoRR abs/0807.1221 (2008) - 2007
- [j44]Edith Cohen, Amos Fiat, Haim Kaplan:
Associative search in peer to peer networks: Harnessing latent semantics. Comput. Networks 51(8): 1861-1881 (2007) - [j43]Giora Alexandron, Haim Kaplan, Micha Sharir:
Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. 36(2): 144-158 (2007) - [j42]Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern:
Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. Inf. Comput. 205(7): 1114-1116 (2007) - [j41]Edith Cohen, Haim Kaplan:
Spatially-decaying aggregation over a network. J. Comput. Syst. Sci. 73(3): 265-288 (2007) - [j40]Haim Kaplan, Tova Milo, Ronen Shabo:
Compact Labeling Scheme for XML Ancestor Queries. Theory Comput. Syst. 40(1): 55-99 (2007) - [j39]Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl:
Online Conflict-Free Coloring for Intervals. SIAM J. Comput. 36(5): 1342-1359 (2007) - [j38]Haim Kaplan, Shir Landau, Elad Verbin:
A simpler analysis of Burrows-Wheeler-based compression. Theor. Comput. Sci. 387(3): 220-235 (2007) - [c74]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Computing the volume of the union of cubes. SCG 2007: 294-301 - [c73]Haim Kaplan, Elad Verbin:
Most Burrows-Wheeler Based Compressors Are Not Optimal. CPM 2007: 107-118 - [c72]Haim Kaplan, Natan Rubin, Micha Sharir:
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA 2007: 287-298 - [c71]Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing. ICALP 2007: 583-594 - [c70]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Conference 2007: 265-278 - [c69]Edith Cohen, Haim Kaplan:
Summarizing data using bottom-k sketches. PODC 2007: 225-234 - [c68]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Sketching unaggregated data streams for subpopulation-size queries. PODS 2007: 253-262 - [c67]Edith Cohen, Haim Kaplan:
Bottom-k sketches: better and more efficient estimation of aggregates. SIGMETRICS 2007: 353-354 - [c66]Yoav Giyora, Haim Kaplan:
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. SODA 2007: 19-28 - [c65]Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin:
Counting colors in boxes. SODA 2007: 785-794 - [c64]Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck:
Better Landmarks Within Reach. WEA 2007: 38-51 - [i3]Amos Fiat, Meital Levy, Haim Kaplan, Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing. Fair Division 2007 - [i2]Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Data Structures for Mergeable Trees. CoRR abs/0711.1682 (2007) - 2006
- [j37]Haim Kaplan, Nira Shafrir:
The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97(1): 23-27 (2006) - [j36]Arye Barkan, Haim Kaplan:
Partial alphabetic trees. J. Algorithms 58(2): 81-103 (2006) - [j35]Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe:
Compact Labeling Scheme for Ancestor Queries. SIAM J. Comput. 35(6): 1295-1309 (2006) - [c63]Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck:
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX 2006: 129-143 - [c62]Haim Kaplan, Micha Sharir, Elad Verbin:
Colored intersection searching via sparse rectangular matrix multiplication. SCG 2006: 52-60 - [c61]Edith Cohen, Nadav Grossaug, Haim Kaplan:
Processing top k queries from samples. CoNEXT 2006: 7 - [c60]Haim Kaplan, Shir Landau, Elad Verbin:
A Simpler Analysis of Burrows-Wheeler Based Compression. CPM 2006: 282-293 - [c59]Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck:
Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem 2006: 93-139 - [c58]Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo:
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. ICALP (1) 2006: 608-618 - [c57]Haim Kaplan, Micha Sharir:
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. SODA 2006: 484-493 - [c56]Haim Kaplan, Yahav Nussbaum:
A Simpler Linear-Time Recognition of Circular-Arc Graphs. SWAT 2006: 41-52 - [c55]Haim Kaplan, Ely Porat, Nira Shafrir:
Finding the Position of the k-Mismatch and Approximate Tandem Repeats. SWAT 2006: 90-101 - [c54]Haim Kaplan, Yahav Nussbaum:
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. WG 2006: 289-300 - 2005
- [j34]Martin Charles Golumbic, Haim Kaplan, Elad Verbin:
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Discret. Math. 296(1): 25-41 (2005) - [j33]Haim Kaplan, Nira Shafrir:
The greedy algorithm for shortest superstrings. Inf. Process. Lett. 93(1): 13-17 (2005) - [j32]Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko:
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4): 602-626 (2005) - [j31]Haim Kaplan, Elad Verbin:
Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. 70(3): 321-341 (2005) - [j30]Edith Cohen, Eran Halperin, Haim Kaplan:
Performance aspects of distributed caches using TTL-based consistency. Theor. Comput. Sci. 331(1): 73-96 (2005) - [j29]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Corrigendum: a new, simpler linear-time dominators algorithm. ACM Trans. Program. Lang. Syst. 27(3): 383-387 (2005) - [c53]Serge Abiteboul, Bogdan Cautis, Amos Fiat, Haim Kaplan, Tova Milo:
Secure Exchange of Modifiable Data and Queries. BDA 2005 - [c52]Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu:
Guarding a terrain by two watchtowers. SCG 2005: 346-355 - [c51]Haim Kaplan, Eyal Kushilevitz, Yishay Mansour:
Learning with attribute costs. STOC 2005: 356-365 - [c50]Giora Alexandron, Haim Kaplan, Micha Sharir:
Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. WADS 2005: 269-281 - 2004
- [j28]Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke:
Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci. 69(3): 383-394 (2004) - [j27]Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. Theory Comput. Syst. 37(3): 441-456 (2004) - [j26]Edith Cohen, Haim Kaplan:
Balanced-Replication Algorithms for Distribution Trees. SIAM J. Comput. 34(1): 227-247 (2004) - [c49]Edith Cohen, Haim Kaplan:
Spatially-decaying aggregation over a network: model and algorithms. SIGMOD Conference 2004: 707-718 - [c48]Edith Cohen, Haim Kaplan:
Efficient estimation algorithms for neighborhood variance and other moments. SODA 2004: 157-166 - [r1]Haim Kaplan:
Persistent Data Structures. Handbook of Data Structures and Applications 2004 - 2003
- [j25]Edith Cohen, Amos Fiat, Haim Kaplan:
A case for associative peer to peer overlays. Comput. Commun. Rev. 33(1): 95-100 (2003) - [j24]Edith Cohen, Haim Kaplan:
Proactive caching of DNS records: addressing a performance bottleneck. Comput. Networks 41(6): 707-726 (2003) - [j23]Amos Fiat, Haim Kaplan:
Making data structures confluently persistent. J. Algorithms 48(1): 16-58 (2003) - [j22]Edith Cohen, Haim Kaplan, Uri Zwick:
Connection caching: model and algorithms. J. Comput. Syst. Sci. 67(1): 92-126 (2003) - [j21]Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour:
Predicting and bypassing end-to-end Internet service degradations. IEEE J. Sel. Areas Commun. 21(6): 961-978 (2003) - [j20]Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick:
Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. 32(5): 1338-1355 (2003) - [c47]Haim Kaplan, Elad Verbin:
Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. CPM 2003: 170-185 - [c46]Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko:
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003: 56-65 - [c45]Edith Cohen, Amos Fiat, Haim Kaplan:
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM 2003: 1261-1271 - [c44]Edith Cohen, Amos Fiat, Haim Kaplan:
Efficient sequences of trials. SODA 2003: 737-746 - [c43]Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke:
Optimal oblivious routing in polynomial time. STOC 2003: 383-388 - [c42]Haim Kaplan, Eyal Molad, Robert Endre Tarjan:
Dynamic rectangular intersection with priorities. STOC 2003: 639-648 - 2002
- [j19]Edith Cohen, Haim Kaplan:
Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica 32(3): 459-466 (2002) - [j18]Edith Cohen, Haim Kaplan:
Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica 33(3): 300-334 (2002) - [j17]Edith Cohen, Haim Kaplan, Uri Zwick:
Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33(4): 511-516 (2002) - [j16]Edith Cohen, Haim Kaplan:
Refreshment policies for Web content caches. Comput. Networks 38(6): 795-808 (2002) - [j15]Edith Cohen, Haim Kaplan:
Prefetching the means for document transfer: a new approach for reducing Web latency. Comput. Networks 39(4): 437-455 (2002) - [j14]Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt:
Restoration by path concatenation: fast recovery of MPLS paths. Distributed Comput. 15(4): 273-283 (2002) - [j13]Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern:
Scalable Secure Storage When Half the System Is Faulty. Inf. Comput. 174(2): 203-213 (2002) - [j12]Sanjeev Arora, Alan M. Frieze, Haim Kaplan:
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program. 92(1): 1-36 (2002) - [c41]Arye Barkan, Haim Kaplan:
Partial Alphabetic Trees. ESA 2002: 114-125 - [c40]Edith Cohen, Haim Kaplan:
Balanced-Replication Algorithms for Distribution Trees. ESA 2002: 297-309 - [c39]Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour:
Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop 2002: 307-320 - [c38]Edith Cohen, Haim Kaplan, Tova Milo:
Labeling Dynamic XML Trees. PODS 2002: 271-281 - [c37]Haim Kaplan, Nira Shafrir, Robert Endre Tarjan:
Union-find with deletions. SODA 2002: 19-28 - [c36]Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick:
Reachability and distance queries via 2-hop labels. SODA 2002: 937-946 - [c35]Haim Kaplan, Tova Milo, Ronen Shabo:
A comparison of labeling schemes for ancestor queries. SODA 2002: 954-963 - [c34]Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002: 258-264 - [c33]Haim Kaplan, Nira Shafrir, Robert Endre Tarjan:
Meldable heaps and boolean union-find. STOC 2002: 573-582 - [i1]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. CoRR cs.DS/0207061 (2002) - 2001
- [j11]Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan:
Unique Maximum Matching Algorithms. J. Algorithms 40(2): 159-183 (2001) - [c32]Edith Cohen, Eran Halperin, Haim Kaplan:
Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001: 744-756 - [c31]Edith Cohen, Haim Kaplan:
Refreshment Policies for Web Content Caches. INFOCOM 2001: 1398-1406 - [c30]Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt:
Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001: 43-52 - [c29]Edith Cohen, Haim Kaplan:
Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT 2001: 85-94 - [c28]Edith Cohen, Haim Kaplan:
Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM 2001: 41-53 - [c27]Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt:
Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001: 316-317 - [c26]Amos Fiat, Haim Kaplan:
Making data structures confluently persistent. SODA 2001: 537-546 - [c25]Serge Abiteboul, Haim Kaplan, Tova Milo:
Compact labeling schemes for ancestor queries. SODA 2001: 547-556 - [c24]Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis:
Faster kinetic heaps and their use in broadcast scheduling. SODA 2001: 836-844 - [c23]Edith Cohen, Haim Kaplan:
The Age Penalty and Its Effect on Cache Performance. USITS 2001: 73-84 - [c22]Edith Cohen, Haim Kaplan, Uri Zwick:
Competitive Analysis of the LRFU Paging Algorithm. WADS 2001: 148-154 - [c21]Haim Kaplan, Tova Milo:
Short and Simple Labels for Small Distances and Other Functions. WADS 2001: 246-257 - 2000
- [j10]Haim Kaplan, Chris Okasaki, Robert Endre Tarjan:
Simple Confluently Persistent Catenable Lists. SIAM J. Comput. 30(3): 965-977 (2000) - [c20]Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern:
Scalable Secure Storage when Half the System Is Faulty. ICALP 2000: 576-587 - [c19]Edith Cohen, Haim Kaplan:
Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM 2000: 854-863 - [c18]Edith Cohen, Haim Kaplan, Uri Zwick:
Connection caching under vaious models of communication. SPAA 2000: 54-63
1990 – 1999
- 1999
- [j9]Haim Kaplan, Ron Shamir:
Bounded Degree Interval Sandwich Problems. Algorithmica 24(2): 96-104 (1999) - [j8]Edith Cohen, Haim Kaplan, Jeffrey D. Oldham:
Managing TCP Connections Under Persistent HTTP. Comput. Networks 31(11-16): 1709-1723 (1999) - [j7]Haim Kaplan, Ron Shamir, Robert Endre Tarjan:
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. SIAM J. Comput. 28(5): 1906-1922 (1999) - [j6]Haim Kaplan, Ron Shamir, Robert Endre Tarjan:
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SIAM J. Comput. 29(3): 880-892 (1999) - [c17]Haim Kaplan, Mario Szegedy:
On-line Complexity of Monotone Set Systems. SODA 1999: 507-516 - [c16]Edith Cohen, Haim Kaplan:
LP-based Analysis of Greedy-dual-size. SODA 1999: 879-880 - [c15]Haim Kaplan, Martin Strauss, Mario Szegedy:
Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. SODA 1999: 935-936 - [c14]Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan:
Unique Maximum Matching Algorithms. STOC 1999: 70-78 - [c13]Edith Cohen, Haim Kaplan:
Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC 1999: 109-118 - [c12]Edith Cohen, Haim Kaplan, Uri Zwick:
Connection Caching. STOC 1999: 612-621 - 1998
- [j5]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
A New, Simpler Linear-Time Dominators Algorithm. ACM Trans. Program. Lang. Syst. 20(6): 1265-1296 (1998) - [c11]Martin Charles Golumbic, Haim Kaplan:
Cell Flipping in Permutation Diagrams. STACS 1998: 577-586 - [c10]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. STOC 1998: 279-288 - [c9]Haim Kaplan, Chris Okasaki, Robert Endre Tarjan:
Simple Confluently Persistent Catenable Lists (Extended Abstract). SWAT 1998: 119-130 - 1997
- [c8]Haim Kaplan, Ron Shamir, Robert Endre Tarjan:
Faster and simpler algorithm for sorting signed permutations by reversals. RECOMB 1997: 163 - [c7]Haim Kaplan, Ron Shamir, Robert Endre Tarjan:
Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SODA 1997: 344-351 - 1996
- [j4]Haim Kaplan, Ron Shamir:
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques. SIAM J. Comput. 25(3): 540-561 (1996) - [c6]Sanjeev Arora, Alan M. Frieze, Haim Kaplan:
A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. FOCS 1996: 21-30 - [c5]Haim Kaplan, Ron Shamir:
Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. ISTCS 1996: 195-201 - [c4]Haim Kaplan, Robert Endre Tarjan:
Purely Functional Representations of Catenable Sorted Lists. STOC 1996: 202-211 - 1995
- [j3]Martin Charles Golumbic, Haim Kaplan, Ron Shamir:
Graph Sandwich Problems. J. Algorithms 19(3): 449-473 (1995) - [j2]Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir:
Four Strikes Against Physical Mapping of DNA. J. Comput. Biol. 2(1): 139-152 (1995) - [c3]Haim Kaplan, Robert Endre Tarjan:
Persistent lists with catenation via recursive slow-down. STOC 1995: 93-102 - 1994
- [j1]Haim Kaplan, Ron Shamir:
The Domatic Number Problem on Some Perfect Graph Families. Inf. Process. Lett. 49(1): 51-56 (1994) - [c2]Haim Kaplan, Ron Shamir, Robert Endre Tarjan:
Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping. FOCS 1994: 780-791 - 1993
- [c1]Martin Charles Golumbic, Haim Kaplan, Ron Shamir:
Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG 1993: 57-69
Coauthor Index
[c193] [i108] [c176] [c167] [i85] [i82] [c156] [i63] [c141] [i52] [c120] [i41] [j84] [j83] [c109] [c108] [i32] [i27] [j74] [i26] [i24] [i21] [j64] [c94] [c91] [i17] [j59] [c86] [i16] [i15] [j55] [j54] [c83] [c80] [i12] [i8] [i7] [j51] [j49] [c77] [i6] [i5] [j44] [j41] [c70] [c69] [c68] [c67] [c61] [j30] [j28] [j26] [c49] [c48] [j25] [j24] [j22] [j21] [j20] [c45] [c44] [c43] [j19] [j18] [j17] [j16] [j15] [j14] [c40] [c39] [c38] [c36] [c32] [c31] [c30] [c29] [c28] [c27] [c23] [c22] [c19] [c18] [j8] [c16] [c13] [c12]
[c193] [c190] [i110] [i108] [i106] [c183] [c182] [i104] [i103] [j114] [j113] [c179] [c176] [c171] [i98] [i94] [c170] [c169] [c168] [c167] [c166] [i91] [i90] [i88] [i85] [i84] [i82] [c163] [c162] [c161] [c160] [c157] [c155] [c154] [c151] [i80] [i78] [i76] [i72] [c147] [c145] [i71] [i70] [i69] [i67] [i66] [i62] [i61] [i57] [j96] [j92] [j83] [c109] [i32] [c99] [c96] [i23] [c93] [i20] [c51] [j21] [c39]
[c192] [c186] [i100] [j111] [j110] [j109] [j106] [j105] [j104] [c159] [i79] [i75] [i74] [i73] [j101] [c150] [c149] [i68] [i65] [c139] [c138] [c137] [c133] [i60] [i54] [j94] [c129] [c128] [c124] [i53] [i49] [c122] [i48] [i45] [j90] [j89] [j87] [i42] [i40] [j85] [j82] [j81] [c111] [i35] [i33] [j79] [c107] [c104] [c103] [i29] [i28] [j76] [j75] [j72] [c101] [c98] [i25] [j69] [j67] [j66] [j65] [j63] [i19] [i18] [j61] [j60] [j58] [c90] [c89] [c88] [c87] [i14] [i13] [j57] [j53] [c82] [i10] [i9] [j50] [j48] [j45] [c76] [i4] [j43] [j39] [c74] [c72] [c65] [c62] [c57] [c50]
Robert E. Tarjan
aka: Robert Endre Tarjan
aka: Robert Endre Tarjan
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-15 01:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
