Haim Kaplan

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

Coauthor Index

1	Serge Abiteboul	[36] [87] [88]
2	Yehuda Afek	[38] [41] [46]
3	Pankaj K. Agarwal	[85] [108] [127] [158] [161] [175] [187] [188]
4	Giora Alexandron	[84] [105]
5	Noga Alon	[30] [45] [103] [122] [130]
6	Stephen Alstrup	[54] [88]
7	Lars Arge	[187]
8	Sanjeev Arora	[10] [44]
9	Rinat Ben Avraham	[188]
10	Yossi Azar	[69] [75]
11	Arye Barkan	[61] [89]
12	Sergey Bereg (Sergei Bespamyatnikh)	[85] [158]
13	Rubi Boim	[159]
14	Anat Bremler-Barr	[38] [41] [46] [59] [65]
15	Adam L. Buchsbaum	[13] [15] [49] [83] [119]
16	Bogdan Cautis	[87]
17	Ke Chen	[101] [144]
18	Edith Cohen	[19] [22] [23] [25] [28] [29] [33] [34] [38] [39] [40] [41] [42] [43] [46] [47] [48] [50] [51] [52] [56] [58] [59] [60] [62] [63] [65] [66] [67] [69] [70] [71] [74] [75] [76] [77] [78] [97] [102] [104] [111] [112] [113] [114] [121] [123] [125] [126] [131] [133] [134] [136] [137] [141] [148] [149] [152] [156] [157] [164] [167] [173] [180] [182] [186] [189]
19	Ovidiu Daescu	[85] [158]
20	Emilie Danna	[191]
21	Nick G. Duffield	[112] [114] [125] [134] [148] [167]
22	György Elekes	[139] [168]
23	Dan Feldman	[145]
24	Michal Feldman	[136] [156] [157] [164] [180] [186]
25	Amos Fiat	[37] [64] [67] [69] [70] [71] [75] [87] [96] [101] [104] [115] [116] [136] [145] [156] [157] [164] [180] [186]
26	Alan M. Frieze	[10] [44]
27	Harold N. Gabow	[21] [31]
28	Jie Gao	[161] [175]
29	Cyril Gavoille	[54]
30	Loukas Georgiadis	[106] [119] [179]
31	Yoav Giyora	[110] [143]
32	Andrew V. Goldberg	[107] [183]
33	Paul W. Goldberg	[4]
34	Martin Charles Golumbic	[1] [4] [5] [16] [82]
35	Nadav Grossaug	[97] [123]
36	Leonidas J. Guibas	[161] [175]
37	Eran Halperin	[43] [56] [62] [78]
38	Tzvika Hartman	[192]
39	Avinatan Hassidim	[176] [184] [191] [192]
40	Sagi Hed	[183]
41	Moshe Hershcovitch	[129]
42	Matthew J. Katz (Matya Katz)	[163] [166]
43	Vladlen Koltun	[161] [175]
44	Michael Krivelevich	[30] [45] [103]
45	Alok Kumar	[191]
46	Eyal Kushilevitz	[86]
47	Shir Landau	[98] [100]
48	Vadim E. Levit	[169]
49	Meital Levy	[96] [101] [115] [116]
50	Moshe Lewenstein	[72] [80]
51	Marina Lipshteyn	[169]
52	Carsten Lund	[112] [114] [125] [134] [148] [167]
53	Dahlia Malkhi (Dalia Malki)	[30] [45] [103]
54	Yishay Mansour	[59] [65] [86] [176] [184] [191]
55	Jirí Matousek	[101]
56	Ross M. McConnell	[169]
57	Michael Merritt	[38] [41] [46]
58	Tova Milo	[32] [36] [55] [58] [87] [88] [99] [152] [159]
59	Eyal Molad	[68] [187]
60	Gila Morgenstern	[163] [166]
61	Elchanan Mossel	[101]
62	Shay Mozes	[190]
63	Noam Nisan	[176] [184]
64	Kobbi Nissim	[145]
65	Gabriel Nivasch	[122] [130]
66	Simeon C. Ntafos	[85] [158]
67	Yahav Nussbaum	[91] [94] [135] [140] [150] [177] [178] [181] [190]
68	Chris Okasaki	[14] [27]
69	Jeffrey D. Oldham	[19]
70	Svetlana Olonetsky	[96] [115] [116] [136] [156] [157] [164] [180] [186]
71	János Pach	[101]
72	Ely Porat	[93]
73	Harald Räcke	[69] [75]
74	Edgar Ramos	[170] [171]
75	Theis Rauhe	[54] [88]
76	Danny Raz	[191] [192]
77	Anne Rogers	[13] [15] [49] [83] [119]
78	Natan Rubin	[109] [117] [120] [124] [142] [147] [151] [154] [155] [160] [161] [162] [172] [175] [185]
79	Ronitt Rubinfeld	[159]
80	Michal Segalov	[191] [192]
81	Subhabrata Sen	[133] [137]
82	Ronen Shabo	[55] [96] [99]
83	Nira Shafrir	[53] [57] [72] [80] [81] [90] [93] [106] [132] [179]
84	Ron Shamir	[1] [2] [3] [4] [5] [7] [9] [11] [12] [17] [18] [20]
85	Micha Sharir	[84] [92] [95] [101] [105] [108] [109] [117] [120] [122] [124] [127] [130] [138] [139] [142] [144] [147] [151] [153] [154] [155] [158] [160] [161] [162] [163] [166] [168] [170] [171] [172] [174] [175] [185] [188] [190]
86	Eugenii Shustin	[138] [153]
87	Shakhar Smorodinsky	[101] [122] [130]
88	Julien P. Stern	[30] [45] [103]
89	Martin Strauss (Martin J. Strauss)	[24]
90	Maxim Sviridenko	[72] [80]
91	Mario Szegedy	[24] [26]
92	Robert Endre Tarjan	[3] [6] [8] [11] [12] [14] [17] [18] [21] [27] [31] [35] [53] [57] [68] [106] [119] [128] [179] [183] [187]
93	Mikkel Thorup	[112] [114] [125] [134] [148] [167]
94	Kostas Tsioutsiouliklis	[35]
95	Elad Verbin	[73] [79] [82] [92] [98] [100] [109] [118] [120]
96	Uli Wagner	[101]
97	Emo Welzl	[101]
98	Renato Fonseca F. Werneck	[106] [107] [179] [183]
99	Jeffery Westbrook	[13] [15] [49] [83] [119]
100	Ke Yi	[187]
101	Binhai Zhu	[85] [158]
102	Uri Zwick	[22] [28] [33] [50] [56] [62] [63] [146]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page