Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). - Martin Charles Golumbic; Haim Kaplan; Ron Shamir (WG, 1993)

Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping - Haim Kaplan; Ron Shamir; Robert Endre Tarjan (FOCS, 1994)

The Domatic Number Problem on Some Perfect Graph Families. - Haim Kaplan; Ron Shamir (Inf. Process. Lett., 1994)

Persistent lists with catenation via recursive slow-down. - Haim Kaplan; Robert Endre Tarjan (STOC, 1995)

Graph Sandwich Problems. - Martin Charles Golumbic; Haim Kaplan; Ron Shamir (J. Algorithms, 1995)

Four Strikes Against Physical Mapping of DNA. - Paul W. Goldberg; Martin Charles Golumbic; Haim Kaplan; Ron Shamir (J. Comput. Biol., 1995)

Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. - Haim Kaplan; Ron Shamir (ISTCS, 1996)

Purely Functional Representations of Catenable Sorted Lists. - Haim Kaplan; Robert Endre Tarjan (STOC, 1996)

Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques. - Haim Kaplan; Ron Shamir (SIAM J. Comput., 1996)

Cell Flipping in Permutation Diagrams. - Martin Charles Golumbic; Haim Kaplan (STACS, 1998)

Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. - Adam L. Buchsbaum; Haim Kaplan; Anne Rogers; Jeffery R. Westbrook (STOC, 1998)

Simple Confluently Persistent Catenable Lists (Extended Abstract). - Haim Kaplan; Chris Okasaki; Robert Endre Tarjan (SWAT, 1998)

A New, Simpler Linear-Time Dominators Algorithm. - Adam L. Buchsbaum; Haim Kaplan; Anne Rogers; Jeffery R. Westbrook (ACM Trans. Program. Lang. Syst., 1998)

LP-based Analysis of Greedy-dual-size. - Edith Cohen; Haim Kaplan (SODA, 1999)

On-line Complexity of Monotone Set Systems. - Haim Kaplan; Mario Szegedy (SODA, 1999)

Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. - Haim Kaplan; Martin Strauss 001; Mario Szegedy (SODA, 1999)

Connection Caching. - Edith Cohen; Haim Kaplan; Uri Zwick (STOC, 1999)

Bounded Degree Interval Sandwich Problems. - Haim Kaplan; Ron Shamir (Algorithmica, 1999)

Managing TCP Connections Under Persistent HTTP. - Edith Cohen; Haim Kaplan; Jeffrey D. Oldham (Comput. Networks, 1999)

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. - Haim Kaplan; Ron Shamir; Robert Endre Tarjan (SIAM J. Comput., 1999)

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. - Haim Kaplan; Ron Shamir; Robert Endre Tarjan (SIAM J. Comput., 1999)

Connection caching under vaious models of communication. - Edith Cohen; Haim Kaplan; Uri Zwick (SPAA, 2000)

Simple Confluently Persistent Catenable Lists. - Haim Kaplan; Chris Okasaki; Robert Endre Tarjan (SIAM J. Comput., 2000)

Aging through cascaded caches: performance issues in the distribution of web content. - Edith Cohen; Haim Kaplan (SIGCOMM, 2001)

Restoration path concatenation: fast recovery of MPLS paths. - Anat Bremler-Barr; Yehuda Afek; Haim Kaplan; Edith Cohen; Michael Merritt (SIGMETRICS/Performance, 2001)

Compact labeling schemes for ancestor queries. - Serge Abiteboul; Haim Kaplan; Tova Milo (SODA, 2001)

Faster kinetic heaps and their use in broadcast scheduling. - Haim Kaplan; Robert Endre Tarjan; Kostas Tsioutsiouliklis (SODA, 2001)

The Age Penalty and Its Effect on Cache Performance. - Edith Cohen; Haim Kaplan (USITS, 2001)

Short and Simple Labels for Small Distances and Other Functions. - Haim Kaplan; Tova Milo (WADS, 2001)

Unique Maximum Matching Algorithms. - Harold N. Gabow; Haim Kaplan; Robert Endre Tarjan (J. Algorithms, 2001)

A comparison of labeling schemes for ancestor queries. - Haim Kaplan; Tova Milo; Ronen Shabo (SODA, 2002)

Union-find with deletions. - Haim Kaplan; Nira Shafrir; Robert Endre Tarjan (SODA, 2002)

Nearest common ancestors: a survey and a new distributed algorithm. - Stephen Alstrup; Cyril Gavoille; Haim Kaplan; Theis Rauhe (SPAA, 2002)

Meldable heaps and boolean union-find. - Haim Kaplan; Nira Shafrir; Robert Endre Tarjan (STOC, 2002)

Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. - Edith Cohen; Haim Kaplan (Algorithmica, 2002)

Exploiting Regularities in Web Traffic Patterns for Cache Replacement. - Edith Cohen; Haim Kaplan (Algorithmica, 2002)

Competitive Analysis of the LRFU Paging Algorithm. - Edith Cohen; Haim Kaplan; Uri Zwick (Algorithmica, 2002)

Refreshment policies for Web content caches. - Edith Cohen; Haim Kaplan (Comput. Networks, 2002)

Prefetching the means for document transfer: a new approach for reducing Web latency. - Edith Cohen; Haim Kaplan (Comput. Networks, 2002)

Restoration by path concatenation: fast recovery of MPLS paths. - Yehuda Afek; Anat Bremler-Barr; Haim Kaplan; Edith Cohen; Michael Merritt (Distributed Comput., 2002)

Scalable Secure Storage When Half the System Is Faulty. - Noga Alon; Haim Kaplan; Michael Krivelevich; Dahlia Malkhi; Julien P. Stern (Inf. Comput., 2002)

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. - Sanjeev Arora; Alan M. Frieze; Haim Kaplan (Math. Program., 2002)

Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. - Haim Kaplan; Elad Verbin (CPM, 2003)

Efficient sequences of trials. - Edith Cohen; Amos Fiat; Haim Kaplan (SODA, 2003)

Dynamic rectangular intersection with priorities. - Haim Kaplan; Eyal Molad; Robert Endre Tarjan (STOC, 2003)

A case for associative peer to peer overlays. - Edith Cohen; Amos Fiat; Haim Kaplan (Comput. Commun. Rev., 2003)

Proactive caching of DNS records: addressing a performance bottleneck. - Edith Cohen; Haim Kaplan (Comput. Networks, 2003)

Making data structures confluently persistent. - Amos Fiat; Haim Kaplan (J. Algorithms, 2003)

Connection caching: model and algorithms. - Edith Cohen; Haim Kaplan; Uri Zwick (J. Comput. Syst. Sci., 2003)

Predicting and bypassing end-to-end Internet service degradations. - Anat Bremler-Barr; Edith Cohen; Haim Kaplan; Yishay Mansour (IEEE J. Sel. Areas Commun., 2003)

Reachability and Distance Queries via 2-Hop Labels. - Edith Cohen; Eran Halperin; Haim Kaplan; Uri Zwick (SIAM J. Comput., 2003)

Spatially-decaying aggregation over a network: model and algorithms. - Edith Cohen; Haim Kaplan (SIGMOD Conference, 2004)

Efficient estimation algorithms for neighborhood variance and other moments. - Edith Cohen; Haim Kaplan (SODA, 2004)

Optimal oblivious routing in polynomial time. - Yossi Azar; Edith Cohen; Amos Fiat; Haim Kaplan; Harald Räcke (J. Comput. Syst. Sci., 2004)

Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. - Stephen Alstrup; Cyril Gavoille; Haim Kaplan; Theis Rauhe (Theory Comput. Syst., 2004)

Balanced-Replication Algorithms for Distribution Trees. - Edith Cohen; Haim Kaplan (SIAM J. Comput., 2004)

Persistent Data Structures. - Haim Kaplan (Handbook of Data Structures and Applications, 2004)

Secure Exchange of Modifiable Data and Queries. - Serge Abiteboul; Bogdan Cautis; Amos Fiat; Haim Kaplan; Tova Milo (BDA, 2005)

Guarding a terrain by two watchtowers. - Pankaj K. Agarwal; Sergey Bereg; Ovidiu Daescu; Haim Kaplan; Simeon C. Ntafos; Binhai Zhu (SCG, 2005)

Learning with attribute costs. - Haim Kaplan; Eyal Kushilevitz; Yishay Mansour (STOC, 2005)

On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. - Martin Charles Golumbic; Haim Kaplan; Elad Verbin (Discret. Math., 2005)

The greedy algorithm for shortest superstrings. - Haim Kaplan; Nira Shafrir (Inf. Process. Lett., 2005)

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. - Haim Kaplan; Moshe Lewenstein; Nira Shafrir; Maxim Sviridenko (J. ACM, 2005)

Sorting signed permutations by reversals, revisited. - Haim Kaplan; Elad Verbin (J. Comput. Syst. Sci., 2005)

Performance aspects of distributed caches using TTL-based consistency. - Edith Cohen; Eran Halperin; Haim Kaplan (Theor. Comput. Sci., 2005)

Corrigendum: a new, simpler linear-time dominators algorithm. - Adam L. Buchsbaum; Haim Kaplan; Anne Rogers; Jeffery R. Westbrook (ACM Trans. Program. Lang. Syst., 2005)

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. - Andrew V. Goldberg; Haim Kaplan; Renato F. Werneck (ALENEX, 2006)

Colored intersection searching via sparse rectangular matrix multiplication. - Haim Kaplan; Micha Sharir; Elad Verbin (SCG, 2006)

Reach for A*: Shortest Path Algorithms with Preprocessing. - Andrew V. Goldberg; Haim Kaplan; Renato F. Werneck (The Shortest Path Problem, 2006)

On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. - Amos Fiat; Haim Kaplan; Meital Levy; Svetlana Olonetsky; Ronen Shabo (ICALP (1), 2006)

Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. - Haim Kaplan; Micha Sharir (SODA, 2006)

Finding the Position of the k-Mismatch and Approximate Tandem Repeats. - Haim Kaplan; Ely Porat; Nira Shafrir (SWAT, 2006)

The greedy algorithm for edit distance with moves. - Haim Kaplan; Nira Shafrir (Inf. Process. Lett., 2006)

Partial alphabetic trees. - Arye Barkan; Haim Kaplan (J. Algorithms, 2006)

Compact Labeling Scheme for Ancestor Queries. - Serge Abiteboul; Stephen Alstrup; Haim Kaplan; Tova Milo; Theis Rauhe (SIAM J. Comput., 2006)

Computing the volume of the union of cubes. - Pankaj K. Agarwal; Haim Kaplan; Micha Sharir (SCG, 2007)

Most Burrows-Wheeler Based Compressors Are Not Optimal. - Haim Kaplan; Elad Verbin (CPM, 2007)

Strong Price of Anarchy for Machine Load Balancing. - Amos Fiat; Haim Kaplan; Meital Levy; Svetlana Olonetsky (ICALP, 2007)

Algorithms and estimators for accurate summarization of internet traffic. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (Internet Measurement Conference, 2007)

Summarizing data using bottom-k sketches. - Edith Cohen; Haim Kaplan (PODC, 2007)

Sketching unaggregated data streams for subpopulation-size queries. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (PODS, 2007)

Bottom-k sketches: better and more efficient estimation of aggregates. - Edith Cohen; Haim Kaplan (SIGMETRICS, 2007)

Counting colors in boxes. - Haim Kaplan; Natan Rubin; Micha Sharir; Elad Verbin (SODA, 2007)

Better Landmarks Within Reach. - Andrew V. Goldberg; Haim Kaplan; Renato Fonseca F. Werneck (WEA, 2007)

Associative search in peer to peer networks: Harnessing latent semantics. - Edith Cohen; Amos Fiat; Haim Kaplan (Comput. Networks, 2007)

Kinetic and dynamic data structures for convex hulls and upper envelopes. - Giora Alexandron; Haim Kaplan; Micha Sharir (Comput. Geom., 2007)

Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. - Noga Alon; Haim Kaplan; Michael Krivelevich; Dahlia Malkhi; Julien P. Stern (Inf. Comput., 2007)

Spatially-decaying aggregation over a network. - Edith Cohen; Haim Kaplan (J. Comput. Syst. Sci., 2007)

Compact Labeling Scheme for XML Ancestor Queries. - Haim Kaplan; Tova Milo; Ronen Shabo (Theory Comput. Syst., 2007)

Online Conflict-Free Coloring for Intervals. - Ke Chen 006; Amos Fiat; Haim Kaplan; Meital Levy; Jirí Matousek 001; Elchanan Mossel; János Pach; Micha Sharir; Shakhar Smorodinsky; Uli Wagner 001; Emo Welzl (SIAM J. Comput., 2007)

A simpler analysis of Burrows-Wheeler-based compression. - Haim Kaplan; Shir Landau; Elad Verbin (Theor. Comput. Sci., 2007)

Path Minima in Incremental Unrooted Trees. - Haim Kaplan; Nira Shafrir (ESA, 2008)

Estimating Aggregates over Multiple Sets. - Edith Cohen; Haim Kaplan (ICDM, 2008)

Processing top-k queries from samples. - Edith Cohen; Nadav Grossaug; Haim Kaplan (Comput. Networks, 2008)

Sketch-Based Estimation of Subpopulation-Weight - Edith Cohen; Haim Kaplan (CoRR, 2008)

Variance optimal sampling based estimation of subset sums - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (CoRR, 2008)

Weak ε-nets and interval chains. - Noga Alon; Haim Kaplan; Gabriel Nivasch; Micha Sharir; Shakhar Smorodinsky (J. ACM, 2008)

Tighter estimation using bottom k sketches. - Edith Cohen; Haim Kaplan (Proc. VLDB Endow., 2008)

Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. - Adam L. Buchsbaum; Loukas Georgiadis; Haim Kaplan; Anne Rogers; Robert Endre Tarjan; Jeffery R. Westbrook (SIAM J. Comput., 2008)

Efficient Colored Orthogonal Range Counting. - Haim Kaplan; Natan Rubin; Micha Sharir; Elad Verbin (SIAM J. Comput., 2008)

Kinetic and dynamic data structures for closest pair and all nearest neighbors. - Pankaj K. Agarwal; Haim Kaplan; Micha Sharir (ACM Trans. Algorithms, 2008)

Thin heaps, thick heaps. - Haim Kaplan; Robert Endre Tarjan (ACM Trans. Algorithms, 2008)

Leveraging discarded samples for tighter estimation of multiple-set aggregates. - Edith Cohen; Haim Kaplan (SIGMETRICS/Performance, 2009)

Stream sampling for variance-optimal estimation of subset sums. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (SODA, 2009)

Line transversals of convex polyhedra in R3. - Haim Kaplan; Natan Rubin; Micha Sharir (SODA, 2009)

A simpler implementation and analysis of Chazelle's soft heaps. - Haim Kaplan; Uri Zwick (SODA, 2009)

Private coresets. - Dan Feldman; Amos Fiat; Haim Kaplan; Kobbi Nissim (STOC, 2009)

Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. - Haim Kaplan; Natan Rubin; Micha Sharir (Algorithmica, 2009)

Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. - Haim Kaplan; Yahav Nussbaum (Discret. Appl. Math., 2009)

Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (Proc. VLDB Endow., 2009)

Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. - Edith Cohen; Haim Kaplan; Subhabrata Sen (Proc. VLDB Endow., 2009)

Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. - Ke Chen 006; Haim Kaplan; Micha Sharir (ACM Trans. Algorithms, 2009)

Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. - Yoav Giyora; Haim Kaplan (ACM Trans. Algorithms, 2009)

Kinetic stable Delaunay graphs. - Pankaj K. Agarwal; Jie Gao 001; Leonidas J. Guibas; Haim Kaplan; Vladlen Koltun; Natan Rubin; Micha Sharir (SCG, 2010)

Envy-free makespan approximation: extended abstract. - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (EC, 2010)

Improved Recommendations via (More) Collaboration. - Rubi Boim; Haim Kaplan; Tova Milo; Ronitt Rubinfeld (WebDB, 2010)

Guarding a Terrain by Two Watchtowers. - Pankaj K. Agarwal; Sergey Bereg; Ovidiu Daescu; Haim Kaplan; Simeon C. Ntafos; Micha Sharir; Binhai Zhu (Algorithmica, 2010)

Truth and Envy in Capacitated Allocation Games - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (CoRR, 2010)

On the Interplay between Incentive Compatibility and Envy Freeness - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (CoRR, 2010)

On Lines and Joints. - Haim Kaplan; Micha Sharir; Eugenii Shustin (Discret. Comput. Geom., 2010)

Labeling Dynamic XML Trees. - Edith Cohen; Haim Kaplan; Tova Milo (SIAM J. Comput., 2010)

Line Transversals of Convex Polyhedra in R3. - Haim Kaplan; Natan Rubin; Micha Sharir (SIAM J. Comput., 2010)

Maximum Flows by Incremental Breadth-First Search. - Andrew V. Goldberg; Sagi Hed; Haim Kaplan; Robert Endre Tarjan; Renato Fonseca F. Werneck (ESA, 2011)

Get the most out of your sample: optimal unbiased estimators using partial information. - Edith Cohen; Haim Kaplan (PODS, 2011)

Non-price equilibria in markets of discrete goods. - Avinatan Hassidim; Haim Kaplan; Yishay Mansour; Noam Nisan (EC, 2011)

Minimum s-t cut in undirected planar graphs when the source and the sink are close. - Haim Kaplan; Yahav Nussbaum (STACS, 2011)

Truth, Envy, and Truthful Market Clearing Bundle Pricing. - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (WINE, 2011)

Maximum Flow in Directed Planar Graphs with Vertex Capacities. - Haim Kaplan; Yahav Nussbaum (Algorithmica, 2011)

A Simpler Linear-Time Recognition of Circular-Arc Graphs. - Haim Kaplan; Yahav Nussbaum (Algorithmica, 2011)

A kinetic triangulation scheme for moving points in the plane. - Haim Kaplan; Natan Rubin; Micha Sharir (Comput. Geom., 2011)

Finding the Maximal Empty Rectangle Containing a Query Point - Haim Kaplan; Micha Sharir (CoRR, 2011)

Foreword. - Marina Lipshteyn; Ross M. McConnell; Haim Kaplan; Vadim E. Levit (Discret. Appl. Math., 2011)

Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. - Haim Kaplan; Edgar Ramos; Micha Sharir (Discret. Comput. Geom., 2011)

The Overlay of Minimization Diagrams in a Randomized Incremental Construction. - Haim Kaplan; Edgar Ramos; Micha Sharir (Discret. Comput. Geom., 2011)

On lines, joints, and incidences in three dimensions. - György Elekes; Haim Kaplan; Micha Sharir (J. Comb. Theory A, 2011)

Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (SIAM J. Comput., 2011)

Optimal Cover of Points by Disks in a Simple Polygon. - Haim Kaplan; Matthew J. Katz; Gila Morgenstern; Micha Sharir (SIAM J. Comput., 2011)

Data structures for mergeable trees. - Loukas Georgiadis; Haim Kaplan; Nira Shafrir; Robert Endre Tarjan; Renato Fonseca F. Werneck (ACM Trans. Algorithms, 2011)

Finding the maximal empty disk containing a query point. - Haim Kaplan; Micha Sharir (SCG, 2012)

How to split a flow? - Tzvika Hartman; Avinatan Hassidim; Haim Kaplan; Danny Raz; Michal Segalov (INFOCOM, 2012)

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. - Haim Kaplan; Shay Mozes; Yahav Nussbaum; Micha Sharir (SODA, 2012)

CBTree: A Practical Concurrent Self-Adjusting Search Tree. - Yehuda Afek; Haim Kaplan; Boris Korenfeld; Adam Morrison 001; Robert Endre Tarjan (DISC, 2012)

The AND-OR Game: Equilibrium Characterization - (Working Paper). - Avinatan Hassidim; Haim Kaplan; Yishay Mansour; Noam Nisan (WINE, 2012)

How to Estimate Change from Samples - Edith Cohen; Haim Kaplan (CoRR, 2012)

A Case for Customizing Estimators: Coordinated Samples - Edith Cohen; Haim Kaplan (CoRR, 2012)

Unit Distances in Three Dimensions. - Haim Kaplan; Jirí Matousek 001; Zuzana Safernová; Micha Sharir (Comb. Probab. Comput., 2012)

Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. - Haim Kaplan; Jirí Matousek 001; Micha Sharir (Discret. Comput. Geom., 2012)

An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. - Pankaj K. Agarwal; Lars Arge; Haim Kaplan; Eyal Molad; Robert Endre Tarjan; Ke Yi 001 (SIAM J. Comput., 2012)

Envy-Free Makespan Approximation. - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (SIAM J. Comput., 2012)

Improved Bounds for Geometric Permutations. - Natan Rubin; Haim Kaplan; Micha Sharir (SIAM J. Comput., 2012)

What You Can Do with Coordinated Samples. - Edith Cohen; Haim Kaplan (APPROX-RANDOM, 2013)

Scheduling Subset Tests: One-Time, Continuous, and How They Relate. - Edith Cohen; Haim Kaplan; Yishay Mansour (APPROX-RANDOM, 2013)

Union of random minkowski sums and network vulnerability analysis. - Pankaj K. Agarwal; Haim Kaplan; Micha Sharir (SoCG, 2013)

On finding an optimal TCAM encoding scheme for packet classification. - Ori Rottenstreich; Isaac Keslassy; Avinatan Hassidim; Haim Kaplan; Ely Porat (INFOCOM, 2013)

Minimal Indices for Successor Search - (Extended Abstract). - Sarel Cohen; Amos Fiat; Moshik Hershcovitch; Haim Kaplan (MFCS, 2013)

Reporting neighbors in high-dimensional Euclidean spaces. - Dror Aiger; Haim Kaplan; Micha Sharir (SODA, 2013)

Joint Cache Partition and Job Assignment on Multi-core Processors. - Avinatan Hassidim; Haim Kaplan; Omry Tuval (WADS, 2013)

I/O Efficient Dynamic Data Structures for Longest Prefix Queries. - Moshe Hershcovitch; Haim Kaplan (Algorithmica, 2013)

The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques. - Rinat Ben Avraham; Omrit Filtser; Haim Kaplan; Matthew J. Katz; Micha Sharir (CoRR, 2013)

Minimal Indices for Successor Search. - Sarel Cohen; Amos Fiat; Moshe Hershcovitch; Haim Kaplan (CoRR, 2013)

A Labeling Approach to Incremental Cycle Detection. - Edith Cohen; Amos Fiat; Haim Kaplan; Liam Roditty (CoRR, 2013)

Min-Cost Flow Duality in Planar Networks. - Haim Kaplan; Yahav Nussbaum (CoRR, 2013)

Finding the largest Empty Disk containing a Query Point. - Haim Kaplan; Micha Sharir (Int. J. Comput. Geom. Appl., 2013)

Answering Planning Queries with the Crowd. - Haim Kaplan; Ilia Lotosh; Tova Milo; Slava Novgorodov (Proc. VLDB Endow., 2013)

Soft Heaps Simplified. - Haim Kaplan; Robert Endre Tarjan; Uri Zwick (SIAM J. Comput., 2013)

The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. - Rinat Ben Avraham; Omrit Filtser; Haim Kaplan; Matthew J. Katz; Micha Sharir (SoCG, 2014)

Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. - Thomas Dueholm Hansen; Haim Kaplan; Uri Zwick (SODA, 2014)

Epsilon-Nets for Halfspaces Revisited. - Sariel Har-Peled; Haim Kaplan; Micha Sharir; Shakhar Smorodinsky (CoRR, 2014)

Fibonacci Heaps Revisited. - Haim Kaplan; Robert Endre Tarjan; Uri Zwick (CoRR, 2014)

The CB tree: a practical concurrent self-adjusting search tree. - Yehuda Afek; Haim Kaplan; Boris Korenfeld; Adam Morrison 001; Robert Endre Tarjan (Distributed Comput., 2014)

Union of Random Minkowski Sums and Network Vulnerability Analysis. - Pankaj K. Agarwal; Sariel Har-Peled; Haim Kaplan; Micha Sharir (Discret. Comput. Geom., 2014)

Algorithms and estimators for summarization of unaggregated data streams. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (J. Comput. Syst. Sci., 2014)

Probe scheduling for efficient detection of silent failures. - Edith Cohen; Avinatan Hassidim; Haim Kaplan; Yishay Mansour; Danny Raz; Yoav Tzur (Perform. Evaluation, 2014)

Computing the Discrete Fréchet Distance in Subquadratic Time. - Pankaj K. Agarwal; Rinat Ben Avraham; Haim Kaplan; Micha Sharir (SIAM J. Comput., 2014)

Reporting Neighbors in High-Dimensional Euclidean Space. - Dror Aiger; Haim Kaplan; Micha Sharir (SIAM J. Comput., 2014)

Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. - Shiri Chechik; Edith Cohen; Haim Kaplan (APPROX-RANDOM, 2015)

Spanners and Reachability Oracles for Directed Transmission Graphs. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (SoCG, 2015)

The Temp Secretary Problem. - Amos Fiat; Ilia Gorelik; Haim Kaplan; Slava Novgorodov (ESA, 2015)

Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. - Andrew V. Goldberg; Sagi Hed; Haim Kaplan; Pushmeet Kohli; Robert Endre Tarjan; Renato F. Werneck (ESA, 2015)

On the Complexity of Hub Labeling (Extended Abstract). - Maxim A. Babenko; Andrew V. Goldberg; Haim Kaplan; Ruslan Savchenko; Mathias Weller (MFCS (2), 2015)

The amortized cost of finding the minimum. - Haim Kaplan; Or Zamir; Uri Zwick (SODA, 2015)

Minimum Cost Flows in Graphs with Unit Capacities. - Andrew V. Goldberg; Haim Kaplan; Sagi Hed; Robert Endre Tarjan (STACS, 2015)

A faster algorithm for the discrete Fréchet distance under translation. - Rinat Ben Avraham; Haim Kaplan; Micha Sharir (CoRR, 2015)

On the Complexity of Hub Labeling. - Maxim A. Babenko; Andrew V. Goldberg; Haim Kaplan; Ruslan Savchenko; Mathias Weller (CoRR, 2015)

Stable Delaunay Graphs. - Pankaj K. Agarwal; Jie Gao 001; Leonidas J. Guibas; Haim Kaplan; Natan Rubin; Micha Sharir (Discret. Comput. Geom., 2015)

Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. - Pankaj K. Agarwal; Haim Kaplan; Natan Rubin; Micha Sharir (Discret. Comput. Geom., 2015)

Minimal indices for predecessor search. - Sarel Cohen; Amos Fiat; Moshik Hershcovitch; Haim Kaplan (Inf. Comput., 2015)

The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. - Rinat Ben Avraham; Omrit Filtser; Haim Kaplan; Matthew J. Katz; Micha Sharir (ACM Trans. Algorithms, 2015)

Approximating the k-Level in Three-Dimensional Plane Arrangements. - Sariel Har-Peled; Haim Kaplan; Micha Sharir (SODA, 2016)

Bottleneck Paths and Trees and Deterministic Graphical Games. - Shiri Chechik; Haim Kaplan; Mikkel Thorup; Or Zamir; Uri Zwick (STACS, 2016)

Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays. - Yossi Azar; Ashish Chiplunkar; Haim Kaplan (CoRR, 2016)

Approximating the $k$-Level in Three-Dimensional Plane Arrangements. - Sariel Har-Peled; Haim Kaplan; Micha Sharir (CoRR, 2016)

The AND-OR Game. - Avinatan Hassidim; Haim Kaplan; Yishay Mansour; Noam Nisan (ACM Trans. Economics and Comput., 2016)

Optimal In/Out TCAM Encodings of Ranges. - Ori Rottenstreich; Isaac Keslassy; Avinatan Hassidim; Haim Kaplan; Ely Porat (IEEE/ACM Trans. Netw., 2016)

Min-Cost Bipartite Perfect Matching with Delays. - Itai Ashlagi; Yossi Azar; Moses Charikar; Ashish Chiplunkar; Ofir Geri; Haim Kaplan; Rahul Makhijani; Yuyi Wang 001; Roger Wattenhofer (APPROX-RANDOM, 2017)

Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. - Yossi Azar; Ashish Chiplunkar; Haim Kaplan (SODA, 2017)

(1 + ∊)-Approximate f-Sensitive Distance Oracles. - Shiri Chechik; Sarel Cohen; Amos Fiat; Haim Kaplan (SODA, 2017)

Clustering over Multi-Objective Samples: The one2all Sample. - Edith Cohen; Shiri Chechik; Haim Kaplan (CoRR, 2017)

Upward Max-Min Fairness. - Emilie Danna; Avinatan Hassidim; Haim Kaplan; Alok Kumar; Yishay Mansour; Danny Raz; Michal Segalov (J. ACM, 2017)

Minimum-Cost Flows in Unit-Capacity Networks. - Andrew V. Goldberg; Sagi Hed; Haim Kaplan; Robert E. Tarjan (Theory Comput. Syst., 2017)

Hollow Heaps. - Thomas Dueholm Hansen; Haim Kaplan; Robert E. Tarjan; Uri Zwick (ACM Trans. Algorithms, 2017)

Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. - Haim Kaplan; Shay Mozes; Yahav Nussbaum; Micha Sharir (ACM Trans. Algorithms, 2017)

Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. - Edith Cohen; Shiri Chechik; Haim Kaplan (AAAI, 2018)

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. - Dani Dorfman; Haim Kaplan; László Kozma 002; Seth Pettie; Uri Zwick (ESA, 2018)

Approximate Minimum-Weight Matching with Outliers Under Translation. - Pankaj K. Agarwal; Haim Kaplan; Geva Kipper; Wolfgang Mulzer; Günter Rote; Micha Sharir; Allen Xiao (ISAAC, 2018)

Pairing heaps: the forward variant. - Dani Dorfman; Haim Kaplan; László Kozma 002; Uri Zwick (MFCS, 2018)

Differentially Private k-Means with Constant Multiplicative Error. - Uri Stemmer; Haim Kaplan (NeurIPS, 2018)

Prophet Secretary: Surpassing the 1-1/e Barrier. - Yossi Azar; Ashish Chiplunkar; Haim Kaplan (EC, 2018)

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. - Pawel Gawrychowski; Haim Kaplan; Shay Mozes; Micha Sharir; Oren Weimann (SODA, 2018)

Accurate Traffic Splitting on Commodity Switches. - Ori Rottenstreich; Yossi Kanizo; Haim Kaplan; Jennifer Rexford (SPAA, 2018)

Routing in Unit Disk Graphs. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (Algorithmica, 2018)

Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. - Haim Kaplan; Shay Solomon (CoRR, 2018)

Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies. - Tom Zahavy; Avinatan Hassidim; Haim Kaplan; Yishay Mansour (CoRR, 2018)

Accurate Traffic Splitting on SDN Switches. - Ori Rottenstreich; Yossi Kanizo; Haim Kaplan; Jennifer Rexford (IEEE J. Sel. Areas Commun., 2018)

Spanners for Directed Transmission Graphs. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (SIAM J. Comput., 2018)

General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. - Dror Aiger; Haim Kaplan; Efi Kokiopoulou; Micha Sharir; Bernhard Zeisl (SoCG, 2019)

Triangles and Girth in Disk Graphs and Transmission Graphs. - Haim Kaplan; Katharina Klost; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir (ESA, 2019)

A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. - Dani Dorfman; Haim Kaplan; Uri Zwick (ICALP, 2019)

Learning to Screen. - Alon Cohen; Avinatan Hassidim; Haim Kaplan; Yishay Mansour; Shay Moran (NeurIPS, 2019)

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. - Haim Kaplan; László Kozma 002; Or Zamir; Uri Zwick (SOSA, 2019)

A sort of an adversary. - Haim Kaplan; Or Zamir; Uri Zwick (SODA, 2019)

Faster k-SAT algorithms using biased-PPSZ. - Thomas Dueholm Hansen; Haim Kaplan; Or Zamir; Uri Zwick (STOC, 2019)

Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. - Haim Kaplan; Sasanka Roy; Micha Sharir (Comput. Geom., 2019)

Learning and Generalization for Matching Problems. - Alon Cohen; Avinatan Hassidim; Haim Kaplan; Yishay Mansour; Shay Moran (CoRR, 2019)

Average reward reinforcement learning with unknown mixing times. - Tom Zahavy; Alon Cohen; Haim Kaplan; Yishay Mansour (CoRR, 2019)

Influence Maximization with Few Simulations. - Gal Sadeh; Edith Cohen; Haim Kaplan (CoRR, 2019)

Adjacency Labeling Schemes and Induced-Universal Graphs. - Stephen Alstrup; Haim Kaplan; Mikkel Thorup; Uri Zwick (SIAM J. Discret. Math., 2019)

Apprenticeship Learning via Frank-Wolfe. - Tom Zahavy; Alon Cohen; Haim Kaplan; Yishay Mansour (AAAI, 2020)

Thompson Sampling for Adversarial Bit Prediction. - Yuval Lewi; Haim Kaplan; Yishay Mansour (ALT, 2020)

Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. - Tom Zahavy; Avinatan Hassidim; Haim Kaplan; Yishay Mansour (ALT, 2020)

Privately Learning Thresholds: Closing the Exponential Gap. - Haim Kaplan; Katrina Ligett; Yishay Mansour; Moni Naor; Uri Stemmer (COLT, 2020)

How to Find a Point in the Convex Hull Privately. - Haim Kaplan; Micha Sharir; Uri Stemmer (SoCG, 2020)

Optimal approximations for traffic distribution in bounded switch memories. - Yaniv Sadeh; Ori Rottenstreich; Haim Kaplan (CoNEXT, 2020)

Near-optimal Regret Bounds for Stochastic Shortest Path. - Aviv Rosenberg 002; Alon Cohen; Yishay Mansour; Haim Kaplan (ICML, 2020)

Sample Complexity Bounds for Influence Maximization. - Gal Sadeh; Edith Cohen; Haim Kaplan (ITCS, 2020)

Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. - Haim Kaplan; Yishay Mansour; Uri Stemmer; Eliad Tsfadia (NeurIPS, 2020)

Competitive Analysis with a Sample and the Secretary Problem. - Haim Kaplan; David Naori; Danny Raz (SODA, 2020)

Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations. - Haim Kaplan; Jay Tenenbaum (SWAT, 2020)

Unknown mixing times in apprenticeship and reinforcement learning. - Tom Zahavy; Alon Cohen; Haim Kaplan; Yishay Mansour (UAI, 2020)

Reachability Oracles for Directed Transmission Graphs. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (Algorithmica, 2020)

Output sensitive algorithms for approximate incidences and their applications. - Dror Aiger; Haim Kaplan; Micha Sharir (Comput. Geom., 2020)

On Radial Isotropic Position: Theory and Algorithms. - Shiri Artstein-Avidan; Haim Kaplan; Micha Sharir (CoRR, 2020)

Duality-based approximation algorithms for depth queries and maximum depth. - Dror Aiger; Haim Kaplan; Micha Sharir (CoRR, 2020)

Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. - Esther Ezra; Sariel Har-Peled; Haim Kaplan; Micha Sharir (Discret. Comput. Geom., 2020)

Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir (Discret. Comput. Geom., 2020)

Clustering in Hypergraphs to Minimize Average Edge Service Time. - Ori Rottenstreich; Haim Kaplan; Avinatan Hassidim (ACM Trans. Algorithms, 2020)

Optimal Representations of a Traffic Distribution in Switch Memories. - Yaniv Sadeh; Ori Rottenstreich; Arye Barkan; Yossi Kanizo; Haim Kaplan (IEEE/ACM Trans. Netw., 2020)

Online Markov Decision Processes with Aggregate Bandit Feedback. - Alon Cohen; Haim Kaplan; Tomer Koren; Yishay Mansour (COLT, 2021)

The Sparse Vector Technique, Revisited. - Haim Kaplan; Yishay Mansour; Uri Stemmer (COLT, 2021)

Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model. - Haim Kaplan; Yishay Mansour; Kobbi Nissim; Uri Stemmer (CRYPTO (3), 2021)

Differentially-Private Clustering of Easy Instances. - Edith Cohen; Haim Kaplan; Yishay Mansour; Uri Stemmer; Eliad Tsfadia (ICML, 2021)

Differentially Private Multi-Armed Bandits in the Shuffle Model. - Jay Tenenbaum; Haim Kaplan; Yishay Mansour; Uri Stemmer (NeurIPS, 2021)

How Much TCAM do we Need for Splitting Traffic? - Yaniv Sadeh; Ori Rottenstreich; Haim Kaplan (SOSR, 2021)

Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. - Haim Kaplan; Jay Tenenbaum (STACS, 2021)

Separating Adaptive Streaming from Oblivious Streaming. - Haim Kaplan; Yishay Mansour; Kobbi Nissim; Uri Stemmer (CoRR, 2021)

Online Weighted Bipartite Matching with a Sample. - Haim Kaplan; David Naori; Danny Raz (CoRR, 2021)

A Note on Sanitizing Streams with Differential Privacy. - Haim Kaplan; Uri Stemmer (CoRR, 2021)

Union of Hypercubes and 3D Minkowski Sums with Random Sizes. - Pankaj K. Agarwal; Haim Kaplan; Micha Sharir (Discret. Comput. Geom., 2021)

Stabbing pairwise intersecting disks by five points. - Sariel Har-Peled; Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir; Max Willert (Discret. Math., 2021)

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. - Pawel Gawrychowski; Haim Kaplan; Shay Mozes; Micha Sharir; Oren Weimann (SIAM J. Comput., 2021)

Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach. - Haim Kaplan; Shay Solomon (ACM Trans. Parallel Comput., 2021)

Monotone Learning. - Olivier Bousquet; Amit Daniely; Haim Kaplan; Yishay Mansour; Shay Moran; Uri Stemmer (COLT, 2022)

Dynamic Connectivity in Disk Graphs. - Haim Kaplan; Alexander Kauer; Katharina Klost; Kristin Knorr; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (SoCG, 2022)

Differentially Private Approximate Quantiles. - Haim Kaplan; Shachar Schnapp; Uri Stemmer (ICML, 2022)

FriendlyCore: Practical Differentially Private Aggregation. - Eliad Tsfadia; Edith Cohen; Haim Kaplan; Yishay Mansour; Uri Stemmer (ICML, 2022)

Minimal Total Deviation in TCAM Load Balancing. - Yaniv Sadeh; Ori Rottenstreich; Haim Kaplan (INFOCOM, 2022)

Coding Size of Traffic Partition in Switch Memories. - Yaniv Sadeh; Ori Rottenstreich; Haim Kaplan (ISIT, 2022)

Online Weighted Matching with a Sample. - Haim Kaplan; David Naori; Danny Raz (SODA, 2022)

Simulating a stack using queues. - Haim Kaplan; Robert E. Tarjan; Or Zamir; Uri Zwick (SODA, 2022)

Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. - Amos Beimel; Haim Kaplan; Yishay Mansour; Kobbi Nissim; Thatchaphol Saranurak; Uri Stemmer (STOC, 2022)

Differentially-Private Bayes Consistency. - Olivier Bousquet; Haim Kaplan; Aryeh Kontorovich; Yishay Mansour; Shay Moran; Menachem Sadigurschi; Uri Stemmer (CoRR, 2022)

Codes for Load Balancing in TCAMs: Size Analysis. - Yaniv Sadeh; Ori Rottenstreich; Haim Kaplan (CoRR, 2022)

Adversarially Robust Streaming Algorithms via Differential Privacy. - Avinatan Hassidim; Haim Kaplan; Yishay Mansour; Yossi Matias; Uri Stemmer (J. ACM, 2022)

Differentially Private Learning of Geometric Concepts. - Haim Kaplan; Yishay Mansour; Yossi Matias; Uri Stemmer (SIAM J. Comput., 2022)

Optimal Weighted Load Balancing in TCAMs. - Yaniv Sadeh; Ori Rottenstreich; Haim Kaplan (IEEE/ACM Trans. Netw., 2022)

Optimal Energetic Paths for Electric Cars. - Dani Dorfman; Haim Kaplan; Robert E. Tarjan; Uri Zwick (ESA, 2023)

The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. - Haim Kaplan; Matthew J. Katz; Rachel Saban; Micha Sharir (ESA, 2023)

Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. - Daniel Agassy; Dani Dorfman; Haim Kaplan (ICALP, 2023)

Fast Approximation of Search Trees on Trees with Centroid Trees. - Benjamin Aram Berendsohn; Ishay Golinsky; Haim Kaplan; László Kozma 002 (ICALP, 2023)

Concurrent Shuffle Differential Privacy Under Continual Observation. - Jay Tenenbaum; Haim Kaplan; Yishay Mansour; Uri Stemmer (ICML, 2023)

Black-Box Differential Privacy for Interactive ML. - Haim Kaplan; Yishay Mansour; Shay Moran; Kobbi Nissim; Uri Stemmer (NeurIPS, 2023)

Almost Tight Bounds for Online Facility Location in the Random-Order Model. - Haim Kaplan; David Naori; Danny Raz (SODA, 2023)

Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. - Yaniv Sadeh; Haim Kaplan (STACS, 2023)

On Differentially Private Online Predictions. - Haim Kaplan; Yishay Mansour; Shay Moran; Kobbi Nissim; Uri Stemmer (CoRR, 2023)

Load Balancing With Minimal Deviation in Switch Memories. - Yaniv Sadeh; Ori Rottenstreich; Haim Kaplan (IEEE Trans. Netw. Serv. Manag., 2023)

Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. - Pankaj K. Agarwal; Haim Kaplan; Matthew J. Katz; Micha Sharir (ESA, 2024)

Caching Connections in Matchings. - Yaniv Sadeh; Haim Kaplan (ICALP, 2024)

Learning-Augmented Algorithms with Explicit Predictors. - Marek Eliás 001; Haim Kaplan; Yishay Mansour; Shay Moran (NeurIPS, 2024)

Minimum-cost paths for electric cars. - Dani Dorfman; Haim Kaplan; Robert E. Tarjan; Mikkel Thorup; Uri Zwick (SOSA, 2024)

Insertion-Only Dynamic Connectivity in General Disk Graphs. - Haim Kaplan; Katharina Klost; Kristin Knorr; Wolfgang Mulzer; Liam Roditty (SOSA, 2024)

When Can Transformers Count to n? - Gilad Yehudai; Haim Kaplan; Asma Ghandeharioun; Mor Geva; Amir Globerson (CoRR, 2024)

Dynamic Connectivity in Disk Graphs. - Alexander Baumann; Haim Kaplan; Katharina Klost; Kristin Knorr; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (Discret. Comput. Geom., 2024)

Faster All-Pairs Optimal Electric Car Routing. - Dani Dorfman; Haim Kaplan; Robert E. Tarjan; Mikkel Thorup; Uri Zwick (ICALP, 2025)

Minimizing Recourse in an Adaptive Balls and Bins Game. - Adi Fine; Haim Kaplan; Uri Stemmer (ICALP, 2025)

Data Reconstruction: When You See It and When You Don't. - Edith Cohen; Haim Kaplan; Yishay Mansour; Shay Moran; Kobbi Nissim; Uri Stemmer; Eliad Tsfadia (ITCS, 2025)

On Differentially Private Linear Algebra. - Haim Kaplan; Yishay Mansour; Shay Moran; Uri Stemmer; Nitzan Tur (STOC, 2025)

Search Trees on Trees via LP. - Yaniv Sadeh; Haim Kaplan; Uri Zwick (CoRR, 2025)

Nearly Optimal Sample Complexity for Learning with Label Proportions. - Róbert Busa-Fekete; Travis Dick; Claudio Gentile; Haim Kaplan; Tomer Koren; Uri Stemmer (CoRR, 2025)

Bayesian Perspective on Memorization and Reconstruction. - Haim Kaplan; Yishay Mansour; Kobbi Nissim; Uri Stemmer (CoRR, 2025)