The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Haim Kaplan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Serge Abiteboul, Bogdan Cautis, Amos Fiat, Haim Kaplan, Tova Milo
    Secure Exchange of Modifiable Data and Queries. [Citation Graph (0, 0)][DBLP]
    BDA, 2005, pp:- [Conf]
  2. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu
    Guarding a terrain by two watchtowers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:346-355 [Conf]
  3. Haim Kaplan, Micha Sharir, Elad Verbin
    Colored intersection searching via sparse rectangular matrix multiplication. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:52-60 [Conf]
  4. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
    Computing the volume of the union of cubes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:294-301 [Conf]
  5. Haim Kaplan, Shir Landau, Elad Verbin
    A Simpler Analysis of Burrows-Wheeler Based Compression. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:282-293 [Conf]
  6. Haim Kaplan, Elad Verbin
    Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. [Citation Graph (0, 0)][DBLP]
    CPM, 2003, pp:170-185 [Conf]
  7. Arye Barkan, Haim Kaplan
    Partial Alphabetic Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:114-125 [Conf]
  8. Edith Cohen, Haim Kaplan
    Balanced-Replication Algorithms for Distribution Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:297-309 [Conf]
  9. Sanjeev Arora, Alan M. Frieze, Haim Kaplan
    A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:21-30 [Conf]
  10. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
    Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:56-0 [Conf]
  11. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
    Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:780-791 [Conf]
  12. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
    Scalable Secure Storage when Half the System Is Faulty. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:576-587 [Conf]
  13. Edith Cohen, Eran Halperin, Haim Kaplan
    Performance Aspects of Distributed Caches Using TTL-Based Consistency. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:744-756 [Conf]
  14. Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo
    On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:608-618 [Conf]
  15. Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour
    Predicting and bypassing end-to-end internet service degradations. [Citation Graph (0, 0)][DBLP]
    Internet Measurement Workshop, 2002, pp:307-320 [Conf]
  16. Edith Cohen, Amos Fiat, Haim Kaplan
    Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  17. Edith Cohen, Haim Kaplan
    Prefetching the Means for Document Transfer: A New Approach for Reducing Web Latency. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:854-863 [Conf]
  18. Edith Cohen, Haim Kaplan
    Refreshment Policies for Web Content Caches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1398-1406 [Conf]
  19. Haim Kaplan, Ron Shamir
    Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:195-201 [Conf]
  20. Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
    Restoration by path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:43-52 [Conf]
  21. Edith Cohen, Haim Kaplan, Tova Milo
    Labeling Dynamic XML Trees. [Citation Graph (0, 0)][DBLP]
    PODS, 2002, pp:271-281 [Conf]
  22. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
    Faster and simpler algorithm for sorting signed permutations by reversals. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:163- [Conf]
  23. Edith Cohen, Haim Kaplan
    Proactive Caching of DNS Records: Addressing a Performance Bottleneck. [Citation Graph (0, 0)][DBLP]
    SAINT, 2001, pp:85-94 [Conf]
  24. Edith Cohen, Haim Kaplan
    Aging through cascaded caches: performance issues in the distribution of web content. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2001, pp:41-53 [Conf]
  25. Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
    Restoration path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2001, pp:316-317 [Conf]
  26. Edith Cohen, Haim Kaplan
    Spatially-decaying aggregation over a network: model and algorithms. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:707-718 [Conf]
  27. Serge Abiteboul, Haim Kaplan, Tova Milo
    Compact labeling schemes for ancestor queries. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:547-556 [Conf]
  28. Edith Cohen, Amos Fiat, Haim Kaplan
    Efficient sequences of trials. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:737-746 [Conf]
  29. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
    Reachability and distance queries via 2-hop labels. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:937-946 [Conf]
  30. Edith Cohen, Haim Kaplan
    Efficient estimation algorithms for neighborhood variance and other moments. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:157-166 [Conf]
  31. Edith Cohen, Haim Kaplan
    LP-based Analysis of Greedy-dual-size. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:879-880 [Conf]
  32. Amos Fiat, Haim Kaplan
    Making data structures confluently persistent. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:537-546 [Conf]
  33. Haim Kaplan, Tova Milo, Ronen Shabo
    A comparison of labeling schemes for ancestor queries. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:954-963 [Conf]
  34. Haim Kaplan, Micha Sharir
    Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:484-493 [Conf]
  35. Haim Kaplan, Mario Szegedy
    On-line Complexity of Monotone Set Systems. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:507-516 [Conf]
  36. Haim Kaplan, Martin Strauss, Mario Szegedy
    Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:935-936 [Conf]
  37. Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
    Union-find with deletions. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:19-28 [Conf]
  38. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
    Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:344-351 [Conf]
  39. Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis
    Faster kinetic heaps and their use in broadcast scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:836-844 [Conf]
  40. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
    Nearest common ancestors: a survey and a new distributed algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:258-264 [Conf]
  41. Edith Cohen, Haim Kaplan, Uri Zwick
    Connection caching under vaious models of communication. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:54-63 [Conf]
  42. Martin Charles Golumbic, Haim Kaplan
    Cell Flipping in Permutation Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:577-586 [Conf]
  43. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
    Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:383-388 [Conf]
  44. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook
    Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:279-288 [Conf]
  45. Edith Cohen, Haim Kaplan
    Exploiting Regularities in Web Traffic Patterns for Cache Replacement. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:109-118 [Conf]
  46. Edith Cohen, Haim Kaplan, Uri Zwick
    Connection Caching. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:612-621 [Conf]
  47. Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
    Unique Maximum Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:70-78 [Conf]
  48. Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
    Learning with attribute costs. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:356-365 [Conf]
  49. Haim Kaplan, Eyal Molad, Robert Endre Tarjan
    Dynamic rectangular intersection with priorities. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:639-648 [Conf]
  50. Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
    Meldable heaps and boolean union-find. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:573-582 [Conf]
  51. Haim Kaplan, Robert Endre Tarjan
    Persistent lists with catenation via recursive slow-down. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:93-102 [Conf]
  52. Haim Kaplan, Robert Endre Tarjan
    Purely Functional Representations of Catenable Sorted Lists. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:202-211 [Conf]
  53. Haim Kaplan, Yahav Nussbaum
    A Simpler Linear-Time Recognition of Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:41-52 [Conf]
  54. Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
    Simple Confluently Persistent Catenable Lists (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:119-130 [Conf]
  55. Haim Kaplan, Ely Porat, Nira Shafrir
    Finding the Position of the k-Mismatch and Approximate Tandem Repeats. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:90-101 [Conf]
  56. Edith Cohen, Haim Kaplan
    The Age Penalty and Its Effect on Cache Performance. [Citation Graph (0, 0)][DBLP]
    USITS, 2001, pp:73-84 [Conf]
  57. Giora Alexandron, Haim Kaplan, Micha Sharir
    Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:269-281 [Conf]
  58. Edith Cohen, Haim Kaplan, Uri Zwick
    Competitive Analysis of the LRFU Paging Algorithm. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:148-154 [Conf]
  59. Haim Kaplan, Tova Milo
    Short and Simple Labels for Small Distances and Other Functions. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:246-257 [Conf]
  60. Martin Charles Golumbic, Haim Kaplan, Ron Shamir
    Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:57-69 [Conf]
  61. Haim Kaplan, Yahav Nussbaum
    Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:289-300 [Conf]
  62. Edith Cohen, Haim Kaplan
    Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:3, pp:459-466 [Journal]
  63. Edith Cohen, Haim Kaplan
    Exploiting Regularities in Web Traffic Patterns for Cache Replacement. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:3, pp:300-334 [Journal]
  64. Edith Cohen, Haim Kaplan, Uri Zwick
    Competitive Analysis of the LRFU Paging Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:511-516 [Journal]
  65. Haim Kaplan, Ron Shamir
    Bounded Degree Interval Sandwich Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:2, pp:96-104 [Journal]
  66. Edith Cohen, Amos Fiat, Haim Kaplan
    A case for associative peer to peer overlays. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2003, v:33, n:1, pp:95-100 [Journal]
  67. Edith Cohen, Haim Kaplan
    Refreshment policies for Web content caches. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2002, v:38, n:6, pp:795-808 [Journal]
  68. Edith Cohen, Haim Kaplan
    Prefetching the means for document transfer: a new approach for reducing Web latency. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2002, v:39, n:4, pp:437-455 [Journal]
  69. Edith Cohen, Haim Kaplan
    Proactive caching of DNS records: addressing a performance bottleneck. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2003, v:41, n:6, pp:707-726 [Journal]
  70. Edith Cohen, Haim Kaplan, Jeffrey D. Oldham
    Managing TCP Connections Under Persistent HTTP. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 1999, v:31, n:11-16, pp:1709-1723 [Journal]
  71. Giora Alexandron, Haim Kaplan, Micha Sharir
    Kinetic and dynamic data structures for convex hulls and upper envelopes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:2, pp:144-158 [Journal]
  72. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook
    Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  73. Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt
    Restoration by path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:4, pp:273-283 [Journal]
  74. Martin Charles Golumbic, Haim Kaplan, Elad Verbin
    On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:296, n:1, pp:25-41 [Journal]
  75. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
    Scalable Secure Storage When Half the System Is Faulty. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:174, n:2, pp:203-213 [Journal]
  76. Haim Kaplan, Nira Shafrir
    The greedy algorithm for shortest superstrings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:1, pp:13-17 [Journal]
  77. Haim Kaplan, Nira Shafrir
    The greedy algorithm for edit distance with moves. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:1, pp:23-27 [Journal]
  78. Haim Kaplan, Ron Shamir
    The Domatic Number Problem on Some Perfect Graph Families. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:1, pp:51-56 [Journal]
  79. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:602-626 [Journal]
  80. Arye Barkan, Haim Kaplan
    Partial alphabetic trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:58, n:2, pp:81-103 [Journal]
  81. Amos Fiat, Haim Kaplan
    Making data structures confluently persistent. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:16-58 [Journal]
  82. Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
    Unique Maximum Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:40, n:2, pp:159-183 [Journal]
  83. Martin Charles Golumbic, Haim Kaplan, Ron Shamir
    Graph Sandwich Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:3, pp:449-473 [Journal]
  84. Paul W. Goldberg, Martin Charles Golumbic, Haim Kaplan, Ron Shamir
    Four Strikes Against Physical Mapping of DNA. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1995, v:2, n:1, pp:139-152 [Journal]
  85. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
    Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:383-394 [Journal]
  86. Edith Cohen, Haim Kaplan, Uri Zwick
    Connection caching: model and algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:1, pp:92-126 [Journal]
  87. Haim Kaplan, Elad Verbin
    Sorting signed permutations by reversals, revisited. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:3, pp:321-341 [Journal]
  88. Edith Cohen, Haim Kaplan
    Spatially-decaying aggregation over a network. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:3, pp:265-288 [Journal]
  89. Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe
    Compact Labeling Scheme for Ancestor Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1295-1309 [Journal]
  90. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
    Reachability and Distance Queries via 2-Hop Labels. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1338-1355 [Journal]
  91. Edith Cohen, Haim Kaplan
    Balanced-Replication Algorithms for Distribution Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:227-247 [Journal]
  92. Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
    Simple Confluently Persistent Catenable Lists. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:965-977 [Journal]
  93. Haim Kaplan, Ron Shamir
    Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:3, pp:540-561 [Journal]
  94. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
    A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:880-892 [Journal]
  95. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
    Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1906-1922 [Journal]
  96. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
  97. Edith Cohen, Eran Halperin, Haim Kaplan
    Performance aspects of distributed caches using TTL-based consistency. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:73-96 [Journal]
  98. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook
    A New, Simpler Linear-Time Dominators Algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1998, v:20, n:6, pp:1265-1296 [Journal]
  99. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook
    Corrigendum: a new, simpler linear-time dominators algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2005, v:27, n:3, pp:383-387 [Journal]
  100. Haim Kaplan, Elad Verbin
    Most Burrows-Wheeler Based Compressors Are Not Optimal. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:107-118 [Conf]
  101. Haim Kaplan, Natan Rubin, Micha Sharir
    Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:287-298 [Conf]
  102. Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky
    Strong Price of Anarchy for Machine Load Balancing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:583-594 [Conf]
  103. Edith Cohen, Haim Kaplan
    Summarizing data using bottom-k sketches. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:225-234 [Conf]
  104. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
    Sketching unaggregated data streams for subpopulation-size queries. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:253-262 [Conf]
  105. Edith Cohen, Haim Kaplan
    Bottom-k sketches: better and more efficient estimation of aggregates. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2007, pp:353-354 [Conf]
  106. Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
    Counting colors in boxes. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:785-794 [Conf]
  107. Yoav Giyora, Haim Kaplan
    Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:19-28 [Conf]
  108. Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck
    Better Landmarks Within Reach. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:38-51 [Conf]
  109. Edith Cohen, Amos Fiat, Haim Kaplan
    Associative search in peer to peer networks: Harnessing latent semantics. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2007, v:51, n:8, pp:1861-1881 [Journal]
  110. 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]. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:7, pp:1114-1116 [Journal]
  111. Haim Kaplan, Tova Milo, Ronen Shabo
    Compact Labeling Scheme for XML Ancestor Queries. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:1, pp:55-99 [Journal]

  112. A kinetic triangulation scheme for moving points in the plane. [Citation Graph (, )][DBLP]


  113. Kinetic stable Delaunay graphs. [Citation Graph (, )][DBLP]


  114. Strong Price of Anarchy for Machine Load Balancing. [Citation Graph (, )][DBLP]


  115. Path Minima in Incremental Unrooted Trees. [Citation Graph (, )][DBLP]


  116. Maximum Flow in Directed Planar Graphs with Vertex Capacities. [Citation Graph (, )][DBLP]


  117. Optimal Cover of Points by Disks in a Simple Polygon. [Citation Graph (, )][DBLP]


  118. Estimating Aggregates over Multiple Sets. [Citation Graph (, )][DBLP]


  119. Algorithms and estimators for accurate summarization of internet traffic. [Citation Graph (, )][DBLP]


  120. Envy-free makespan approximation: extended abstract. [Citation Graph (, )][DBLP]


  121. Leveraging discarded samples for tighter estimation of multiple-set aggregates. [Citation Graph (, )][DBLP]


  122. Weak ε-nets and interval chains. [Citation Graph (, )][DBLP]


  123. Stream sampling for variance-optimal estimation of subset sums. [Citation Graph (, )][DBLP]


  124. A simpler implementation and analysis of Chazelle's soft heaps. [Citation Graph (, )][DBLP]


  125. Line transversals of convex polyhedra in R3. [Citation Graph (, )][DBLP]


  126. Private coresets. [Citation Graph (, )][DBLP]


  127. I/O Efficient Dynamic Data Structures for Longest Prefix Queries. [Citation Graph (, )][DBLP]


  128. Improved Recommendations via (More) Collaboration. [Citation Graph (, )][DBLP]


  129. Processing top k queries from samples. [Citation Graph (, )][DBLP]


  130. Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. [Citation Graph (, )][DBLP]


  131. Processing top-k queries from samples. [Citation Graph (, )][DBLP]


  132. Data Structures for Mergeable Trees [Citation Graph (, )][DBLP]


  133. Sketch-Based Estimation of Subpopulation-Weight [Citation Graph (, )][DBLP]


  134. Variance optimal sampling based estimation of subset sums [Citation Graph (, )][DBLP]


  135. Line Transversals of Convex Polyhedra in R3 [Citation Graph (, )][DBLP]


  136. Leveraging Discarded Samples for Tighter Estimation of Multiple-Set Aggregates [Citation Graph (, )][DBLP]


  137. Maximum Flow in Directed Planar Graphs with Vertex Capacities [Citation Graph (, )][DBLP]


  138. On Lines, Joints, and Incidences in Three Dimensions [Citation Graph (, )][DBLP]


  139. On lines and Joints [Citation Graph (, )][DBLP]


  140. Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments [Citation Graph (, )][DBLP]


  141. Envy-Free Makespan Approximation [Citation Graph (, )][DBLP]


  142. Truth and Envy in Capacitated Allocation Games [Citation Graph (, )][DBLP]


  143. On the Interplay between Incentive Compatibility and Envy Freeness [Citation Graph (, )][DBLP]


  144. A Kinetic Triangulation Scheme for Moving Points in The Plane [Citation Graph (, )][DBLP]


  145. Improved Bounds for Geometric Permutations [Citation Graph (, )][DBLP]


  146. Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. [Citation Graph (, )][DBLP]


Search in 0.075secs, Finished in 0.083secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002