| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Haim Kaplan Haim Kaplan, Nira Shafrir : The greedy algorithm for shortest superstrings. Inf. Process. Lett. 93 (1): 13-17 (2005) Edith Cohen , Eran Halperin , Haim Kaplan: Performance aspects of distributed caches using TTL-based consistency. Theor. Comput. Sci. 331 (1): 73-96 (2005) Edith Cohen , Haim Kaplan: Spatially-decaying aggregation over a network: model and algorithms. SIGMOD Conference 2004 : 707-718 Edith Cohen , Haim Kaplan: Efficient estimation algorithms for neighborhood variance and other moments. SODA 2004 : 157-166 Edith Cohen , Haim Kaplan: Balanced-Replication Algorithms for Distribution Trees. SIAM J. Comput. 34 (1): 227-247 (2004) Haim Kaplan, Elad Verbin : Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. CPM 2003 : 170-185 Haim Kaplan, Moshe Lewenstein , Nira Shafrir , Maxim Sviridenko : Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003 : 56- Edith Cohen , Amos Fiat , Haim Kaplan: Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM 2003 Edith Cohen , Amos Fiat , Haim Kaplan: Efficient sequences of trials. SODA 2003 : 737-746 Yossi Azar , Edith Cohen , Amos Fiat , Haim Kaplan, Harald Räcke : Optimal oblivious routing in polynomial time. STOC 2003 : 383-388 Haim Kaplan, Eyal Molad , Robert Endre Tarjan : Dynamic rectangular intersection with priorities. STOC 2003 : 639-648 Edith Cohen , Amos Fiat , Haim Kaplan: A case for associative peer to peer overlays. Computer Communication Review 33 (1): 95-100 (2003) Edith Cohen , Haim Kaplan: Proactive caching of DNS records: addressing a performance bottleneck. Computer Networks 41 (6): 707-726 (2003) Amos Fiat , Haim Kaplan: Making data structures confluently persistent. J. Algorithms 48 (1): 16-58 (2003) Edith Cohen , Haim Kaplan, Uri Zwick : Connection caching: model and algorithms. J. Comput. Syst. Sci. 67 (1): 92-126 (2003) Edith Cohen , Eran Halperin , Haim Kaplan, Uri Zwick : Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. 32 (5): 1338-1355 (2003) Arye Barkan , Haim Kaplan: Partial Alphabetic Trees. ESA 2002 : 114-125 Edith Cohen , Haim Kaplan: Balanced-Replication Algorithms for Distribution Trees. ESA 2002 : 297-309 Anat Bremler-Barr , Edith Cohen , Haim Kaplan, Yishay Mansour : Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop 2002 : 307-320 Edith Cohen , Haim Kaplan, Tova Milo : Labeling Dynamic XML Trees. PODS 2002 : 271-281 Haim Kaplan, Nira Shafrir , Robert Endre Tarjan : Union-find with deletions. SODA 2002 : 19-28 Edith Cohen , Eran Halperin , Haim Kaplan, Uri Zwick : Reachability and distance queries via 2-hop labels. SODA 2002 : 937-946 Haim Kaplan, Tova Milo , Ronen Shabo : A comparison of labeling schemes for ancestor queries. SODA 2002 : 954-963 Stephen Alstrup , Cyril Gavoille , Haim Kaplan, Theis Rauhe : Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002 : 258-264 Haim Kaplan, Nira Shafrir , Robert Endre Tarjan : Meldable heaps and boolean union-find. STOC 2002 : 573-582 Edith Cohen , Haim Kaplan: Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica 32 (3): 459-466 (2002) Edith Cohen , Haim Kaplan: Exploiting Regularities in Web Traffic Patterns for Cache Replacement. Algorithmica 33 (3): 300-334 (2002) Edith Cohen , Haim Kaplan, Uri Zwick : Competitive Analysis of the LRFU Paging Algorithm. Algorithmica 33 (4): 511-516 (2002) 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) Edith Cohen , Haim Kaplan: Refreshment policies for Web content caches. Computer Networks 38 (6): 795-808 (2002) Edith Cohen , Haim Kaplan: Prefetching the means for document transfer: a new approach for reducing Web latency. Computer Networks 39 (4): 437-455 (2002) 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) 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) Edith Cohen , Eran Halperin , Haim Kaplan: Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001 : 744-756 Edith Cohen , Haim Kaplan: Refreshment Policies for Web Content Caches. INFOCOM 2001 : 1398-1406 Anat Bremler-Barr , Yehuda Afek , Haim Kaplan, Edith Cohen , Michael Merritt : Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001 : 43-52 Edith Cohen , Haim Kaplan: Proactive Caching of DNS Records: Addressing a Performance Bottleneck. SAINT 2001 : 85-94 Edith Cohen , Haim Kaplan: Aging through cascaded caches: performance issues in the distribution of web content. SIGCOMM 2001 : 41-53 Anat Bremler-Barr , Yehuda Afek , Haim Kaplan, Edith Cohen , Michael Merritt : Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001 : 316-317 Amos Fiat , Haim Kaplan: Making data structures confluently persistent. SODA 2001 : 537-546 Serge Abiteboul , Haim Kaplan, Tova Milo : Compact labeling schemes for ancestor queries. SODA 2001 : 547-556 Haim Kaplan, Robert Endre Tarjan , Kostas Tsioutsiouliklis : Faster kinetic heaps and their use in broadcast scheduling. SODA 2001 : 836-844 Edith Cohen , Haim Kaplan: The Age Penalty and Its Effect on Cache Performance. USITS 2001 : 73-84 Edith Cohen , Haim Kaplan, Uri Zwick : Competitive Analysis of the LRFU Paging Algorithm. WADS 2001 : 148-154 Haim Kaplan, Tova Milo : Short and Simple Labels for Small Distances and Other Functions. WADS 2001 : 246-257 Harold N. Gabow , Haim Kaplan, Robert Endre Tarjan : Unique Maximum Matching Algorithms. J. Algorithms 40 (2): 159-183 (2001) Noga Alon , Haim Kaplan, Michael Krivelevich , Dahlia Malkhi , Julien P. Stern : Scalable Secure Storage when Half the System Is Faulty. ICALP 2000 : 576-587 Edith Cohen , Haim Kaplan: Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. INFOCOM 2000 : 854-863 Edith Cohen , Haim Kaplan, Uri Zwick : Connection caching under vaious models of communication. SPAA 2000 : 54-63 Haim Kaplan, Chris Okasaki , Robert Endre Tarjan : Simple Confluently Persistent Catenable Lists. SIAM J. Comput. 30 (3): 965-977 (2000) Haim Kaplan, Mario Szegedy : On-line Complexity of Monotone Set Systems. SODA 1999 : 507-516 Edith Cohen , Haim Kaplan: LP-based Analysis of Greedy-dual-size. SODA 1999 : 879-880 Haim Kaplan, Martin Strauss , Mario Szegedy : Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. SODA 1999 : 935-936 Edith Cohen , Haim Kaplan: Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC 1999 : 109-118 Edith Cohen , Haim Kaplan, Uri Zwick : Connection Caching. STOC 1999 : 612-621 Harold N. Gabow , Haim Kaplan, Robert Endre Tarjan : Unique Maximum Matching Algorithms. STOC 1999 : 70-78 Haim Kaplan, Ron Shamir : Bounded Degree Interval Sandwich Problems. Algorithmica 24 (2): 96-104 (1999) Edith Cohen , Haim Kaplan, Jeffrey D. Oldham : Managing TCP Connections Under Persistent HTTP. Computer Networks 31 (11-16): 1709-1723 (1999) 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) 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) Martin Charles Golumbic , Haim Kaplan: Cell Flipping in Permutation Diagrams. STACS 1998 : 577-586 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 Haim Kaplan, Chris Okasaki , Robert Endre Tarjan : Simple Confluently Persistent Catenable Lists (Extended Abstract). SWAT 1998 : 119-130 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) Haim Kaplan, Ron Shamir , Robert Endre Tarjan : Faster and simpler algorithm for sorting signed permutations by reversals. RECOMB 1997 : 163 Haim Kaplan, Ron Shamir , Robert Endre Tarjan : Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SODA 1997 : 344-351 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 Haim Kaplan, Ron Shamir : Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. ISTCS 1996 : 195-201 Haim Kaplan, Robert Endre Tarjan : Purely Functional Representations of Catenable Sorted Lists. STOC 1996 : 202-211 Haim Kaplan, Ron Shamir : Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques. SIAM J. Comput. 25 (3): 540-561 (1996) Haim Kaplan, Robert Endre Tarjan : Persistent lists with catenation via recursive slow-down. STOC 1995 : 93-102 Martin Charles Golumbic , Haim Kaplan, Ron Shamir : Graph Sandwich Problems. J. Algorithms 19 (3): 449-473 (1995) 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) 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 Haim Kaplan, Ron Shamir : The Domatic Number Problem on Some Perfect Graph Families. Inf. Process. Lett. 49 (1): 51-56 (1994) Martin Charles Golumbic , Haim Kaplan, Ron Shamir : Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG 1993 : 57-69 1 [ 36 ] 2 [ 38 ] [ 41 ] [ 45 ] 3 [ 30 ] [ 44 ] 4 [ 53 ] 5 [ 10 ] 6 [ 67 ] 7 [ 60 ] 8 [ 38 ] [ 41 ] [ 45 ] [ 58 ] 9 [ 13 ] [ 15 ] [ 48 ] 10 [ 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 ] 11 [ 37 ] [ 63 ] [ 65 ] [ 67 ] [ 68 ] [ 69 ] 12 [ 10 ] 13 [ 21 ] [ 31 ] 14 [ 53 ] 15 [ 4 ] 16 [ 1 ] [ 4 ] [ 5 ] [ 16 ] 17 [ 43 ] [ 55 ] [ 61 ] [ 75 ] 18 [ 30 ] [ 44 ] 19 [ 70 ] 20 [ 30 ] [ 44 ] 21 [ 58 ] 22 [ 38 ] [ 41 ] [ 45 ] 23 [ 32 ] [ 36 ] [ 54 ] [ 57 ] 24 [ 66 ] 25 [ 14 ] [ 27 ] 26 [ 19 ] 27 [ 67 ] 28 [ 53 ] 29 [ 13 ] [ 15 ] [ 48 ] 30 [ 54 ] 31 [ 52 ] [ 56 ] [ 70 ] [ 76 ] 32 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 9 ] [ 11 ] [ 12 ] [ 17 ] [ 18 ] [ 20 ] 33 [ 30 ] [ 44 ] 34 [ 24 ] 35 [ 70 ] 36 [ 24 ] [ 26 ] 37 [ 3 ] [ 6 ] [ 8 ] [ 11 ] [ 12 ] [ 14 ] [ 17 ] [ 18 ] [ 21 ] [ 27 ] [ 31 ] [ 35 ] [ 52 ] [ 56 ] [ 66 ] 38 [ 35 ] 39 [ 71 ] 40 [ 13 ] [ 15 ] [ 48 ] 41 [ 22 ] [ 28 ] [ 33 ] [ 49 ] [ 55 ] [ 61 ] [ 62 ]  ©2005 Association for Computing Machinery |
