No photo of Haim Kaplan

View Scopus Profile

Haim Kaplan

Professor

1994 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2007

    Better landmarks within reach

    Goldberg, A. V., Kaplan, H. & Werneck, R. F., 2007, Experimental Algorithms - 6th International Workshop, WEA 2007, Proceedings. Springer Verlag, p. 38-51 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4525 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    47 Scopus citations

  • Bottom-k sketches: Better and more efficient estimation of aggregates

    Cohen, E. & Kaplan, H., 2007, SIGMETRICS'07 - Proceedings of the 2007 International Conference on Measurement and Modeling of Computer Systems. 1 ed. p. 353-354 2 p. (Performance Evaluation Review; vol. 35, no. 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    13 Scopus citations

  • Computing the volume of the union of cubes

    Agarwal, P. K., Kaplan, H. & Sharir, M., 2007, Proceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07. p. 294-301 8 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    17 Scopus citations

  • Counting colors in boxes

    Kaplan, H., Rubin, N., Sharir, M. & Verbin, E., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 785-794 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    26 Scopus citations

  • Linear data structures for fast ray-shooting amidst convex polyhedra

    Kaplan, H., Rubin, N. & Sharir, M., 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 287-298 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations

  • Most Burrows-Wheeler based compressors are not optimal

    Kaplan, H. & Verbin, E., 2007, Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Springer Verlag, p. 107-118 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4580 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    14 Scopus citations

  • Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

    Giyora, Y. & Kaplan, H., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 19-28 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    9 Scopus citations

  • Sketching unaggregated data streams for subpopulation-size queries

    Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, M., 2007, Proceedings of the Twenty-sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2007. p. 253-262 10 p. (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    14 Scopus citations

  • Strong price of anarchy for machine load balancing

    Fiat, A., Kaplan, H., Levy, M. & Olonetsky, S., 2007, Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. Springer Verlag, p. 583-594 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4596 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    51 Scopus citations

  • Summarizing data using bottom-k sketches

    Cohen, E. & Kaplan, H., 2007, PODC'07: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. p. 225-234 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    85 Scopus citations
  • 2006

    A simpler analysis of burrows-wheeler based compression

    Kaplan, H., Landau, S. & Verbin, E., 2006, Combinatorial Pattern Matching - 17th Annual Symposium, CPM 2006, Proceedings. Springer Verlag, p. 282-293 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4009 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    8 Scopus citations

  • A simpler linear-time recognition of circular-arc graphs

    Kaplan, H. & Nussbaum, Y., 2006, Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings. Springer Verlag, p. 41-52 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4059 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    14 Scopus citations

  • Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs

    Kaplan, H. & Nussbaum, Y., 2006, Graph-Theoretic Concepts in Computer Science - 32nd International Workshop, WG 2006, Revised Papers. Springer Verlag, p. 289-300 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4271 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    10 Scopus citations

  • Colored intersection searching via sparse rectangular matrix multiplication

    Kaplan, H., Sharir, M. & Verbin, E., 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Association for Computing Machinery (ACM), p. 52-60 9 p. (Proceedings of the Annual Symposium on Computational Geometry; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    45 Scopus citations

  • Finding the position of the k-mismatch and approximate tandem repeats

    Kaplan, H., Porat, E. & Shafrir, N., 2006, Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings. Springer Verlag, p. 90-101 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4059 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • On the price of stability for designing undirected networks with fair cost allocations

    Fiat, A., Kaplan, H., Levy, M., Olonetsky, S. & Shabo, R., 2006, Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. Springer Verlag, p. 608-618 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4051 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    77 Scopus citations

  • Processing top-k queries from samples

    Cohen, E., Grossaug, N. & Kaplan, H., 2006, Proceedings of CoNEXT'06 - 2nd Conference on Future Networking Technologies. 7. (Proceedings of CoNEXT'06 - 2nd Conference on Future Networking Technologies).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    5 Scopus citations

  • Reach for A*: Efficient point-to-point shortest path algorithms

    Goldberg, A. V., Kaplan, H. & Werneck, R. F., 2006, Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Society for Industrial and Applied Mathematics (SIAM), p. 129-143 15 p. (Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    146 Scopus citations
  • 2005

    Secure Exchange of Modifiable Data and Queries

    Abiteboul, S., Cautis, B., Fiat, A., Kaplan, H. & Milo, T., 2005, 21èmes Journées Bases de Données Avancées, BDA 2005, Saint Malo, France, 17-20 octobre 2005, Actes (Informal Proceedings). Benzaken, V. (ed.).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2003

    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

    Kaplan, H., Lewenstein, M., Shafrir, N. & Sviridenko, M., 2003, Proceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003. IEEE Computer Society, p. 56-65 10 p. 1238181. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2003-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    19 Scopus citations
  • 2002

    A comparison of labeling schemes for ancestor queries

    Kaplan, H., Milo, T. & Shabo, R., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 954-963 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    85 Scopus citations

  • Balanced-replication algorithms for distribution trees

    Cohen, E. & Kaplan, H., 2002, Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Möhring, R. & Raman, R. (eds.). Springer Verlag, p. 297-309 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2461).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • Partial alphabetic trees

    Barkan, A. & Kaplan, H., 2002, Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Möhring, R. & Raman, R. (eds.). Springer Verlag, p. 114-125 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2461).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • Predicting and Bypassing End-to-End Internet Service Degradations

    Bremler-Barr, A., Cohen, E., Kaplan, H. & Mansour, Y., 2002, Proceedings of the 2nd Internet Measurement Workshop (IMW 2002). Association for Computing Machinery (ACM), p. 307-320 14 p. (Proceedings of the 2nd Internet Measurement Workshop (IMW 2002)).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • Reachability and distance queries via 2-hop labels

    Cohen, E., Halperin, E., Kaplan, H. & Zwick, U., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 937-946 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    176 Scopus citations

  • Union-find with deletions

    Kaplan, H., Shafrir, N. & Tarjan, R. E., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 19-28 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    24 Scopus citations
  • 2001

    Compact labeling schemes for ancestor queries

    Abiteboul, S., Kaplan, H. & Milo, T., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 547-556 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    104 Scopus citations

  • Competitive analysis of the LRFU paging algorithm

    Cohen, E., Kaplan, H. & Zwick, U., 2001, Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. Dehne, F., Sack, J.-R. & Tamassia, R. (eds.). Springer Verlag, p. 148-154 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2125).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Faster kinetic heaps and their use in broadcast scheduling

    Kaplan, H., Tarjan, R. E. & Tsioutsiouliklis, K., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 836-844 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    17 Scopus citations

  • Making data structures confluently persistent

    Fiat, A. & Kaplan, H., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 537-546 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    10 Scopus citations

  • Performance aspects of distributed caches using TTL-based consistency

    Cohen, E., Halperin, E. & Kaplan, H., 2001, Automata, Languages and Programming - 28th International Colloquium, ICALP 2001, Proceedings. Orejas, F., Spirakis, P. G. & van Leeuwen, J. (eds.). Springer Verlag, p. 744-756 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2076 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • Proactive caching of DNS records: Addressing a performance bottleneck

    Cohen, E. & Kaplan, H., 2001, Proceedings - 2001 Symposium on Applications and the Internet, SAINT 2001. Institute of Electrical and Electronics Engineers Inc., p. 85-94 10 p. 905171. (Proceedings - 2001 Symposium on Applications and the Internet, SAINT 2001).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    53 Scopus citations

  • Restoration by Path Concatenation: Fast Recovery of MPLS Paths

    Bremler-Barr, A., Afek, Y., Kaplan, H., Cohen, E. & Merritt, M., 2001, Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing. New York, NY, USA: Association for Computing Machinery (ACM), p. 43–52 (PODC '01).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Short and simple labels for small distances and other functions

    Kaplan, H. & Milo, T., 2001, Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. Dehne, F., Sack, J.-R. & Tamassia, R. (eds.). Springer Verlag, p. 246-257 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2125).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    27 Scopus citations

  • The age penalty and its effect on cache performance

    Cohen, E. & Kaplan, H., 2001, 3rd USENIX Symposium on Internet Technologies and Systems, USITS 2001. USENIX Association, (3rd USENIX Symposium on Internet Technologies and Systems, USITS 2001).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    16 Scopus citations
  • 2000

    Scalable secure storage when half the system is faulty

    Alon, N., Kaplan, H., Krivelevich, M., Malkhi, D. & Stern, J., 2000, Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings. Montanari, U., Rolim, J. D. P. & Welzl, E. (eds.). Springer Verlag, p. 576-587 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1853).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    28 Scopus citations
  • 1998

    Cell flipping in permutation diagrams

    Golumbic, M. C. & Kaplang, H., 1998, STACS 98 - 15th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. p. 577-586 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1373 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • Simple confluently persistent catenable lists

    Kaplan, H., Okasaki, C. & Tarjan, R. E., 1998, Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. Arnborg, S. & Ivansson, L. (eds.). Springer Verlag, p. 119-130 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1432).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations
  • 1996

    Purely functional representations of catenable sorted lists

    Kaplan, H. & Tarjan, R. E., 1 Jul 1996, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996. Association for Computing Machinery, p. 202-211 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129452).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    28 Scopus citations
  • 1994

    Algorithms and complexity of sandwich problems in graphs

    Golumbic, M. C., Kaplan, H. & Shamir, R., 1994, Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings. van Leeuwen, J. (ed.). Springer Verlag, p. 57-69 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 790 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations