| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Haim Kaplan 57 Arye Barkan , Haim Kaplan: Partial Alphabetic Trees. ESA 2002 : 114-125 56 Edith Cohen , Haim Kaplan: Balanced-Replication Algorithms for Distribution Trees. ESA 2002 : 297-309 55 Edith Cohen , Haim Kaplan, Tova Milo : Labeling Dynamic XML Trees. PODS 2002 : 271-281 54 Haim Kaplan, Nira Shafrir , Robert Endre Tarjan : Union-find with deletions. SODA 2002 : 19-28 53 Edith Cohen , Eran Halperin , Haim Kaplan, Uri Zwick : Reachability and distance queries via 2-hop labels. SODA 2002 : 937-946 52 Haim Kaplan, Tova Milo , Ronen Shabo : A comparison of labeling schemes for ancestor queries. SODA 2002 : 954-963 51 Stephen Alstrup , Cyril Gavoille , Haim Kaplan, Theis Rauhe : Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002 : 258-264 50 Haim Kaplan, Nira Shafrir , Robert Endre Tarjan : Meldable heaps and boolean union-find. STOC 2002 : 573-582 49 Edith Cohen , Haim Kaplan: Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica 32 (3): 459-466 (2002) 48 Edith Cohen , Haim Kaplan: Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica 33 (3): 300-334 (2002) 47 Edith Cohen , Haim Kaplan, Uri Zwick : Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33 (4): 511-516 (2002) 46 Edith Cohen , Haim Kaplan: Refreshment policies for Web content caches. Computer Networks 38 (6): 795-808 (2002) 45 Edith Cohen , Haim Kaplan: Prefetching the means for document transfer: a new approach for reducing Web latency. Computer Networks 39 (4): 437-455 (2002) 44 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) 43 Noga Alon , Haim Kaplan, Michael Krivelevich , Dahlia Malkhi , Julien P. Stern : Scalable Secure Storage When Half the System Is Faulty. Information and Computation 174 (2): 203-213 (2002) 42 Edith Cohen , Eran Halperin , Haim Kaplan: Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001 : 744-756 41 Edith Cohen , Haim Kaplan: Refreshment Policies for Web Content Caches. INFOCOM 2001 : 1398-1406 40 Anat Bremler-Barr , Yehuda Afek , Haim Kaplan, Edith Cohen , Michael Merritt : Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001 : 43-52 39 Edith Cohen , Haim Kaplan: Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT 2001 : 85-94 38 Edith Cohen , Haim Kaplan: Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM 2001 : 41-53 37 Anat Bremler-Barr , Yehuda Afek , Haim Kaplan, Edith Cohen , Michael Merritt : Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001 : 316-317 36 Amos Fiat , Haim Kaplan: Making data structures confluently persistent. SODA 2001 : 537-546 35 Serge Abiteboul , Haim Kaplan, Tova Milo : Compact labeling schemes for ancestor queries. SODA 2001 : 547-556 34 Haim Kaplan, Robert Endre Tarjan , Kostas Tsioutsiouliklis : Faster kinetic heaps and their use in broadcast scheduling. SODA 2001 : 836-844 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) 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) 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 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) 18 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) 17 Edith Cohen , Haim Kaplan, Jeffrey D. Oldham : Managing TCP Connections Under Persistent HTTP. WWW8 / Computer Networks 31 (11-16): 1709-1723 (1999) 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. TOPLAS 20 (6): 1265-1296 (1998) 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 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) 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 Biolog 2 (1): 139-152 (1995) 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. Information Processing Letters 49 (1): 51-56 (1994) 1 Martin Charles Golumbic , Haim Kaplan, Ron Shamir : Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG 1993 : 57-69  DiSC'03 © 2003 Association for Computing Machinery |
