Haim Kaplan - RankMe

440 papers A* 109A 33B 22Journal 237Unranked 37

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Simpler Analysis for ϵ-Clairvoyant Flow Time Scheduling. CoRR Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2026	A	`conf`	Bayesian Perspective on Memorization and Reconstruction. ITCS Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer
2026	J	`jnl`	Beyond Vizing Chains: Improved Recourse in Dynamic Edge Coloring. CoRR Yaniv Sadeh, Haim Kaplan
2025	A	`ed.`	33rd Annual European Symposium on Algorithms, ESA 2025, Warsaw, Poland, September 15-17, 2025 ESA Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman
2025	A*	`conf`	A Little Clairvoyance Is All You Need. FOCS Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2025	J	`jnl`	A Little Clairvoyance Is All You Need. CoRR Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2025	J	`jnl`	Aggregating maximal cliques in real-world graphs. CoRR Noga Alon, Sabyasachi Basu, Shweta Jain, Haim Kaplan, Jakub Lacki, Blair D. Sullivan
2025	J	`jnl`	Bayesian Perspective on Memorization and Reconstruction. CoRR Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer
2025	J	`jnl`	Competitive Analysis with a Sample and the Secretary Problem. SIAM J. Comput. Haim Kaplan, David Naori, Danny Raz
2025	A	`conf`	Data Reconstruction: When You See It and When You Don't. ITCS Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
2025	J	`jnl`	Expander Decomposition for Non-Uniform Vertex Measures. CoRR Daniel Agassy, Dani Dorfman, Haim Kaplan
2025	J	`jnl`	Fast Inference via Hierarchical Speculative Decoding. CoRR Clara Mohri, Haim Kaplan, Tal Schuster, Yishay Mansour, Amir Globerson
2025	A*	`conf`	Faster All-Pairs Optimal Electric Car Routing. ICALP Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2025	J	`jnl`	Faster All-Pairs Optimal Electric Car Routing. CoRR Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2025	J	`jnl`	Improved Tree Sparsifiers in Near-Linear Time. CoRR Daniel Agassy, Dani Dorfman, Haim Kaplan
2025	A*	`conf`	Minimizing Recourse in an Adaptive Balls and Bins Game. ICALP Adi Fine, Haim Kaplan, Uri Stemmer
2025	A*	`conf`	Nearly Optimal Sample Complexity for Learning with Label Proportions. ICML Róbert Istvan Busa-Fekete, Travis Dick, Claudio Gentile, Haim Kaplan, Tomer Koren, Uri Stemmer
2025	J	`jnl`	Nearly Optimal Sample Complexity for Learning with Label Proportions. CoRR Róbert Busa-Fekete, Travis Dick, Claudio Gentile, Haim Kaplan, Tomer Koren, Uri Stemmer
2025	A*	`conf`	On Differentially Private Linear Algebra. STOC Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer, Nitzan Tur
2025	J	`jnl`	Optimal Learning from Label Proportions with General Loss Functions. CoRR Lorne Applebaum, Travis Dick, Claudio Gentile, Haim Kaplan, Tomer Koren
2025	J	`jnl`	Search Trees on Trees via LP. CoRR Yaniv Sadeh, Haim Kaplan, Uri Zwick
2024	A*	`conf`	Caching Connections in Matchings. ICALP Yaniv Sadeh, Haim Kaplan
2024	J	`jnl`	Data Reconstruction: When You See It and When You Don't. CoRR Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
2024	J	`jnl`	Dynamic Connectivity in Disk Graphs. Discret. Comput. Geom. Alexander Baumann, Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2024	—	`conf`	Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty
2024	A*	`conf`	Learning-Augmented Algorithms with Explicit Predictors. NeurIPS Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran
2024	J	`jnl`	Learning-Augmented Algorithms with Explicit Predictors. CoRR Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran
2024	—	`conf`	Minimum-cost paths for electric cars. SOSA Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2024	J	`jnl`	Minimum-cost paths for electric cars. CoRR Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2024	J	`jnl`	On Differentially Private Linear Algebra. CoRR Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer, Nitzan Tur
2024	A	`conf`	Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. ESA Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir
2024	J	`jnl`	When Can Transformers Count to n? CoRR Gilad Yehudai, Haim Kaplan, Asma Ghandeharioun, Mor Geva, Amir Globerson
2023	A*	`conf`	Almost Tight Bounds for Online Facility Location in the Random-Order Model. SODA Haim Kaplan, David Naori, Danny Raz
2023	A*	`conf`	Black-Box Differential Privacy for Interactive ML. NeurIPS Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer
2023	J	`jnl`	Caching Connections in Matchings. CoRR Yaniv Sadeh, Haim Kaplan
2023	A*	`conf`	Concurrent Shuffle Differential Privacy Under Continual Observation. ICML Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer
2023	J	`jnl`	Concurrent Shuffle Differential Privacy Under Continual Observation. CoRR Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer
2023	A	`conf`	Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. STACS Yaniv Sadeh, Haim Kaplan
2023	J	`jnl`	Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. CoRR Yaniv Sadeh, Haim Kaplan
2023	A*	`conf`	Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. ICALP Daniel Agassy, Dani Dorfman, Haim Kaplan
2023	A*	`conf`	Fast Approximation of Search Trees on Trees with Centroid Trees. ICALP Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma
2023	J	`jnl`	Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty
2023	J	`jnl`	Load Balancing With Minimal Deviation in Switch Memories. IEEE Trans. Netw. Serv. Manag. Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
2023	J	`jnl`	On Differentially Private Online Predictions. CoRR Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer
2023	A	`conf`	Optimal Energetic Paths for Electric Cars. ESA Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2023	J	`jnl`	Optimal energetic paths for electric cars. CoRR Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2023	A	`conf`	The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. ESA Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir
2023	J	`jnl`	The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. CoRR Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir
2022	J	`jnl`	Adversarially Robust Streaming Algorithms via Differential Privacy. J. ACM Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
2022	J	`jnl`	Almost Tight Bounds for Online Facility Location in the Random-Order Model. CoRR Haim Kaplan, David Naori, Danny Raz
2022	J	`jnl`	Codes for Load Balancing in TCAMs: Size Analysis. CoRR Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
2022	B	`conf`	Coding Size of Traffic Partition in Switch Memories. ISIT Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
2022	A*	`conf`	Differentially Private Approximate Quantiles. ICML Haim Kaplan, Shachar Schnapp, Uri Stemmer
2022	J	`jnl`	Differentially Private Learning of Geometric Concepts. SIAM J. Comput. Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
2022	J	`jnl`	Differentially-Private Bayes Consistency. CoRR Olivier Bousquet, Haim Kaplan, Aryeh Kontorovich, Yishay Mansour, Shay Moran, Menachem Sadigurschi, Uri Stemmer
2022	A*	`conf`	Dynamic Connectivity in Disk Graphs. SoCG Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2022	A*	`conf`	Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
2022	J	`jnl`	Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. CoRR Daniel Agassy, Dani Dorfman, Haim Kaplan
2022	J	`jnl`	Fast approximation of search trees on trees with centroid trees. CoRR Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma
2022	A*	`conf`	FriendlyCore: Practical Differentially Private Aggregation. ICML Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer
2022	A*	`conf`	Minimal Total Deviation in TCAM Load Balancing. INFOCOM Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
2022	A*	`conf`	Monotone Learning. COLT Olivier Bousquet, Amit Daniely, Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer
2022	J	`jnl`	Monotone Learning. CoRR Olivier Bousquet, Amit Daniely, Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer
2022	A*	`conf`	Online Weighted Matching with a Sample. SODA Haim Kaplan, David Naori, Danny Raz
2022	J	`jnl`	Optimal Weighted Load Balancing in TCAMs. IEEE/ACM Trans. Netw. Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
2022	A*	`conf`	Simulating a stack using queues. SODA Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick
2021	J	`jnl`	A Note on Sanitizing Streams with Differential Privacy. CoRR Haim Kaplan, Uri Stemmer
2021	J	`jnl`	Differentially Private Approximate Quantiles. CoRR Haim Kaplan, Shachar Schnapp, Uri Stemmer
2021	A*	`conf`	Differentially Private Multi-Armed Bandits in the Shuffle Model. NeurIPS Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer
2021	J	`jnl`	Differentially Private Multi-Armed Bandits in the Shuffle Model. CoRR Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer
2021	A*	`conf`	Differentially-Private Clustering of Easy Instances. ICML Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2021	J	`jnl`	Differentially-Private Clustering of Easy Instances. CoRR Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2021	J	`jnl`	Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
2021	J	`jnl`	Dynamic Connectivity in Disk Graphs. CoRR Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2021	J	`jnl`	Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach. ACM Trans. Parallel Comput. Haim Kaplan, Shay Solomon
2021	J	`jnl`	FriendlyCore: Practical Differentially Private Aggregation. CoRR Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer
2021	—	`conf`	How Much TCAM do we Need for Splitting Traffic? SOSR Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
2021	A	`conf`	Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. STACS Haim Kaplan, Jay Tenenbaum
2021	J	`jnl`	Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. CoRR Haim Kaplan, Jay Tenenbaum
2021	A*	`conf`	Online Markov Decision Processes with Aggregate Bandit Feedback. COLT Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour
2021	J	`jnl`	Online Markov Decision Processes with Aggregate Bandit Feedback. CoRR Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour
2021	J	`jnl`	Online Weighted Bipartite Matching with a Sample. CoRR Haim Kaplan, David Naori, Danny Raz
2021	J	`jnl`	Optimal Weighted Load Balancing in TCAMs. CoRR Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
2021	—	`conf`	Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model. CRYPTO (3) Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer
2021	J	`jnl`	Separating Adaptive Streaming from Oblivious Streaming. CoRR Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer
2021	J	`jnl`	Stabbing pairwise intersecting disks by five points. Discret. Math. Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2021	A*	`conf`	The Sparse Vector Technique, Revisited. COLT Haim Kaplan, Yishay Mansour, Uri Stemmer
2021	J	`jnl`	Union of Hypercubes and 3D Minkowski Sums with Random Sizes. Discret. Comput. Geom. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2021	J	`jnl`	Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n SIAM J. Comput. Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2020	A*	`conf`	Adversarially Robust Streaming Algorithms via Differential Privacy. NeurIPS Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
2020	J	`jnl`	Adversarially Robust Streaming Algorithms via Differential Privacy. CoRR Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
2020	A*	`conf`	Apprenticeship Learning via Frank-Wolfe. AAAI Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour
2020	J	`jnl`	Clustering in Hypergraphs to Minimize Average Edge Service Time. ACM Trans. Algorithms Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim
2020	A*	`conf`	Competitive Analysis with a Sample and the Secretary Problem. SODA Haim Kaplan, David Naori, Danny Raz
2020	J	`jnl`	Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2020	J	`jnl`	Duality-based approximation algorithms for depth queries and maximum depth. CoRR Dror Aiger, Haim Kaplan, Micha Sharir
2020	J	`jnl`	Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2020	A*	`conf`	How to Find a Point in the Convex Hull Privately. SoCG Haim Kaplan, Micha Sharir, Uri Stemmer
2020	J	`jnl`	How to Find a Point in the Convex Hull Privately. CoRR Haim Kaplan, Micha Sharir, Uri Stemmer
2020	—	`conf`	Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations. SWAT Haim Kaplan, Jay Tenenbaum
2020	J	`jnl`	Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations. CoRR Haim Kaplan, Jay Tenenbaum
2020	A*	`conf`	Near-optimal Regret Bounds for Stochastic Shortest Path. ICML Aviv Rosenberg, Alon Cohen, Yishay Mansour, Haim Kaplan
2020	J	`jnl`	Near-optimal Regret Bounds for Stochastic Shortest Path. CoRR Alon Cohen, Haim Kaplan, Yishay Mansour, Aviv Rosenberg
2020	J	`jnl`	On Radial Isotropic Position: Theory and Algorithms. CoRR Shiri Artstein-Avidan, Haim Kaplan, Micha Sharir
2020	J	`jnl`	Optimal Representations of a Traffic Distribution in Switch Memories. IEEE/ACM Trans. Netw. Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan
2020	A	`conf`	Optimal approximations for traffic distribution in bounded switch memories. CoNEXT Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
2020	J	`jnl`	Output sensitive algorithms for approximate incidences and their applications. Comput. Geom. Dror Aiger, Haim Kaplan, Micha Sharir
2020	J	`jnl`	Output sensitive algorithms for approximate incidences and their applications. CoRR Dror Aiger, Haim Kaplan, Micha Sharir
2020	B	`conf`	Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. ALT Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour
2020	A*	`conf`	Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. NeurIPS Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2020	J	`jnl`	Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. CoRR Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2020	A*	`conf`	Privately Learning Thresholds: Closing the Exponential Gap. COLT Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer
2020	J	`jnl`	Reachability Oracles for Directed Transmission Graphs. Algorithmica Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2020	A	`conf`	Sample Complexity Bounds for Influence Maximization. ITCS Gal Sadeh, Edith Cohen, Haim Kaplan
2020	J	`jnl`	The Sparse Vector Technique, Revisited. CoRR Haim Kaplan, Yishay Mansour, Uri Stemmer
2020	B	`conf`	Thompson Sampling for Adversarial Bit Prediction. ALT Yuval Lewi, Haim Kaplan, Yishay Mansour
2020	A	`conf`	Unknown mixing times in apprenticeship and reinforcement learning. UAI Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour
2019	A*	`conf`	A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. ICALP Dani Dorfman, Haim Kaplan, Uri Zwick
2019	A*	`conf`	A sort of an adversary. SODA Haim Kaplan, Or Zamir, Uri Zwick
2019	J	`jnl`	Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2019	J	`jnl`	Apprenticeship Learning via Frank-Wolfe. CoRR Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour
2019	J	`jnl`	Average reward reinforcement learning with unknown mixing times. CoRR Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour
2019	J	`jnl`	Competitive Analysis with a Sample and the Secretary Problem. CoRR Haim Kaplan, David Naori, Danny Raz
2019	A*	`conf`	Differentially Private Learning of Geometric Concepts. ICML Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
2019	J	`jnl`	Differentially Private Learning of Geometric Concepts. CoRR Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
2019	A*	`conf`	Faster STOC Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick
2019	J	`jnl`	Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. Haim Kaplan, Sasanka Roy, Micha Sharir
2019	A*	`conf`	General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. SoCG Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl
2019	J	`jnl`	General techniques for approximate incidences and their application to the camera posing problem. CoRR Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl
2019	J	`jnl`	Influence Maximization with Few Simulations. CoRR Gal Sadeh, Edith Cohen, Haim Kaplan
2019	J	`jnl`	Learning and Generalization for Matching Problems. CoRR Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran
2019	A*	`conf`	Learning to Screen. NeurIPS Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran
2019	A*	`conf`	Optimal Representations of a Traffic Distribution in Switch Memories. INFOCOM Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan
2019	J	`jnl`	Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. CoRR Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour
2019	J	`jnl`	Privately Learning Thresholds: Closing the Exponential Gap. CoRR Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer
2019	—	`conf`	Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
2019	J	`jnl`	Thompson Sampling for Adversarial Bit Prediction. CoRR Yuval Lewi, Haim Kaplan, Yishay Mansour
2019	A	`conf`	Triangles and Girth in Disk Graphs and Transmission Graphs. ESA Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2019	J	`jnl`	Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2018	B	`conf`	Accurate Traffic Splitting on Commodity Switches. SPAA Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford
2018	J	`jnl`	Accurate Traffic Splitting on SDN Switches. IEEE J. Sel. Areas Commun. Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford
2018	B	`conf`	Approximate Minimum-Weight Matching with Outliers Under Translation. ISAAC Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao
2018	J	`jnl`	Approximate Minimum-Weight Matching with Outliers under Translation. CoRR Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao
2018	A*	`conf`	Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. AAAI Edith Cohen, Shiri Chechik, Haim Kaplan
2018	A*	`conf`	Differentially Private k-Means with Constant Multiplicative Error. NeurIPS Uri Stemmer, Haim Kaplan
2018	J	`jnl`	Differentially Private k-Means with Constant Multiplicative Error. CoRR Haim Kaplan, Uri Stemmer
2018	B	`conf`	Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. SPAA Haim Kaplan, Shay Solomon
2018	J	`jnl`	Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies. CoRR Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour
2018	A	`conf`	Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. ESA Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
2018	J	`jnl`	Improved bounds for multipass pairing heaps and path-balanced binary search trees. CoRR Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
2018	B	`conf`	Pairing heaps: the forward variant. MFCS Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
2018	A*	`conf`	Prophet Secretary: Surpassing the 1-1/e Barrier. EC Yossi Azar, Ashish Chiplunkar, Haim Kaplan
2018	J	`jnl`	Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. CoRR Haim Kaplan, Shay Solomon
2018	J	`jnl`	Routing in Unit Disk Graphs. Algorithmica Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2018	J	`jnl`	Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
2018	J	`jnl`	Spanners for Directed Transmission Graphs. SIAM J. Comput. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2018	B	`conf`	Stabbing Pairwise Intersecting Disks by Five Points. ISAAC Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2018	J	`jnl`	Stabbing pairwise intersecting disks by five points. CoRR Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2018	A*	`conf`	Union of Hypercubes and 3D Minkowski Sums with Random Sizes. ICALP Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2018	A*	`conf`	Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic SODA Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2017	A*	`conf`	(1 + ∊)-Approximate SODA Shiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan
2017	A	`conf`	Clustering in Hypergraphs to Minimize Average Edge Service Time. ESA Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim
2017	J	`jnl`	Clustering over Multi-Objective Samples: The one2all Sample. CoRR Edith Cohen, Shiri Chechik, Haim Kaplan
2017	J	`jnl`	Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2017	A*	`conf`	Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. SODA Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2017	A	`conf`	Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. ESA Haim Kaplan, Sasanka Roy, Micha Sharir
2017	J	`jnl`	Hollow Heaps. ACM Trans. Algorithms Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2017	—	`conf`	Min-Cost Bipartite Perfect Matching with Delays. APPROX-RANDOM Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul Makhijani, Yuyi Wang, Roger Wattenhofer
2017	J	`jnl`	Minimum-Cost Flows in Unit-Capacity Networks. Theory Comput. Syst. Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan
2017	A	`conf`	Output Sensitive Algorithms for Approximate Incidences and Their Applications. ESA Dror Aiger, Haim Kaplan, Micha Sharir
2017	J	`jnl`	Pairing heaps: the forward variant. CoRR Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
2017	A*	`conf`	Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. SODA Yossi Azar, Ashish Chiplunkar, Haim Kaplan
2017	J	`jnl`	Prophet Secretary: Surpassing the 1-1/e Barrier. CoRR Yossi Azar, Ashish Chiplunkar, Haim Kaplan
2017	J	`jnl`	Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Trans. Algorithms Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
2017	J	`jnl`	Upward Max-Min Fairness. J. ACM Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov
2017	J	`jnl`	Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n CoRR Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2016	A*	`conf`	Approximating the SODA Sariel Har-Peled, Haim Kaplan, Micha Sharir
2016	J	`jnl`	Approximating the $k$-Level in Three-Dimensional Plane Arrangements. CoRR Sariel Har-Peled, Haim Kaplan, Micha Sharir
2016	A	`conf`	Bottleneck Paths and Trees and Deterministic Graphical Games. STACS Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick
2016	J	`jnl`	Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. CoRR Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2016	J	`jnl`	Optimal In/Out TCAM Encodings of Ranges. IEEE/ACM Trans. Netw. Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat
2016	J	`jnl`	Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays. CoRR Yossi Azar, Ashish Chiplunkar, Haim Kaplan
2016	J	`jnl`	Reachability Oracles for Directed Transmission Graphs. CoRR Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2016	B	`conf`	Routing in Unit Disk Graphs. LATIN Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2016	J	`jnl`	Spanners for Directed Transmission Graphs. CoRR Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2016	J	`jnl`	The AND-OR Game. ACM Trans. Economics and Comput. Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2015	J	`jnl`	A faster algorithm for the discrete Fréchet distance under translation. CoRR Rinat Ben Avraham, Haim Kaplan, Micha Sharir
2015	A*	`conf`	Adjacency Labeling Schemes and Induced-Universal Graphs. STOC Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2015	—	`conf`	Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. APPROX-RANDOM Shiri Chechik, Edith Cohen, Haim Kaplan
2015	J	`jnl`	Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. CoRR Shiri Chechik, Edith Cohen, Haim Kaplan
2015	A	`conf`	Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. ESA Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck
2015	—	`conf`	Hollow Heaps. ICALP (1) Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick
2015	J	`jnl`	Hollow Heaps. CoRR Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
2015	J	`jnl`	Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. Discret. Comput. Geom. Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir
2015	J	`jnl`	Minimal indices for predecessor search. Inf. Comput. Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan
2015	A	`conf`	Minimum Cost Flows in Graphs with Unit Capacities. STACS Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan
2015	—	`conf`	On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
2015	J	`jnl`	On the Complexity of Hub Labeling. CoRR Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
2015	J	`jnl`	Routing in Unit Disk Graphs. CoRR Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2015	A*	`conf`	Spanners and Reachability Oracles for Directed Transmission Graphs. SoCG Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2015	J	`jnl`	Stable Delaunay Graphs. CoRR Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir
2015	J	`jnl`	Stable Delaunay Graphs. Discret. Comput. Geom. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir
2015	J	`jnl`	The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. ACM Trans. Algorithms Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir
2015	A	`conf`	The Temp Secretary Problem. ESA Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov
2015	J	`jnl`	The Temp Secretary Problem. CoRR Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov
2015	A*	`conf`	The amortized cost of finding the minimum. SODA Haim Kaplan, Or Zamir, Uri Zwick
2014	J	`jnl`	Adjacency labeling schemes and induced-universal graphs. CoRR Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2014	J	`jnl`	Algorithms and estimators for summarization of unaggregated data streams. J. Comput. Syst. Sci. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2014	J	`jnl`	Computing the Discrete Fréchet Distance in Subquadratic Time. SIAM J. Comput. Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir
2014	A*	`conf`	Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. SODA Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick
2014	J	`jnl`	Epsilon-Nets for Halfspaces Revisited. CoRR Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky
2014	J	`jnl`	Fibonacci Heaps Revisited. CoRR Haim Kaplan, Robert Endre Tarjan, Uri Zwick
2014	J	`jnl`	Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. CoRR Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir
2014	J	`jnl`	Probe scheduling for efficient detection of silent failures. Perform. Evaluation Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur
2014	J	`jnl`	Reporting Neighbors in High-Dimensional Euclidean Space. SIAM J. Comput. Dror Aiger, Haim Kaplan, Micha Sharir
2014	J	`jnl`	The CB tree: a practical concurrent self-adjusting search tree. Distributed Comput. Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan
2014	A*	`conf`	The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. SoCG Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir
2014	J	`jnl`	Union of Random Minkowski Sums and Network Vulnerability Analysis. Discret. Comput. Geom. Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2013	J	`jnl`	A Labeling Approach to Incremental Cycle Detection. CoRR Edith Cohen, Amos Fiat, Haim Kaplan, Liam Roditty
2013	J	`jnl`	Answering Planning Queries with the Crowd. Proc. VLDB Endow. Haim Kaplan, Ilia Lotosh, Tova Milo, Slava Novgorodov
2013	A*	`conf`	Computing the Discrete Fréchet Distance in Subquadratic Time. SODA Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir
2013	J	`jnl`	Finding the largest Empty Disk containing a Query Point. Int. J. Comput. Geom. Appl. Haim Kaplan, Micha Sharir
2013	J	`jnl`	I/O Efficient Dynamic Data Structures for Longest Prefix Queries. Algorithmica Moshe Hershcovitch, Haim Kaplan
2013	B	`conf`	Joint Cache Partition and Job Assignment on Multi-core Processors. WADS Avinatan Hassidim, Haim Kaplan, Omry Tuval
2013	J	`jnl`	Min-Cost Flow Duality in Planar Networks. CoRR Haim Kaplan, Yahav Nussbaum
2013	B	`conf`	Minimal Indices for Successor Search - (Extended Abstract). MFCS Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan
2013	J	`jnl`	Minimal Indices for Successor Search. CoRR Sarel Cohen, Amos Fiat, Moshe Hershcovitch, Haim Kaplan
2013	A*	`conf`	On finding an optimal TCAM encoding scheme for packet classification. INFOCOM Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat
2013	J	`jnl`	Probe Scheduling for Efficient Detection of Silent Failures CoRR Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur
2013	A*	`conf`	Reporting neighbors in high-dimensional Euclidean spaces. SODA Dror Aiger, Haim Kaplan, Micha Sharir
2013	—	`conf`	Scheduling Subset Tests: One-Time, Continuous, and How They Relate. APPROX-RANDOM Edith Cohen, Haim Kaplan, Yishay Mansour
2013	J	`jnl`	Soft Heaps Simplified. SIAM J. Comput. Haim Kaplan, Robert Endre Tarjan, Uri Zwick
2013	J	`jnl`	The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques. CoRR Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir
2013	J	`jnl`	Union of Random Minkowski Sums and Network Vulnerability Analysis. CoRR Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2013	A*	`conf`	Union of random minkowski sums and network vulnerability analysis. SoCG Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2013	—	`conf`	What You Can Do with Coordinated Samples. APPROX-RANDOM Edith Cohen, Haim Kaplan
2012	J	`jnl`	A Case for Customizing Estimators: Coordinated Samples CoRR Edith Cohen, Haim Kaplan
2012	J	`jnl`	An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. SIAM J. Comput. Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi
2012	A	`conf`	CBTree: A Practical Concurrent Self-Adjusting Search Tree. DISC Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan
2012	J	`jnl`	Computing the Discrete Fréchet Distance in Subquadratic Time CoRR Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir
2012	J	`jnl`	Envy-Free Makespan Approximation. SIAM J. Comput. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2012	—	`conf`	Finding the maximal empty disk containing a query point. SCG Haim Kaplan, Micha Sharir
2012	J	`jnl`	How to Estimate Change from Samples CoRR Edith Cohen, Haim Kaplan
2012	A*	`conf`	How to split a flow? INFOCOM Tzvika Hartman, Avinatan Hassidim, Haim Kaplan, Danny Raz, Michal Segalov
2012	J	`jnl`	Improved Bounds for Geometric Permutations. SIAM J. Comput. Natan Rubin, Haim Kaplan, Micha Sharir
2012	J	`jnl`	Joint Cache Partition and Job Assignment on Multi-Core Processors CoRR Avinatan Hassidim, Haim Kaplan, Omry Tuval
2012	J	`jnl`	Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Discret. Comput. Geom. Haim Kaplan, Jirí Matousek, Micha Sharir
2012	A*	`conf`	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. SODA Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
2012	—	`conf`	The AND-OR Game: Equilibrium Characterization - (Working Paper). WINE Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2012	J	`jnl`	The AND-OR game: Equilibrium Characterization (Working Paper) CoRR Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2012	J	`jnl`	Unit Distances in Three Dimensions. Comb. Probab. Comput. Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir
2012	A*	`conf`	Upward Max Min Fairness. INFOCOM Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov
2012	J	`jnl`	What you can do with Coordinated Samples CoRR Edith Cohen, Haim Kaplan
2011	J	`jnl`	A Simpler Linear-Time Recognition of Circular-Arc Graphs. Algorithmica Haim Kaplan, Yahav Nussbaum
2011	J	`jnl`	A kinetic triangulation scheme for moving points in the plane. Comput. Geom. Haim Kaplan, Natan Rubin, Micha Sharir
2011	J	`jnl`	Data structures for mergeable trees. ACM Trans. Algorithms Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
2011	J	`jnl`	Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. SIAM J. Comput. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2011	J	`jnl`	Finding the Maximal Empty Rectangle Containing a Query Point CoRR Haim Kaplan, Micha Sharir
2011	J	`jnl`	Foreword. Discret. Appl. Math. Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit
2011	J	`jnl`	Get the Most out of Your Sample: Optimal Unbiased Estimators using Partial Information CoRR Edith Cohen, Haim Kaplan
2011	A*	`conf`	Get the most out of your sample: optimal unbiased estimators using partial information. PODS Edith Cohen, Haim Kaplan
2011	J	`jnl`	Kinetic Stable Delaunay Graphs CoRR Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir
2011	J	`jnl`	Maximum Flow in Directed Planar Graphs with Vertex Capacities. Algorithmica Haim Kaplan, Yahav Nussbaum
2011	A	`conf`	Maximum Flows by Incremental Breadth-First Search. ESA Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck
2011	A	`conf`	Minimum s-t cut in undirected planar graphs when the source and the sink are close. STACS Haim Kaplan, Yahav Nussbaum
2011	J	`jnl`	Non-Price Equilibria in Markets of Discrete Goods CoRR Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2011	A*	`conf`	Non-price equilibria in markets of discrete goods. EC Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan
2011	J	`jnl`	On lines, joints, and incidences in three dimensions. J. Comb. Theory A György Elekes, Haim Kaplan, Micha Sharir
2011	J	`jnl`	Optimal Cover of Points by Disks in a Simple Polygon. SIAM J. Comput. Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir
2011	J	`jnl`	Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. Discret. Comput. Geom. Haim Kaplan, Edgar Ramos, Micha Sharir
2011	J	`jnl`	The Overlay of Minimization Diagrams in a Randomized Incremental Construction. Discret. Comput. Geom. Haim Kaplan, Edgar Ramos, Micha Sharir
2011	—	`conf`	Truth, Envy, and Truthful Market Clearing Bundle Pricing. WINE Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2010	J	`jnl`	A Kinetic Triangulation Scheme for Moving Points in The Plane CoRR Haim Kaplan, Natan Rubin, Micha Sharir
2010	—	`conf`	A kinetic triangulation scheme for moving points in the plane. SCG Haim Kaplan, Natan Rubin, Micha Sharir
2010	—	`ed.`	Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings SWAT Haim Kaplan
2010	A*	`conf`	Envy-free makespan approximation: extended abstract. EC Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2010	J	`jnl`	Guarding a Terrain by Two Watchtowers. Algorithmica Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu
2010	J	`jnl`	Improved Bounds for Geometric Permutations CoRR Natan Rubin, Haim Kaplan, Micha Sharir
2010	A*	`conf`	Improved Bounds for Geometric Permutations. FOCS Natan Rubin, Haim Kaplan, Micha Sharir
2010	—	`conf`	Improved Recommendations via (More) Collaboration. WebDB Rubi Boim, Haim Kaplan, Tova Milo, Ronitt Rubinfeld
2010	—	`conf`	Kinetic stable Delaunay graphs. SCG Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir
2010	J	`jnl`	Labeling Dynamic XML Trees. SIAM J. Comput. Edith Cohen, Haim Kaplan, Tova Milo
2010	J	`jnl`	Line Transversals of Convex Polyhedra in R SIAM J. Comput. Haim Kaplan, Natan Rubin, Micha Sharir
2010	J	`jnl`	On Lines and Joints. Discret. Comput. Geom. Haim Kaplan, Micha Sharir, Eugenii Shustin
2010	J	`jnl`	On the Interplay between Incentive Compatibility and Envy Freeness CoRR Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2010	—	`conf`	Optimal Cover of Points by Disks in a Simple Polygon. ESA (1) Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir
2010	J	`jnl`	Truth and Envy in Capacitated Allocation Games CoRR Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2009	A*	`conf`	A simpler implementation and analysis of Chazelle's soft heaps. SODA Haim Kaplan, Uri Zwick
2009	J	`jnl`	Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Discret. Appl. Math. Haim Kaplan, Yahav Nussbaum
2009	J	`jnl`	Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Proc. VLDB Endow. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2009	J	`jnl`	Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments CoRR Edith Cohen, Haim Kaplan, Subhabrata Sen
2009	J	`jnl`	Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. Proc. VLDB Endow. Edith Cohen, Haim Kaplan, Subhabrata Sen
2009	J	`jnl`	Envy-Free Makespan Approximation CoRR Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky
2009	J	`jnl`	Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates CoRR Edith Cohen, Haim Kaplan
2009	—	`conf`	Leveraging discarded samples for tighter estimation of multiple-set aggregates. SIGMETRICS/Performance Edith Cohen, Haim Kaplan
2009	A*	`conf`	Line transversals of convex polyhedra in SODA Haim Kaplan, Natan Rubin, Micha Sharir
2009	J	`jnl`	Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica Haim Kaplan, Natan Rubin, Micha Sharir
2009	J	`jnl`	Maximum Flow in Directed Planar Graphs with Vertex Capacities CoRR Haim Kaplan, Yahav Nussbaum
2009	A	`conf`	Maximum Flow in Directed Planar Graphs with Vertex Capacities. ESA Haim Kaplan, Yahav Nussbaum
2009	J	`jnl`	On Lines, Joints, and Incidences in Three Dimensions CoRR György Elekes, Haim Kaplan, Micha Sharir
2009	J	`jnl`	On lines and Joints CoRR Haim Kaplan, Micha Sharir, Eugenii Shustin
2009	J	`jnl`	Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Trans. Algorithms Ke Chen, Haim Kaplan, Micha Sharir
2009	J	`jnl`	Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Trans. Algorithms Yoav Giyora, Haim Kaplan
2009	A*	`conf`	Private coresets. STOC Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim
2009	A*	`conf`	Stream sampling for variance-optimal estimation of subset sums. SODA Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2008	J	`jnl`	Efficient Colored Orthogonal Range Counting. SIAM J. Comput. Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
2008	A*	`conf`	Estimating Aggregates over Multiple Sets. ICDM Edith Cohen, Haim Kaplan
2008	—	`conf`	I/O Efficient Dynamic Data Structures for Longest Prefix Queries. SWAT Moshe Hershcovitch, Haim Kaplan
2008	J	`jnl`	Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Trans. Algorithms Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2008	J	`jnl`	Line Transversals of Convex Polyhedra in R CoRR Haim Kaplan, Natan Rubin, Micha Sharir
2008	J	`jnl`	Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM J. Comput. Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery R. Westbrook
2008	A	`conf`	Path Minima in Incremental Unrooted Trees. ESA Haim Kaplan, Nira Shafrir
2008	J	`jnl`	Processing top-k queries from samples. Comput. Networks Edith Cohen, Nadav Grossaug, Haim Kaplan
2008	J	`jnl`	Sketch-Based Estimation of Subpopulation-Weight CoRR Edith Cohen, Haim Kaplan
2008	J	`jnl`	Thin heaps, thick heaps. ACM Trans. Algorithms Haim Kaplan, Robert Endre Tarjan
2008	J	`jnl`	Tighter estimation using bottom k sketches. Proc. VLDB Endow. Edith Cohen, Haim Kaplan
2008	J	`jnl`	Variance optimal sampling based estimation of subset sums CoRR Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2008	A*	`conf`	Weak ε-nets and interval chains. SODA Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky
2008	J	`jnl`	Weak ε-nets and interval chains. J. ACM Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky
2007	J	`jnl`	A simpler analysis of Burrows-Wheeler-based compression. Theor. Comput. Sci. Haim Kaplan, Shir Landau, Elad Verbin
2007	J	`jnl`	Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. Inf. Comput. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
2007	A	`conf`	Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Conference Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	J	`jnl`	Associative search in peer to peer networks: Harnessing latent semantics. Comput. Networks Edith Cohen, Amos Fiat, Haim Kaplan
2007	—	`conf`	Better Landmarks Within Reach. WEA Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck
2007	A*	`conf`	Bottom-k sketches: better and more efficient estimation of aggregates. SIGMETRICS Edith Cohen, Haim Kaplan
2007	J	`jnl`	Compact Labeling Scheme for XML Ancestor Queries. Theory Comput. Syst. Haim Kaplan, Tova Milo, Ronen Shabo
2007	—	`conf`	Computing the volume of the union of cubes. SCG Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2007	A*	`conf`	Counting colors in boxes. SODA Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
2007	J	`jnl`	Data Structures for Mergeable Trees CoRR Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
2007	J	`jnl`	Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. Giora Alexandron, Haim Kaplan, Micha Sharir
2007	A	`conf`	Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA Haim Kaplan, Natan Rubin, Micha Sharir
2007	B	`conf`	Most Burrows-Wheeler Based Compressors Are Not Optimal. CPM Haim Kaplan, Elad Verbin
2007	J	`jnl`	Online Conflict-Free Coloring for Intervals. SIAM J. Comput. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2007	A*	`conf`	Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. SODA Yoav Giyora, Haim Kaplan
2007	A*	`conf`	Sketching unaggregated data streams for subpopulation-size queries. PODS Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	J	`jnl`	Spatially-decaying aggregation over a network. J. Comput. Syst. Sci. Edith Cohen, Haim Kaplan
2007	—	`conf`	Strong Price of Anarchy for Machine Load Balancing. Fair Division Amos Fiat, Meital Levy, Haim Kaplan, Svetlana Olonetsky
2007	A*	`conf`	Strong Price of Anarchy for Machine Load Balancing. ICALP Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky
2007	A*	`conf`	Summarizing data using bottom-k sketches. PODC Edith Cohen, Haim Kaplan
2006	B	`conf`	A Simpler Analysis of Burrows-Wheeler Based Compression. CPM Haim Kaplan, Shir Landau, Elad Verbin
2006	—	`conf`	A Simpler Linear-Time Recognition of Circular-Arc Graphs. SWAT Haim Kaplan, Yahav Nussbaum
2006	B	`conf`	Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. WG Haim Kaplan, Yahav Nussbaum
2006	—	`conf`	Colored intersection searching via sparse rectangular matrix multiplication. SCG Haim Kaplan, Micha Sharir, Elad Verbin
2006	J	`jnl`	Compact Labeling Scheme for Ancestor Queries. SIAM J. Comput. Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe
2006	—	`conf`	Finding the Position of the SWAT Haim Kaplan, Ely Porat, Nira Shafrir
2006	—	`conf`	On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. ICALP (1) Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo
2006	J	`jnl`	Partial alphabetic trees. J. Algorithms Arye Barkan, Haim Kaplan
2006	A	`conf`	Processing top k queries from samples. CoNEXT Edith Cohen, Nadav Grossaug, Haim Kaplan
2006	A*	`conf`	Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. SODA Haim Kaplan, Micha Sharir
2006	A	`conf`	Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
2006	—	`conf`	Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
2006	J	`jnl`	The greedy algorithm for edit distance with moves. Inf. Process. Lett. Haim Kaplan, Nira Shafrir
2005	J	`jnl`	Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
2005	—	`conf`	Guarding a terrain by two watchtowers. SCG Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu
2005	B	`conf`	Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. WADS Giora Alexandron, Haim Kaplan, Micha Sharir
2005	A*	`conf`	Learning with attribute costs. STOC Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
2005	J	`jnl`	On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Discret. Math. Martin Charles Golumbic, Haim Kaplan, Elad Verbin
2005	J	`jnl`	Performance aspects of distributed caches using TTL-based consistency. Theor. Comput. Sci. Edith Cohen, Eran Halperin, Haim Kaplan
2005	—	`conf`	Secure Exchange of Modifiable Data and Queries. BDA Serge Abiteboul, Bogdan Cautis, Amos Fiat, Haim Kaplan, Tova Milo
2005	J	`jnl`	Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. Haim Kaplan, Elad Verbin
2005	J	`jnl`	The greedy algorithm for shortest superstrings. Inf. Process. Lett. Haim Kaplan, Nira Shafrir
2004	J	`jnl`	Balanced-Replication Algorithms for Distribution Trees. SIAM J. Comput. Edith Cohen, Haim Kaplan
2004	A*	`conf`	Efficient estimation algorithms for neighborhood variance and other moments. SODA Edith Cohen, Haim Kaplan
2004	J	`jnl`	Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. Theory Comput. Syst. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
2004	J	`jnl`	Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
2004	—	`ch.`	Persistent Data Structures. Handbook of Data Structures and Applications Haim Kaplan
2004	—	`conf`	Spatially-decaying aggregation over a network: model and algorithms. SIGMOD Conference Edith Cohen, Haim Kaplan
2003	J	`jnl`	A case for associative peer to peer overlays. Comput. Commun. Rev. Edith Cohen, Amos Fiat, Haim Kaplan
2003	A*	`conf`	Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
2003	A*	`conf`	Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM Edith Cohen, Amos Fiat, Haim Kaplan
2003	J	`jnl`	Connection caching: model and algorithms. J. Comput. Syst. Sci. Edith Cohen, Haim Kaplan, Uri Zwick
2003	A*	`conf`	Dynamic rectangular intersection with priorities. STOC Haim Kaplan, Eyal Molad, Robert Endre Tarjan
2003	B	`conf`	Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. CPM Haim Kaplan, Elad Verbin
2003	A*	`conf`	Efficient sequences of trials. SODA Edith Cohen, Amos Fiat, Haim Kaplan
2003	J	`jnl`	Making data structures confluently persistent. J. Algorithms Amos Fiat, Haim Kaplan
2003	A*	`conf`	Optimal oblivious routing in polynomial time. STOC Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
2003	J	`jnl`	Predicting and bypassing end-to-end Internet service degradations. IEEE J. Sel. Areas Commun. Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour
2003	J	`jnl`	Proactive caching of DNS records: addressing a performance bottleneck. Comput. Networks Edith Cohen, Haim Kaplan
2003	J	`jnl`	Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
2002	A*	`conf`	A comparison of labeling schemes for ancestor queries. SODA Haim Kaplan, Tova Milo, Ronen Shabo
2002	J	`jnl`	A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program. Sanjeev Arora, Alan M. Frieze, Haim Kaplan
2002	A	`conf`	Balanced-Replication Algorithms for Distribution Trees. ESA Edith Cohen, Haim Kaplan
2002	J	`jnl`	Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica Edith Cohen, Haim Kaplan
2002	J	`jnl`	Competitive Analysis of the LRFU Paging Algorithm. Algorithmica Edith Cohen, Haim Kaplan, Uri Zwick
2002	J	`jnl`	Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica Edith Cohen, Haim Kaplan
2002	A*	`conf`	Labeling Dynamic XML Trees. PODS Edith Cohen, Haim Kaplan, Tova Milo
2002	J	`jnl`	Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators CoRR Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook
2002	A*	`conf`	Meldable heaps and boolean union-find. STOC Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
2002	B	`conf`	Nearest common ancestors: a survey and a new distributed algorithm. SPAA Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
2002	A	`conf`	Partial Alphabetic Trees. ESA Arye Barkan, Haim Kaplan
2002	A	`conf`	Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour
2002	J	`jnl`	Prefetching the means for document transfer: a new approach for reducing Web latency. Comput. Networks Edith Cohen, Haim Kaplan
2002	A*	`conf`	Reachability and distance queries via 2-hop labels. SODA Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
2002	J	`jnl`	Refreshment policies for Web content caches. Comput. Networks Edith Cohen, Haim Kaplan
2002	J	`jnl`	Restoration by path concatenation: fast recovery of MPLS paths. Distributed Comput. Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt
2002	J	`jnl`	Scalable Secure Storage When Half the System Is Faulty. Inf. Comput. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
2002	A*	`conf`	Union-find with deletions. SODA Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
2001	A*	`conf`	Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM Edith Cohen, Haim Kaplan
2001	A*	`conf`	Compact labeling schemes for ancestor queries. SODA Serge Abiteboul, Haim Kaplan, Tova Milo
2001	B	`conf`	Competitive Analysis of the LRFU Paging Algorithm. WADS Edith Cohen, Haim Kaplan, Uri Zwick
2001	A*	`conf`	Faster kinetic heaps and their use in broadcast scheduling. SODA Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis
2001	A*	`conf`	Making data structures confluently persistent. SODA Amos Fiat, Haim Kaplan
2001	A*	`conf`	Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP Edith Cohen, Eran Halperin, Haim Kaplan
2001	—	`conf`	Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT Edith Cohen, Haim Kaplan
2001	A*	`conf`	Refreshment Policies for Web Content Caches. INFOCOM Edith Cohen, Haim Kaplan
2001	A*	`conf`	Restoration by path concatenation: fast recovery of MPLS paths. PODC Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
2001	—	`conf`	Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
2001	B	`conf`	Short and Simple Labels for Small Distances and Other Functions. WADS Haim Kaplan, Tova Milo
2001	—	`conf`	The Age Penalty and Its Effect on Cache Performance. USITS Edith Cohen, Haim Kaplan
2001	J	`jnl`	Unique Maximum Matching Algorithms. J. Algorithms Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
2000	B	`conf`	Connection caching under vaious models of communication. SPAA Edith Cohen, Haim Kaplan, Uri Zwick
2000	A*	`conf`	Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM Edith Cohen, Haim Kaplan
2000	A*	`conf`	Scalable Secure Storage when Half the System Is Faulty. ICALP Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
2000	J	`jnl`	Simple Confluently Persistent Catenable Lists. SIAM J. Comput. Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
1999	J	`jnl`	A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SIAM J. Comput. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1999	J	`jnl`	Bounded Degree Interval Sandwich Problems. Algorithmica Haim Kaplan, Ron Shamir
1999	A*	`conf`	Connection Caching. STOC Edith Cohen, Haim Kaplan, Uri Zwick
1999	A*	`conf`	Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC Edith Cohen, Haim Kaplan
1999	A*	`conf`	Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. SODA Haim Kaplan, Martin Strauss, Mario Szegedy
1999	A*	`conf`	LP-based Analysis of Greedy-dual-size. SODA Edith Cohen, Haim Kaplan
1999	J	`jnl`	Managing TCP Connections Under Persistent HTTP. Comput. Networks Edith Cohen, Haim Kaplan, Jeffrey D. Oldham
1999	A*	`conf`	On-line Complexity of Monotone Set Systems. SODA Haim Kaplan, Mario Szegedy
1999	J	`jnl`	Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. SIAM J. Comput. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1999	A*	`conf`	Unique Maximum Matching Algorithms. STOC Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
1998	J	`jnl`	A New, Simpler Linear-Time Dominators Algorithm. ACM Trans. Program. Lang. Syst. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook
1998	A	`conf`	Cell Flipping in Permutation Diagrams. STACS Martin Charles Golumbic, Haim Kaplan
1998	A*	`conf`	Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. STOC Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook
1998	—	`conf`	Simple Confluently Persistent Catenable Lists (Extended Abstract). SWAT Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
1997	A*	`conf`	Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SODA Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1997	B	`conf`	Faster and simpler algorithm for sorting signed permutations by reversals. RECOMB Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1996	A*	`conf`	A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. FOCS Sanjeev Arora, Alan M. Frieze, Haim Kaplan
1996	J	`jnl`	Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques. SIAM J. Comput. Haim Kaplan, Ron Shamir
1996	—	`conf`	Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. ISTCS Haim Kaplan, Ron Shamir
1996	A*	`conf`	Purely Functional Representations of Catenable Sorted Lists. STOC Haim Kaplan, Robert Endre Tarjan
1995	J	`jnl`	Four Strikes Against Physical Mapping of DNA. J. Comput. Biol. Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir
1995	J	`jnl`	Graph Sandwich Problems. J. Algorithms Martin Charles Golumbic, Haim Kaplan, Ron Shamir
1995	A*	`conf`	Persistent lists with catenation via recursive slow-down. STOC Haim Kaplan, Robert Endre Tarjan
1994	J	`jnl`	The Domatic Number Problem on Some Perfect Graph Families. Inf. Process. Lett. Haim Kaplan, Ron Shamir
1994	A*	`conf`	Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping FOCS Haim Kaplan, Ron Shamir, Robert Endre Tarjan
1993	B	`conf`	Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG Martin Charles Golumbic, Haim Kaplan, Ron Shamir