Haim Kaplan Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Yahav Nussbaum: Maximum Flow in Directed Planar Graphs with Vertex Capacities. ESA 2009: 397-407
147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Leveraging discarded samples for tighter estimation of multiple-set aggregates. SIGMETRICS/Performance 2009: 251-262
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Stream sampling for variance-optimal estimation of subset sums. SODA 2009: 1255-1264
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Natan Rubin, Micha Sharir: Line transversals of convex polyhedra in R3. SODA 2009: 170-179
144Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Uri Zwick: A simpler implementation and analysis of Chazelle's soft heaps. SODA 2009: 477-485
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim: Private coresets. STOC 2009: 361-370
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKe Chen, Haim Kaplan, Micha Sharir: Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Transactions on Algorithms 5(2): (2009)
141Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYoav Giyora, Haim Kaplan: Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Transactions on Algorithms 5(3): (2009)
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Natan Rubin, Micha Sharir: Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica 55(2): 283-310 (2009)
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates CoRR abs/0903.0625: (2009)
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Yahav Nussbaum: Maximum Flow in Directed Planar Graphs with Vertex Capacities CoRR abs/0905.0451: (2009)
137Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGyörgy Elekes, Haim Kaplan, Micha Sharir: On Lines, Joints, and Incidences in Three Dimensions CoRR abs/0905.1583: (2009)
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Micha Sharir, Eugenii Shustin: On lines and Joints CoRR abs/0906.0558: (2009)
135Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan, Subhabrata Sen: Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments CoRR abs/0906.4560: (2009)
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Envy-Free Makespan Approximation CoRR abs/0909.1072: (2009)
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Yahav Nussbaum: Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Discrete Applied Mathematics 157(15): 3216-3230 (2009)
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith 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)
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan, Subhabrata Sen: Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments. PVLDB 2(1): 646-657 (2009)
2008
130Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Nira Shafrir: Path Minima in Incremental Unrooted Trees. ESA 2008: 565-576
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Estimating Aggregates over Multiple Sets. ICDM 2008: 761-766
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky: Weak ε-nets and interval chains. SODA 2008: 1194-1203
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoshe Hershcovitch, Haim Kaplan: I/O Efficient Dynamic Data Structures for Longest Prefix Queries. SWAT 2008: 29-40
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Robert Endre Tarjan: Thin heaps, thick heaps. ACM Transactions on Algorithms 4(1): (2008)
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj 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)
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Sketch-Based Estimation of Subpopulation-Weight CoRR abs/0802.3448: (2008)
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Variance optimal sampling based estimation of subset sums CoRR abs/0803.0473: (2008)
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Natan Rubin, Micha Sharir: Line Transversals of Convex Polyhedra in R3 CoRR abs/0807.1221: (2008)
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nadav Grossaug, Haim Kaplan: Processing top-k queries from samples. Computer Networks 52(14): 2605-2622 (2008)
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky: Weak &epsis;-nets and interval chains. J. ACM 55(6): (2008)
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Tighter estimation using bottom k sketches. PVLDB 1(1): 213-224 (2008)
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin: Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38(3): 982-1011 (2008)
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdam 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
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Elad Verbin: Most Burrows-Wheeler Based Compressors Are Not Optimal. CPM 2007: 107-118
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Natan Rubin, Micha Sharir: Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA 2007: 287-298
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmos Fiat, Meital Levy, Haim Kaplan, Svetlana Olonetsky: Strong Price of Anarchy for Machine Load Balancing. Fair Division 2007
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky: Strong Price of Anarchy for Machine Load Balancing. ICALP 2007: 583-594
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith 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
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Summarizing data using bottom-k sketches. PODC 2007: 225-234
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Sketching unaggregated data streams for subpopulation-size queries. PODS 2007: 253-262
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Bottom-k sketches: better and more efficient estimation of aggregates. SIGMETRICS 2007: 353-354
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYoav Giyora, Haim Kaplan: Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. SODA 2007: 19-28
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin: Counting colors in boxes. SODA 2007: 785-794
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj K. Agarwal, Haim Kaplan, Micha Sharir: Computing the volume of the union of cubes. Symposium on Computational Geometry 2007: 294-301
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck: Better Landmarks Within Reach. WEA 2007: 38-51
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLoukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck: Data Structures for Mergeable Trees CoRR abs/0711.1682: (2007)
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiora Alexandron, Haim Kaplan, Micha Sharir: Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. 36(2): 144-158 (2007)
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Amos Fiat, Haim Kaplan: Associative search in peer to peer networks: Harnessing latent semantics. Computer Networks 51(8): 1861-1881 (2007)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga 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)
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Spatially-decaying aggregation over a network. J. Comput. Syst. Sci. 73(3): 265-288 (2007)
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKe 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)
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Shir Landau, Elad Verbin: A simpler analysis of Burrows-Wheeler-based compression. Theor. Comput. Sci. 387(3): 220-235 (2007)
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Tova Milo, Ronen Shabo: Compact Labeling Scheme for XML Ancestor Queries. Theory Comput. Syst. 40(1): 55-99 (2007)
2006
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Shir Landau, Elad Verbin: A Simpler Analysis of Burrows-Wheeler Based Compression. CPM 2006: 282-293
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nadav Grossaug, Haim Kaplan: Processing top k queries from samples. CoNEXT 2006: 7
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmos 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
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Micha Sharir: Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. SODA 2006: 484-493
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Yahav Nussbaum: A Simpler Linear-Time Recognition of Circular-Arc Graphs. SWAT 2006: 41-52
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Ely Porat, Nira Shafrir: Finding the Position of the k-Mismatch and Approximate Tandem Repeats. SWAT 2006: 90-101
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Micha Sharir, Elad Verbin: Colored intersection searching via sparse rectangular matrix multiplication. Symposium on Computational Geometry 2006: 52-60
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Yahav Nussbaum: Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. WG 2006: 289-300
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Nira Shafrir: The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97(1): 23-27 (2006)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArye Barkan, Haim Kaplan: Partial alphabetic trees. J. Algorithms 58(2): 81-103 (2006)
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe: Compact Labeling Scheme for Ancestor Queries. SIAM J. Comput. 35(6): 1295-1309 (2006)
2005
85no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Abiteboul, Bogdan Cautis, Amos Fiat, Haim Kaplan, Tova Milo: Secure Exchange of Modifiable Data and Queries. BDA 2005
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Eyal Kushilevitz, Yishay Mansour: Learning with attribute costs. STOC 2005: 356-365
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj 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
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiora Alexandron, Haim Kaplan, Micha Sharir: Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. WADS 2005: 269-281
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdam 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)
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Nira Shafrir: The greedy algorithm for shortest superstrings. Inf. Process. Lett. 93(1): 13-17 (2005)
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4): 602-626 (2005)
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Elad Verbin: Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. 70(3): 321-341 (2005)
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Eran Halperin, Haim Kaplan: Performance aspects of distributed caches using TTL-based consistency. Theor. Comput. Sci. 331(1): 73-96 (2005)
2004
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Spatially-decaying aggregation over a network: model and algorithms. SIGMOD Conference 2004: 707-718
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Efficient estimation algorithms for neighborhood variance and other moments. SODA 2004: 157-166
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYossi 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)
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Balanced-Replication Algorithms for Distribution Trees. SIAM J. Comput. 34(1): 227-247 (2004)
2003
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Elad Verbin: Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. CPM 2003: 170-185
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003: 56-
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Amos Fiat, Haim Kaplan: Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM 2003
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Amos Fiat, Haim Kaplan: Efficient sequences of trials. SODA 2003: 737-746
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke: Optimal oblivious routing in polynomial time. STOC 2003: 383-388
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Eyal Molad, Robert Endre Tarjan: Dynamic rectangular intersection with priorities. STOC 2003: 639-648
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Amos Fiat, Haim Kaplan: A case for associative peer to peer overlays. Computer Communication Review 33(1): 95-100 (2003)
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Proactive caching of DNS records: addressing a performance bottleneck. Computer Networks 41(6): 707-726 (2003)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmos Fiat, Haim Kaplan: Making data structures confluently persistent. J. Algorithms 48(1): 16-58 (2003)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan, Uri Zwick: Connection caching: model and algorithms. J. Comput. Syst. Sci. 67(1): 92-126 (2003)
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick: Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. 32(5): 1338-1355 (2003)
2002
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArye Barkan, Haim Kaplan: Partial Alphabetic Trees. ESA 2002: 114-125
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Balanced-Replication Algorithms for Distribution Trees. ESA 2002: 297-309
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour: Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop 2002: 307-320
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan, Tova Milo: Labeling Dynamic XML Trees. PODS 2002: 271-281
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Nira Shafrir, Robert Endre Tarjan: Union-find with deletions. SODA 2002: 19-28
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick: Reachability and distance queries via 2-hop labels. SODA 2002: 937-946
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Tova Milo, Ronen Shabo: A comparison of labeling schemes for ancestor queries. SODA 2002: 954-963
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe: Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002: 258-264
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Nira Shafrir, Robert Endre Tarjan: Meldable heaps and boolean union-find. STOC 2002: 573-582
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica 32(3): 459-466 (2002)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica 33(3): 300-334 (2002)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan, Uri Zwick: Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33(4): 511-516 (2002)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdam 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)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Refreshment policies for Web content caches. Computer Networks 38(6): 795-808 (2002)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Prefetching the means for document transfer: a new approach for reducing Web latency. Computer Networks 39(4): 437-455 (2002)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYehuda 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)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga 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)
2001
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Eran Halperin, Haim Kaplan: Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001: 744-756
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Refreshment Policies for Web Content Caches. INFOCOM 2001: 1398-1406
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001: 43-52
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT 2001: 85-94
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM 2001: 41-53
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001: 316-317
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmos Fiat, Haim Kaplan: Making data structures confluently persistent. SODA 2001: 537-546
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge Abiteboul, Haim Kaplan, Tova Milo: Compact labeling schemes for ancestor queries. SODA 2001: 547-556
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis: Faster kinetic heaps and their use in broadcast scheduling. SODA 2001: 836-844
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: The Age Penalty and Its Effect on Cache Performance. USITS 2001: 73-84
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan, Uri Zwick: Competitive Analysis of the LRFU Paging Algorithm. WADS 2001: 148-154
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Tova Milo: Short and Simple Labels for Small Distances and Other Functions. WADS 2001: 246-257
31no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarold N. Gabow, Haim Kaplan, Robert Endre Tarjan: Unique Maximum Matching Algorithms. J. Algorithms 40(2): 159-183 (2001)
2000
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern: Scalable Secure Storage when Half the System Is Faulty. ICALP 2000: 576-587
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM 2000: 854-863
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan, Uri Zwick: Connection caching under vaious models of communication. SPAA 2000: 54-63
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Chris Okasaki, Robert Endre Tarjan: Simple Confluently Persistent Catenable Lists. SIAM J. Comput. 30(3): 965-977 (2000)
1999
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Mario Szegedy: On-line Complexity of Monotone Set Systems. SODA 1999: 507-516
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: LP-based Analysis of Greedy-dual-size. SODA 1999: 879-880
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Martin Strauss, Mario Szegedy: Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. SODA 1999: 935-936
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan: Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC 1999: 109-118
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan, Uri Zwick: Connection Caching. STOC 1999: 612-621
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarold N. Gabow, Haim Kaplan, Robert Endre Tarjan: Unique Maximum Matching Algorithms. STOC 1999: 70-78
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Ron Shamir: Bounded Degree Interval Sandwich Problems. Algorithmica 24(2): 96-104 (1999)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Haim Kaplan, Jeffrey D. Oldham: Managing TCP Connections Under Persistent HTTP. Computer Networks 31(11-16): 1709-1723 (1999)
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim 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)
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim 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
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Haim Kaplan: Cell Flipping in Permutation Diagrams. STACS 1998: 577-586
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdam 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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Chris Okasaki, Robert Endre Tarjan: Simple Confluently Persistent Catenable Lists (Extended Abstract). SWAT 1998: 119-130
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdam 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
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Ron Shamir, Robert Endre Tarjan: Faster and simpler algorithm for sorting signed permutations by reversals. RECOMB 1997: 163
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Ron Shamir, Robert Endre Tarjan: Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SODA 1997: 344-351
1996
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSanjeev 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
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Ron Shamir: Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. ISTCS 1996: 195-201
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Robert Endre Tarjan: Purely Functional Representations of Catenable Sorted Lists. STOC 1996: 202-211
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Ron Shamir: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques. SIAM J. Comput. 25(3): 540-561 (1996)
1995
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Robert Endre Tarjan: Persistent lists with catenation via recursive slow-down. STOC 1995: 93-102
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Haim Kaplan, Ron Shamir: Graph Sandwich Problems. J. Algorithms 19(3): 449-473 (1995)
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaul 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
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim 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
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHaim Kaplan, Ron Shamir: The Domatic Number Problem on Some Perfect Graph Families. Inf. Process. Lett. 49(1): 51-56 (1994)
1993
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Charles Golumbic, Haim Kaplan, Ron Shamir: Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG 1993: 57-69

Coauthor Index

1Serge Abiteboul [36] [85] [86]
2Yehuda Afek [38] [41] [45]
3Pankaj K. Agarwal [83] [106] [125]
4Giora Alexandron [82] [103]
5Noga Alon [30] [44] [101] [120] [128]
6Stephen Alstrup [53] [86]
7Sanjeev Arora [10]
8Yossi Azar [67] [73]
9Arye Barkan [60] [87]
10Sergey Bereg (Sergei Bespamyatnikh) [83]
11Anat Bremler-Barr [38] [41] [45] [58]
12Adam L. Buchsbaum [13] [15] [48] [81] [117]
13Bogdan Cautis [85]
14Ke Chen [99] [142]
15Edith Cohen [19] [22] [23] [25] [28] [29] [33] [34] [38] [39] [40] [41] [42] [43] [45] [46] [47] [49] [50] [51] [55] [57] [58] [59] [61] [62] [64] [65] [67] [68] [69] [72] [73] [74] [75] [76] [95] [100] [102] [109] [110] [111] [112] [119] [121] [123] [124] [129] [131] [132] [134] [135] [139] [146] [147]
16Ovidiu Daescu [83]
17Nick G. Duffield [110] [112] [123] [132] [146]
18György Elekes [137]
19Dan Feldman [143]
20Michal Feldman [134]
21Amos Fiat [37] [63] [65] [67] [68] [69] [73] [85] [94] [99] [102] [113] [114] [134] [143]
22Alan M. Frieze [10]
23Harold N. Gabow [21] [31]
24Cyril Gavoille [53]
25Loukas Georgiadis [104] [117]
26Yoav Giyora [108] [141]
27Andrew V. Goldberg [105]
28Paul W. Goldberg [4]
29Martin Charles Golumbic [1] [4] [5] [16] [80]
30Nadav Grossaug [95] [121]
31Eran Halperin [43] [55] [61] [76]
32Moshe Hershcovitch [127]
33Michael Krivelevich [30] [44] [101]
34Eyal Kushilevitz [84]
35Shir Landau [96] [98]
36Meital Levy [94] [99] [113] [114]
37Moshe Lewenstein [70] [78]
38Carsten Lund [110] [112] [123] [132] [146]
39Dahlia Malkhi (Dalia Malki) [30] [44] [101]
40Yishay Mansour [58] [84]
41Jirí Matousek [99]
42Michael Merritt [38] [41] [45]
43Tova Milo [32] [36] [54] [57] [85] [86] [97]
44Eyal Molad [66]
45Elchanan Mossel [99]
46Kobbi Nissim [143]
47Gabriel Nivasch [120] [128]
48Simeon C. Ntafos [83]
49Yahav Nussbaum [89] [92] [133] [138] [148]
50Chris Okasaki [14] [27]
51Jeffrey D. Oldham [19]
52Svetlana Olonetsky [94] [113] [114] [134]
53János Pach [99]
54Ely Porat [91]
55Harald Räcke [67] [73]
56Theis Rauhe [53] [86]
57Anne Rogers [13] [15] [48] [81] [117]
58Natan Rubin [107] [115] [118] [122] [140] [145]
59Subhabrata Sen [131] [135]
60Ronen Shabo [54] [94] [97]
61Nira Shafrir [52] [56] [70] [78] [79] [88] [91] [104] [130]
62Ron Shamir [1] [2] [3] [4] [5] [7] [9] [11] [12] [17] [18] [20]
63Micha Sharir [82] [90] [93] [99] [103] [106] [107] [115] [118] [120] [122] [125] [128] [136] [137] [140] [142] [145]
64Eugenii Shustin [136]
65Shakhar Smorodinsky [99] [120] [128]
66Julien P. Stern [30] [44] [101]
67Martin Strauss (Martin J. Strauss) [24]
68Maxim Sviridenko [70] [78]
69Mario Szegedy [24] [26]
70Robert Endre Tarjan [3] [6] [8] [11] [12] [14] [17] [18] [21] [27] [31] [35] [52] [56] [66] [104] [117] [126]
71Mikkel Thorup [110] [112] [123] [132] [146]
72Kostas Tsioutsiouliklis [35]
73Elad Verbin [71] [77] [80] [90] [96] [98] [107] [116] [118]
74Uli Wagner [99]
75Emo Welzl [99]
76Renato Fonseca F. Werneck [104] [105]
77Jeffery Westbrook [13] [15] [48] [81] [117]
78Binhai Zhu [83]
79Uri Zwick [22] [28] [33] [49] [55] [61] [62] [144]

Colors in the list of coauthors

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)