2013
200I/O Efficient Dynamic Data Structures for Longest Prefix Queries. Moshe Hershcovitch, Haim Kaplan. Algorithmica (65): 371-390 (2013). Web SearchBibTeXDownload
199Probe Scheduling for Efficient Detection of Silent Failures. Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur. CoRR (abs/1302.0792) (2013). Web SearchBibTeXDownload
198Computing the Discrete Fréchet Distance in Subquadratic Time. Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir. SODA 2013, 156-167. Web SearchBibTeXDownload
197Reporting neighbors in high-dimensional Euclidean spaces. Dror Aiger, Haim Kaplan, Micha Sharir. SODA 2013, 784-803. Web SearchBibTeXDownload
2012
196Unit Distances in Three Dimensions. Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir. Combinatorics, Probability & Computing (21): 597-610 (2012). Web SearchBibTeXDownload
195What you can do with Coordinated Samples. Edith Cohen, Haim Kaplan. CoRR (abs/1206.5637) (2012). Web SearchBibTeXDownload
194Computing the Discrete Fréchet Distance in Subquadratic Time. Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir. CoRR (abs/1204.5333) (2012). Web SearchBibTeXDownload
193The AND-OR game: Equilibrium Characterization (Working Paper). Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan. CoRR (abs/1210.1757) (2012). Web SearchBibTeXDownload
192Joint Cache Partition and Job Assignment on Multi-Core Processors. Avinatan Hassidim, Haim Kaplan, Omry Tuval. CoRR (abs/1210.4053) (2012). Web SearchBibTeXDownload
191How to Estimate Change from Samples. Edith Cohen, Haim Kaplan. CoRR (abs/1203.4903) (2012). Web SearchBibTeXDownload
190A Case for Customizing Estimators: Coordinated Samples. Edith Cohen, Haim Kaplan. CoRR (abs/1212.0243) (2012). Web SearchBibTeXDownload
189CBTree: A Practical Concurrent Self-Adjusting Search Tree. Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan. DISC 2012, 1-15. Web SearchBibTeXDownload
188Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Haim Kaplan, Jirí Matousek, Micha Sharir. Discrete & Computational Geometry (48): 499-517 (2012). Web SearchBibTeXDownload
187Upward Max Min Fairness. Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov. INFOCOM 2012, 837-845. Web SearchBibTeXDownload
186How to split a flow?. Tzvika Hartman, Avinatan Hassidim, Haim Kaplan, Danny Raz, Michal Segalov. INFOCOM 2012, 828-836. Web SearchBibTeXDownload
185Envy-Free Makespan Approximation. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. SIAM J. Comput. (41): 12-25 (2012). Web SearchBibTeXDownload
184An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi. SIAM J. Comput. (41): 104-127 (2012). Web SearchBibTeXDownload
183Improved Bounds for Geometric Permutations. Natan Rubin, Haim Kaplan, Micha Sharir. SIAM J. Comput. (41): 367-390 (2012). Web SearchBibTeXDownload
182Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir. SODA 2012, 338-355. Web SearchBibTeXDownload
181Finding the maximal empty disk containing a query point. Haim Kaplan, Micha Sharir. Symposium on Computational Geometry 2012, 287-292. Web SearchBibTeXDownload
180The AND-OR Game: Equilibrium Characterization - (Working Paper). Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan. WINE 2012, 561. Web SearchBibTeXDownload
2011
179Non-price equilibria in markets of discrete goods. Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan. ACM Conference on Electronic Commerce 2011, 295-296. Web SearchBibTeXDownload
178Data structures for mergeable trees. Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck. ACM Transactions on Algorithms (7): 14 (2011). Web SearchBibTeXDownload
177Maximum Flow in Directed Planar Graphs with Vertex Capacities. Haim Kaplan, Yahav Nussbaum. Algorithmica (61): 174-189 (2011). Web SearchBibTeXDownload
176A Simpler Linear-Time Recognition of Circular-Arc Graphs. Haim Kaplan, Yahav Nussbaum. Algorithmica (61): 694-737 (2011). Web SearchBibTeXDownload
175A kinetic triangulation scheme for moving points in the plane. Haim Kaplan, Natan Rubin, Micha Sharir. Comput. Geom. (44): 191-205 (2011). Web SearchBibTeXDownload
174Kinetic Stable Delaunay Graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. CoRR (abs/1104.0622) (2011). Web SearchBibTeXDownload
173Get the Most out of Your Sample: Optimal Unbiased Estimators using Partial Information. Edith Cohen, Haim Kaplan. CoRR (abs/1109.1325) (2011). Web SearchBibTeXDownload
172Finding the Maximal Empty Rectangle Containing a Query Point. Haim Kaplan, Micha Sharir. CoRR (abs/1106.3628) (2011). Web SearchBibTeXDownload
171Non-Price Equilibria in Markets of Discrete Goods. Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan. CoRR (abs/1103.3950) (2011). Web SearchBibTeXDownload
170Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. Haim Kaplan, Edgar Ramos, Micha Sharir. Discrete & Computational Geometry (45): 3-33 (2011). Web SearchBibTeXDownload
169The Overlay of Minimization Diagrams in a Randomized Incremental Construction. Haim Kaplan, Edgar Ramos, Micha Sharir. Discrete & Computational Geometry (45): 371-382 (2011). Web SearchBibTeXDownload
168Maximum Flows by Incremental Breadth-First Search. Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck. ESA 2011, 457-468. Web SearchBibTeXDownload
167On lines, joints, and incidences in three dimensions. György Elekes, Haim Kaplan, Micha Sharir. J. Comb. Theory, Ser. A (118): 962-977 (2011). Web SearchBibTeXDownload
166Get the most out of your sample: optimal unbiased estimators using partial information. Edith Cohen, Haim Kaplan. PODS 2011, 13-24. Web SearchBibTeXDownload
165Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. SIAM J. Comput. (40): 1402-1431 (2011). Web SearchBibTeXDownload
164Optimal Cover of Points by Disks in a Simple Polygon. Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir. SIAM J. Comput. (40): 1647-1661 (2011). Web SearchBibTeXDownload
163Minimum s-t cut in undirected planar graphs when the source and the sink are close. Haim Kaplan, Yahav Nussbaum. STACS 2011, 117-128. Web SearchBibTeXDownload
162Truth, Envy, and Truthful Market Clearing Bundle Pricing. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. WINE 2011, 97-108. Web SearchBibTeXDownload
2010
161Envy-free makespan approximation: extended abstract. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. ACM Conference on Electronic Commerce 2010, 159-166. Web SearchBibTeXDownload
160Guarding a Terrain by Two Watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu. Algorithmica (58): 352-390 (2010). Web SearchBibTeXDownload
159Improved Bounds for Geometric Permutations. Natan Rubin, Haim Kaplan, Micha Sharir. CoRR (abs/1007.3244) (2010). Web SearchBibTeXDownload
158A Kinetic Triangulation Scheme for Moving Points in The Plane. Haim Kaplan, Natan Rubin, Micha Sharir. CoRR (abs/1005.0912) (2010). Web SearchBibTeXDownload
157Truth and Envy in Capacitated Allocation Games. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. CoRR (abs/1003.5326) (2010). Web SearchBibTeXDownload
156On the Interplay between Incentive Compatibility and Envy Freeness. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. CoRR (abs/1003.5328) (2010). Web SearchBibTeXDownload
155On Lines and Joints. Haim Kaplan, Micha Sharir, Eugenii Shustin. Discrete & Computational Geometry (44): 838-843 (2010). Web SearchBibTeXDownload
154Optimal Cover of Points by Disks in a Simple Polygon. Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir. ESA (1) 2010, 475-486. Web SearchBibTeXDownload
153Line Transversals of Convex Polyhedra in R3. Haim Kaplan, Natan Rubin, Micha Sharir. SIAM J. Comput. (39): 3283-3310 (2010). Web SearchBibTeXDownload
152Labeling Dynamic XML Trees. Edith Cohen, Haim Kaplan, Tova Milo. SIAM J. Comput. (39): 2048-2074 (2010). Cited by 204Web SearchBibTeXDownload
151A kinetic triangulation scheme for moving points in the plane. Haim Kaplan, Natan Rubin, Micha Sharir. Symposium on Computational Geometry 2010, 137-146. Web SearchBibTeXDownload
150Kinetic stable Delaunay graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. Symposium on Computational Geometry 2010, 127-136. Web SearchBibTeXDownload
149Improved Recommendations via (More) Collaboration. Rubi Boim, Haim Kaplan, Tova Milo, Ronitt Rubinfeld. WebDB 2010. Web SearchBibTeXDownload
2009
148Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. Yoav Giyora, Haim Kaplan. ACM Transactions on Algorithms (5) (2009). Web SearchBibTeXDownload
147Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. Ke Chen, Haim Kaplan, Micha Sharir. ACM Transactions on Algorithms (5) (2009). Web SearchBibTeXDownload
146Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Haim Kaplan, Natan Rubin, Micha Sharir. Algorithmica (55): 283-310 (2009). Web SearchBibTeXDownload
145Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates. Edith Cohen, Haim Kaplan. CoRR (abs/0903.0625) (2009). Cited by 1Web SearchBibTeXDownload
144Envy-Free Makespan Approximation. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. CoRR (abs/0909.1072) (2009). Web SearchBibTeXDownload
143On Lines, Joints, and Incidences in Three Dimensions. György Elekes, Haim Kaplan, Micha Sharir. CoRR (abs/0905.1583) (2009). Web SearchBibTeXDownload
142On lines and Joints. Haim Kaplan, Micha Sharir, Eugenii Shustin. CoRR (abs/0906.0558) (2009). Web SearchBibTeXDownload
141Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Haim Kaplan, Yahav Nussbaum. Discrete Applied Mathematics (157): 3216-3230 (2009). Web SearchBibTeXDownload
140Maximum Flow in Directed Planar Graphs with Vertex Capacities. Haim Kaplan, Yahav Nussbaum. ESA 2009, 397-407. Web SearchBibTeXDownload
139Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. PVLDB (2): 431-442 (2009). Web SearchBibTeXDownload
138Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. Edith Cohen, Haim Kaplan, Subhabrata Sen. PVLDB (2): 646-657 (2009). Web SearchBibTeXDownload
137Leveraging discarded samples for tighter estimation of multiple-set aggregates. Edith Cohen, Haim Kaplan. SIGMETRICS/Performance 2009, 251-262. Web SearchBibTeXDownload
136Stream sampling for variance-optimal estimation of subset sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. SODA 2009, 1255-1264. Cited by 2Web SearchBibTeXDownload
135A simpler implementation and analysis of Chazelle's soft heaps. Haim Kaplan, Uri Zwick. SODA 2009, 477-485. Web SearchBibTeXDownload
134Line transversals of convex polyhedra in R3. Haim Kaplan, Natan Rubin, Micha Sharir. SODA 2009, 170-179. Web SearchBibTeXDownload
133Private coresets. Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim. STOC 2009, 361-370. Web SearchBibTeXDownload
2008
132Kinetic and dynamic data structures for closest pair and all nearest neighbors. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir. ACM Transactions on Algorithms (5) (2008). Web SearchBibTeXDownload
131Thin heaps, thick heaps. Haim Kaplan, Robert Endre Tarjan. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload
130Processing top-k queries from samples. Edith Cohen, Nadav Grossaug, Haim Kaplan. Computer Networks (52): 2605-2622 (2008). Cited by 3Web SearchBibTeXDownload
129Line Transversals of Convex Polyhedra in R3. Haim Kaplan, Natan Rubin, Micha Sharir. CoRR (abs/0807.1221) (2008). Web SearchBibTeXDownload
128Sketch-Based Estimation of Subpopulation-Weight. Edith Cohen, Haim Kaplan. CoRR (abs/0802.3448) (2008). Cited by 1Web SearchBibTeXDownload
127Variance optimal sampling based estimation of subset sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. CoRR (abs/0803.0473) (2008). Cited by 3Web SearchBibTeXDownload
126Path Minima in Incremental Unrooted Trees. Haim Kaplan, Nira Shafrir. ESA 2008, 565-576. Web SearchBibTeXDownload
125Estimating Aggregates over Multiple Sets. Edith Cohen, Haim Kaplan. ICDM 2008, 761-766. Cited by 1Web SearchBibTeXDownload
124Weak &epsis;-nets and interval chains. Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky. J. ACM (55) (2008). Web SearchBibTeXDownload
123Tighter estimation using bottom k sketches. Edith Cohen, Haim Kaplan. PVLDB (1): 213-224 (2008). Cited by 5Web SearchBibTeXDownload
122Efficient Colored Orthogonal Range Counting. Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin. SIAM J. Comput. (38): 982-1011 (2008). Web SearchBibTeXDownload
121Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery Westbrook. SIAM J. Comput. (38): 1533-1573 (2008). Web SearchBibTeXDownload
120Weak ε-nets and interval chains. Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky. SODA 2008, 1194-1203. Web SearchBibTeXDownload
119I/O Efficient Dynamic Data Structures for Longest Prefix Queries. Moshe Hershcovitch, Haim Kaplan. SWAT 2008, 29-40. Web SearchBibTeXDownload
2007
118Associative search in peer to peer networks: Harnessing latent semantics. Edith Cohen, Amos Fiat, Haim Kaplan. Computer Networks (51): 1861-1881 (2007). Cited by 183Web SearchBibTeXDownload
117Kinetic and dynamic data structures for convex hulls and upper envelopes. Giora Alexandron, Haim Kaplan, Micha Sharir. Comput. Geom. (36): 144-158 (2007). Web SearchBibTeXDownload
116Data Structures for Mergeable Trees. Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck. CoRR (abs/0711.1682) (2007). Web SearchBibTeXDownload
115Most Burrows-Wheeler Based Compressors Are Not Optimal. Haim Kaplan, Elad Verbin. CPM 2007, 107-118. Web SearchBibTeXDownload
114Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. Haim Kaplan, Natan Rubin, Micha Sharir. ESA 2007, 287-298. Web SearchBibTeXDownload
113Strong Price of Anarchy for Machine Load Balancing. Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky. ICALP 2007, 583-594. Web SearchBibTeXDownload
112Addendum 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. (205): 1114-1116 (2007). Web SearchBibTeXDownload
111Algorithms and estimators for accurate summarization of internet traffic. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. Internet Measurement Comference 2007, 265-278. Cited by 8Web SearchBibTeXDownload
110Spatially-decaying aggregation over a network. Edith Cohen, Haim Kaplan. J. Comput. Syst. Sci. (73): 265-288 (2007). Cited by 27Web SearchBibTeXDownload
109Summarizing data using bottom-k sketches. Edith Cohen, Haim Kaplan. PODC 2007, 225-234. Cited by 12Web SearchBibTeXDownload
108Sketching unaggregated data streams for subpopulation-size queries. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. PODS 2007, 253-262. Cited by 10Web SearchBibTeXDownload
107Online Conflict-Free Coloring for Intervals. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl. SIAM J. Comput. (36): 1342-1359 (2007). Web SearchBibTeXDownload
106Bottom-k sketches: better and more efficient estimation of aggregates. Edith Cohen, Haim Kaplan. SIGMETRICS 2007, 353-354. Cited by 7Web SearchBibTeXDownload
105Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. Yoav Giyora, Haim Kaplan. SODA 2007, 19-28. Web SearchBibTeXDownload
104Counting colors in boxes. Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin. SODA 2007, 785-794. Web SearchBibTeXDownload
103Computing the volume of the union of cubes. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir. Symposium on Computational Geometry 2007, 294-301. Web SearchBibTeXDownload
102A simpler analysis of Burrows-Wheeler-based compression. Haim Kaplan, Shir Landau, Elad Verbin. Theor. Comput. Sci. (387): 220-235 (2007). Web SearchBibTeXDownload
101Compact Labeling Scheme for XML Ancestor Queries. Haim Kaplan, Tova Milo, Ronen Shabo. Theory Comput. Syst. (40): 55-99 (2007). Cited by 1Web SearchBibTeXDownload
100Better Landmarks Within Reach. Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck. WEA 2007, 38-51. Web SearchBibTeXDownload
2006
99Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck. ALENEX 2006, 129-143. Web SearchBibTeXDownload
98Processing top k queries from samples. Edith Cohen, Nadav Grossaug, Haim Kaplan. CoNEXT 2006, 7. Web SearchBibTeXDownload
97A Simpler Analysis of Burrows-Wheeler Based Compression. Haim Kaplan, Shir Landau, Elad Verbin. CPM 2006, 282-293. Web SearchBibTeXDownload
96On 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, 608-618. Web SearchBibTeXDownload
95The greedy algorithm for edit distance with moves. Haim Kaplan, Nira Shafrir. Inf. Process. Lett. (97): 23-27 (2006). Web SearchBibTeXDownload
94Partial alphabetic trees. Arye Barkan, Haim Kaplan. J. Algorithms (58): 81-103 (2006). Web SearchBibTeXDownload
93Compact Labeling Scheme for Ancestor Queries. Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe. SIAM J. Comput. (35): 1295-1309 (2006). Web SearchBibTeXDownload
92Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. Haim Kaplan, Micha Sharir. SODA 2006, 484-493. Web SearchBibTeXDownload
91A Simpler Linear-Time Recognition of Circular-Arc Graphs. Haim Kaplan, Yahav Nussbaum. SWAT 2006, 41-52. Web SearchBibTeXDownload
90Finding the Position of the k-Mismatch and Approximate Tandem Repeats. Haim Kaplan, Ely Porat, Nira Shafrir. SWAT 2006, 90-101. Web SearchBibTeXDownload
89Colored intersection searching via sparse rectangular matrix multiplication. Haim Kaplan, Micha Sharir, Elad Verbin. Symposium on Computational Geometry 2006, 52-60. Web SearchBibTeXDownload
88Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. Haim Kaplan, Yahav Nussbaum. WG 2006, 289-300. Web SearchBibTeXDownload
2005
87Corrigendum: a new, simpler linear-time dominators algorithm. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook. ACM Trans. Program. Lang. Syst. (27): 383-387 (2005). Web SearchBibTeXDownload
86Secure Exchange of Modifiable Data and Queries. Serge Abiteboul, Bogdan Cautis, Amos Fiat, Haim Kaplan, Tova Milo. BDA 2005. Web SearchBibTeX
85On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Martin Charles Golumbic, Haim Kaplan, Elad Verbin. Discrete Mathematics (296): 25-41 (2005). Web SearchBibTeXDownload
84The greedy algorithm for shortest superstrings. Haim Kaplan, Nira Shafrir. Inf. Process. Lett. (93): 13-17 (2005). Web SearchBibTeXDownload
83Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko. J. ACM (52): 602-626 (2005). Web SearchBibTeXDownload
82Sorting signed permutations by reversals, revisited. Haim Kaplan, Elad Verbin. J. Comput. Syst. Sci. (70): 321-341 (2005). Web SearchBibTeXDownload
81Learning with attribute costs. Haim Kaplan, Eyal Kushilevitz, Yishay Mansour. STOC 2005, 356-365. Web SearchBibTeXDownload
80Guarding a terrain by two watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu. Symposium on Computational Geometry 2005, 346-355. Web SearchBibTeXDownload
79Performance aspects of distributed caches using TTL-based consistency. Edith Cohen, Eran Halperin, Haim Kaplan. Theor. Comput. Sci. (331): 73-96 (2005). Cited by 10Web SearchBibTeXDownload
78Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. Giora Alexandron, Haim Kaplan, Micha Sharir. WADS 2005, 269-281. Web SearchBibTeXDownload
2004
77Optimal oblivious routing in polynomial time. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke. J. Comput. Syst. Sci. (69): 383-394 (2004). Cited by 95Web SearchBibTeXDownload
76Balanced-Replication Algorithms for Distribution Trees. Edith Cohen, Haim Kaplan. SIAM J. Comput. (34): 227-247 (2004). Cited by 5Web SearchBibTeXDownload
75Spatially-decaying aggregation over a network: model and algorithms. Edith Cohen, Haim Kaplan. SIGMOD Conference 2004, 707-718. Cited by 4Web SearchBibTeXDownload
74Efficient estimation algorithms for neighborhood variance and other moments. Edith Cohen, Haim Kaplan. SODA 2004, 157-166. Cited by 6Web SearchBibTeXDownload
2003
73A case for associative peer to peer overlays. Edith Cohen, Amos Fiat, Haim Kaplan. Computer Communication Review (33): 95-100 (2003). Cited by 37Web SearchBibTeXDownload
72Proactive caching of DNS records: addressing a performance bottleneck. Edith Cohen, Haim Kaplan. Computer Networks (41): 707-726 (2003). Cited by 67Web SearchBibTeXDownload
71Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. Haim Kaplan, Elad Verbin. CPM 2003, 170-185. Web SearchBibTeXDownload
70Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko. FOCS 2003, 56-65. Web SearchBibTeXDownload
69Predicting and bypassing end-to-end Internet service degradations. Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour. IEEE Journal on Selected Areas in Communications (21): 961-978 (2003). Web SearchBibTeXDownload
68Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. Edith Cohen, Amos Fiat, Haim Kaplan. INFOCOM 2003. Web SearchBibTeXDownload
67Making data structures confluently persistent. Amos Fiat, Haim Kaplan. J. Algorithms (48): 16-58 (2003). Web SearchBibTeXDownload
66Connection caching: model and algorithms. Edith Cohen, Haim Kaplan, Uri Zwick. J. Comput. Syst. Sci. (67): 92-126 (2003). Cited by 4Web SearchBibTeXDownload
65Reachability and Distance Queries via 2-Hop Labels. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick. SIAM J. Comput. (32): 1338-1355 (2003). Web SearchBibTeXDownload
64Efficient sequences of trials. Edith Cohen, Amos Fiat, Haim Kaplan. SODA 2003, 737-746. Cited by 23Web SearchBibTeXDownload
63Dynamic rectangular intersection with priorities. Haim Kaplan, Eyal Molad, Robert Endre Tarjan. STOC 2003, 639-648. Web SearchBibTeXDownload
62Optimal oblivious routing in polynomial time. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke. STOC 2003, 383-388. Cited by 95Web SearchBibTeXDownload
2002
61Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Edith Cohen, Haim Kaplan. Algorithmica (33): 300-334 (2002). Cited by 34Web SearchBibTeXDownload
60Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Edith Cohen, Haim Kaplan. Algorithmica (32): 459-466 (2002). Cited by 8Web SearchBibTeXDownload
59Competitive Analysis of the LRFU Paging Algorithm. Edith Cohen, Haim Kaplan, Uri Zwick. Algorithmica (33): 511-516 (2002). Cited by 3Web SearchBibTeXDownload
58Refreshment policies for Web content caches. Edith Cohen, Haim Kaplan. Computer Networks (38): 795-808 (2002). Cited by 55Web SearchBibTeXDownload
57Prefetching the means for document transfer: a new approach for reducing Web latency. Edith Cohen, Haim Kaplan. Computer Networks (39): 437-455 (2002). Cited by 126Web SearchBibTeXDownload
56Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook. CoRR (cs.DS/0207061) (2002). Web SearchBibTeXDownload
55Restoration by path concatenation: fast recovery of MPLS paths. Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt. Distributed Computing (15): 273-283 (2002). Cited by 13Web SearchBibTeXDownload
54Balanced-Replication Algorithms for Distribution Trees. Edith Cohen, Haim Kaplan. ESA 2002, 297-309. Cited by 5Web SearchBibTeXDownload
53Partial Alphabetic Trees. Arye Barkan, Haim Kaplan. ESA 2002, 114-125. Web SearchBibTeXDownload
52Scalable Secure Storage When Half the System Is Faulty. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern. Inf. Comput. (174): 203-213 (2002). Web SearchBibTeXDownload
51Predicting and bypassing end-to-end internet service degradations. Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour. Internet Measurement Workshop 2002, 307-320. Cited by 13Web SearchBibTeXDownload
50A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Sanjeev Arora, Alan M. Frieze, Haim Kaplan. Math. Program. (92): 1-36 (2002). Web SearchBibTeXDownload
49Labeling Dynamic XML Trees. Edith Cohen, Haim Kaplan, Tova Milo. PODS 2002, 271-281. Cited by 204Web SearchBibTeXDownload
48Union-find with deletions. Haim Kaplan, Nira Shafrir, Robert Endre Tarjan. SODA 2002, 19-28. Web SearchBibTeXDownload
47A comparison of labeling schemes for ancestor queries. Haim Kaplan, Tova Milo, Ronen Shabo. SODA 2002, 954-963. Cited by 81Web SearchBibTeXDownload
46Reachability and distance queries via 2-hop labels. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick. SODA 2002, 937-946. Cited by 88Web SearchBibTeXDownload
45Nearest common ancestors: a survey and a new distributed algorithm. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe. SPAA 2002, 258-264. Web SearchBibTeXDownload
44Meldable heaps and boolean union-find. Haim Kaplan, Nira Shafrir, Robert Endre Tarjan. STOC 2002, 573-582. Web SearchBibTeXDownload
2001
43Performance Aspects of Distributed Caches Using TTL-Based Consistency. Edith Cohen, Eran Halperin, Haim Kaplan. ICALP 2001, 744-756. Web SearchBibTeXDownload
42Refreshment Policies for Web Content Caches. Edith Cohen, Haim Kaplan. INFOCOM 2001, 1398-1406. Web SearchBibTeXDownload
41Unique Maximum Matching Algorithms. Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan. J. Algorithms (40): 159-183 (2001). Web SearchBibTeXDownload
40Restoration by path concatenation: fast recovery of MPLS paths. Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt. PODC 2001, 43-52. Cited by 13Web SearchBibTeXDownload
39Proactive Caching of DNS Records: Addressing a Performance Bottleneck. Edith Cohen, Haim Kaplan. SAINT 2001, 85-94. Web SearchBibTeXDownload
38Aging through cascaded caches: performance issues in the distribution of web content. Edith Cohen, Haim Kaplan. SIGCOMM 2001, 41-53. Cited by 35Web SearchBibTeXDownload
37Restoration path concatenation: fast recovery of MPLS paths. Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt. SIGMETRICS/Performance 2001, 316-317. Web SearchBibTeXDownload
36Compact labeling schemes for ancestor queries. Serge Abiteboul, Haim Kaplan, Tova Milo. SODA 2001, 547-556. Cited by 118Web SearchBibTeXDownload
35Faster kinetic heaps and their use in broadcast scheduling. Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis. SODA 2001, 836-844. Web SearchBibTeXDownload
34Making data structures confluently persistent. Amos Fiat, Haim Kaplan. SODA 2001, 537-546. Web SearchBibTeXDownload
33The Age Penalty and Its Effect on Cache Performance. Edith Cohen, Haim Kaplan. USITS 2001, 73-84. Cited by 1Web SearchBibTeXDownload
32Competitive Analysis of the LRFU Paging Algorithm. Edith Cohen, Haim Kaplan, Uri Zwick. WADS 2001, 148-154. Cited by 3Web SearchBibTeXDownload
31Short and Simple Labels for Small Distances and Other Functions. Haim Kaplan, Tova Milo. WADS 2001, 246-257. Cited by 33Web SearchBibTeXDownload
2000
30Scalable Secure Storage when Half the System Is Faulty. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern. ICALP 2000, 576-587. Web SearchBibTeXDownload
29Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. Edith Cohen, Haim Kaplan. INFOCOM 2000, 854-863. Web SearchBibTeXDownload
28Simple Confluently Persistent Catenable Lists. Haim Kaplan, Chris Okasaki, Robert Endre Tarjan. SIAM J. Comput. (30): 965-977 (2000). Web SearchBibTeXDownload
27Connection caching under vaious models of communication. Edith Cohen, Haim Kaplan, Uri Zwick. SPAA 2000, 54-63. Cited by 11Web SearchBibTeXDownload
1999
26Bounded Degree Interval Sandwich Problems. Haim Kaplan, Ron Shamir. Algorithmica (24): 96-104 (1999). Web SearchBibTeXDownload
25Managing TCP Connections Under Persistent HTTP. Edith Cohen, Haim Kaplan, Jeffrey D. Oldham. Computer Networks (31): 1709-1723 (1999). Cited by 33Web SearchBibTeXDownload
24Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. Haim Kaplan, Ron Shamir, Robert Endre Tarjan. SIAM J. Comput. (28): 1906-1922 (1999). Web SearchBibTeXDownload
23A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. Haim Kaplan, Ron Shamir, Robert Endre Tarjan. SIAM J. Comput. (29): 880-892 (1999). Web SearchBibTeXDownload
22Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. Haim Kaplan, Martin Strauss, Mario Szegedy. SODA 1999, 935-936. Web SearchBibTeXDownload
21On-line Complexity of Monotone Set Systems. Haim Kaplan, Mario Szegedy. SODA 1999, 507-516. Web SearchBibTeXDownload
20LP-based Analysis of Greedy-dual-size. Edith Cohen, Haim Kaplan. SODA 1999, 879-880. Cited by 15Web SearchBibTeXDownload
19Connection Caching. Edith Cohen, Haim Kaplan, Uri Zwick. STOC 1999, 612-621. Cited by 17Web SearchBibTeXDownload
18Unique Maximum Matching Algorithms. Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan. STOC 1999, 70-78. Web SearchBibTeXDownload
17Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Edith Cohen, Haim Kaplan. STOC 1999, 109-118. Cited by 34Web SearchBibTeXDownload
1998
16A New, Simpler Linear-Time Dominators Algorithm. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook. ACM Trans. Program. Lang. Syst. (20): 1265-1296 (1998). Web SearchBibTeXDownload
15Cell Flipping in Permutation Diagrams. Martin Charles Golumbic, Haim Kaplan. STACS 1998, 577-586. Web SearchBibTeXDownload
14Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook. STOC 1998, 279-288. Web SearchBibTeXDownload
13Simple Confluently Persistent Catenable Lists (Extended Abstract). Haim Kaplan, Chris Okasaki, Robert Endre Tarjan. SWAT 1998, 119-130. Web SearchBibTeXDownload
1997
12Faster and simpler algorithm for sorting signed permutations by reversals. Haim Kaplan, Ron Shamir, Robert Endre Tarjan. RECOMB 1997, 163. Web SearchBibTeXDownload
11Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. Haim Kaplan, Ron Shamir, Robert Endre Tarjan. SODA 1997, 344-351. Web SearchBibTeXDownload
1996
10A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. Sanjeev Arora, Alan M. Frieze, Haim Kaplan. FOCS 1996, 21-30. Web SearchBibTeXDownload
9Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. Haim Kaplan, Ron Shamir. ISTCS 1996, 195-201. Web SearchBibTeX
8Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques. Haim Kaplan, Ron Shamir. SIAM J. Comput. (25): 540-561 (1996). Web SearchBibTeXDownload
7Purely Functional Representations of Catenable Sorted Lists. Haim Kaplan, Robert Endre Tarjan. STOC 1996, 202-211. Web SearchBibTeXDownload
1995
6Graph Sandwich Problems. Martin Charles Golumbic, Haim Kaplan, Ron Shamir. J. Algorithms (19): 449-473 (1995). Web SearchBibTeXDownload
5Four Strikes Against Physical Mapping of DNA. Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir. Journal of Computational Biology (2): 139-152 (1995). Web SearchBibTeXDownload
4Persistent lists with catenation via recursive slow-down. Haim Kaplan, Robert Endre Tarjan. STOC 1995, 93-102. Web SearchBibTeXDownload
1994
3Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping. Haim Kaplan, Ron Shamir, Robert Endre Tarjan. FOCS 1994, 780-791. Web SearchBibTeXDownload
2The Domatic Number Problem on Some Perfect Graph Families. Haim Kaplan, Ron Shamir. Inf. Process. Lett. (49): 51-56 (1994). Web SearchBibTeXDownload
1993
1Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). Martin Charles Golumbic, Haim Kaplan, Ron Shamir. WG 1993, 57-69. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research