No photo of Haim Kaplan

View Scopus Profile

Haim Kaplan

Professor

1994 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2017

    Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays

    Azar, Y., Chiplunkar, A. & Kaplan, H., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 1051-1061 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

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

    Open Access
    32 Scopus citations
  • 2016

    Approximating the a;-level in three-dimensional plane arrangements

    Har-Peled, S., Kaplan, H. & Sharir, M., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 1193-1212 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2).

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

    4 Scopus citations

  • Bottleneck paths and trees and deterministic Graphical games

    Chechik, S., Kaplan, H., Thorup, M., Zamir, O. & Zwick, U., 1 Feb 2016, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. Vollmer, H. & Ollinger, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 47).

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

    2 Scopus citations

  • Routing in unit disk graphs

    Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 2016, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Proceedings. Navarro, G., Kranakis, E. & Chávez, E. (eds.). Springer Verlag, p. 536-548 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9644).

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

    2 Scopus citations
  • 2015

    Adjacency labeling schemes and induced-universal graphs

    Alstrup, S., Kaplan, H., Thorup, M. & Zwick, U., 14 Jun 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 625-634 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

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

    Open Access
    33 Scopus citations

  • Average distance queries through weighted samples in graphs and metric spaces: High scalability with tight statistical guarantees

    Chechik, S., Cohen, E. & Kaplan, H., 1 Aug 2015, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015. Garg, N., Jansen, K., Rao, A. & Rolim, J. D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 659-679 21 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 40).

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

    19 Scopus citations

  • Faster and more dynamic maximum flow by incremental breadth-first search

    Goldberg, A. V., Hed, S., Kaplan, H., Kohli, P., Tarjan, R. E. & Werneck, R. F., 2015, Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. Bansal, N. & Finocchi, I. (eds.). Springer Verlag, p. 619-630 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9294).

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

    32 Scopus citations

  • Hollow heaps

    Dueholm, T., Kaplan, H., Tarjan, R. E. & Zwick, U., 2015, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Halldorsson, M. M., Kobayashi, N., Speckmann, B. & Iwama, K. (eds.). Springer Verlag, p. 689-700 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9134).

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

    2 Scopus citations

  • Minimum cost flows in graphs with unit capacities

    Goldberg, A. V., Kaplan, H., Hed, S. & Tarjan, R. E., 1 Feb 2015, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015. Mayr, E. W. & Ollinger, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 406-419 14 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 30).

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

    7 Scopus citations

  • On the complexity of hub labeling

    Babenko, M., Goldberg, A. V., Kaplan, H., Savchenko, R. & Weller, M., 2015, Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Proceedings. Italiano, G. F., Pighizzini, G. & Sannella, D. T. (eds.). Springer Verlag, p. 62-74 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9235).

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

    11 Scopus citations

  • Spanners and Reachability Oracles for Directed Transmission Graphs

    Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 1 Jun 2015, 31st International Symposium on Computational Geometry, SoCG 2015. Pach, J., Pach, J. & Arge, L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 156-170 15 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 34).

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

    12 Scopus citations

  • The amortized cost of finding the minimum

    Kaplan, H., Zamir, O. & Zwick, U., 2015, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. January ed. Association for Computing Machinery, p. 757-768 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2015-January, no. January).

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

    Open Access
    2 Scopus citations

  • The temp secretary problem

    Fiat, A., Gorelik, I., Kaplan, H. & Novgorodov, S., 2015, Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. Bansal, N. & Finocchi, I. (eds.). Springer Verlag, p. 631-642 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9294).

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

    11 Scopus citations
  • 2014

    Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles

    Hansen, T. D., Kaplan, H. & Zwick, U., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 847-860 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    5 Scopus citations

  • The discrete Fréchet distance with shortcuts via approximate distance counting and selection

    Ben Avraham, R., Filtser, O., Kaplan, H., Katz, M. J. & Sharir, M., 2014, Proceedings of the 30th Annual Symposium on Computational Geometry, SoCG 2014. Association for Computing Machinery, p. 377-386 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    8 Scopus citations
  • 2013

    Computing the discrete Fréchet distance in subquadratic time

    Agarwal, P. K., Ben Avraham, R., Kaplan, H. & Sharir, M., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, p. 156-167 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    28 Scopus citations

  • Joint cache partition and job assignment on multi-core processors

    Hassidim, A., Kaplan, H. & Tuval, O., 2013, Algorithms and Data Structures - 13th International Symposium, WADS 2013, Proceedings. p. 378-389 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8037 LNCS).

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

    1 Scopus citations

  • Minimal indices for successor search (extended abstract)

    Cohen, S., Fiat, A., Hershcovitch, M. & Kaplan, H., 2013, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings. p. 278-289 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8087 LNCS).

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

    Open Access

  • On finding an optimal TCAM encoding scheme for packet classification

    Rottenstreich, O., Keslassy, I., Hassidim, A., Kaplan, H. & Porat, E., 2013, 2013 Proceedings IEEE INFOCOM 2013. p. 2049-2057 9 p. 6567006. (Proceedings - IEEE INFOCOM).

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

    41 Scopus citations

  • Reporting neighbors in high-dimensional Euclidean space

    Aiger, D., Kaplan, H. & Sharir, M., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, p. 784-803 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    3 Scopus citations

  • Scheduling subset tests: One-time, continuous, and how they relate

    Cohen, E., Kaplan, H. & Mansour, Y., 2013, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 16th International Workshop, APPROX 2013 and 17th International Workshop, RANDOM 2013, Proceedings. p. 81-95 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8096 LNCS).

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

    Open Access

  • Union of random minkowski sums and network vulnerability analysis

    Agarwal, P. K., Kaplan, H. & Sharir, M., 2013, Proceedings of the 29th Annual Symposium on Computational Geometry, SoCG 2013. Association for Computing Machinery, p. 177-186 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    Open Access
    9 Scopus citations

  • What you can do with coordinated samples

    Cohen, E. & Kaplan, H., 2013, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 16th International Workshop, APPROX 2013 and 17th International Workshop, RANDOM 2013, Proceedings. p. 452-467 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8096 LNCS).

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

    9 Scopus citations
  • 2012

    CBTree: A practical concurrent self-adjusting search tree

    Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A. & Tarjan, R. E., 2012, Distributed Computing - 26th International Symposium, DISC 2012, Proceedings. p. 1-15 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7611 LNCS).

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

    36 Scopus citations

  • Finding the maximal empty disk containing a query point

    Kaplan, H. & Sharir, M., 2012, Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012. p. 287-292 6 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    Open Access
    9 Scopus citations

  • How to split a flow?

    Hartman, T., Hassidim, A., Kaplan, H., Raz, D. & Segalov, M., 2012, 2012 Proceedings IEEE INFOCOM, INFOCOM 2012. p. 828-836 9 p. 6195830. (Proceedings - IEEE INFOCOM).

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

    51 Scopus citations

  • Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications

    Kaplan, H., Mozes, S., Nussbaum, Y. & Sharir, M., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. Association for Computing Machinery, p. 338-355 18 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    31 Scopus citations

  • The AND-OR game: Equilibrium characterization (working paper)

    Hassidim, A., Kaplan, H., Mansour, Y. & Nisan, N., 2012, Internet and Network Economics - 8th International Workshop, WINE 2012, Proceedings. p. 561 1 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7695 LNCS).

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

  • Upward max min fairness

    Danna, E., Hassidim, A., Kaplan, H., Kumar, A., Mansour, Y., Raz, D. & Segalov, M., 2012, 2012 Proceedings IEEE INFOCOM, INFOCOM 2012. p. 837-845 9 p. 6195832. (Proceedings - IEEE INFOCOM).

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

    30 Scopus citations
  • 2011

    Get the most out of your sample: Optimal unbiased estimators using partial information

    Cohen, E. & Kaplan, H., 2011, PODS'11 - Proceedings of the 30th Symposium on Principles of Database Systems. p. 13-24 12 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

    4 Scopus citations

  • Maximum flows by incremental breadth-First search

    Goldberg, A. V., Hed, S., Kaplan, H., Tarjan, R. E. & Werneck, R. F., 2011, Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. p. 457-468 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6942 LNCS).

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

    58 Scopus citations

  • Minimum S - T cut in undirected planar graphs when the source and the sink are close

    Kaplan, H. & Nussbaum, Y., 2011, 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. p. 117-128 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 9).

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

    11 Scopus citations

  • Truth, envy, and truthful market clearing bundle pricing

    Cohen, E., Feldman, M., Fiat, A., Kaplan, H. & Olonetsky, S., 2011, Internet and Network Economics - 7th International Workshop, WINE 2011, Proceedings. Springer Verlag, p. 97-108 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7090 LNCS).

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

    9 Scopus citations
  • 2010

    A kinetic triangulation scheme for moving points in the plane

    Kaplan, H., Rubin, N. & Sharir, M., 2010, Proceedings of the 26th Annual Symposium on Computational Geometry, SCG'10. p. 137-146 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    Open Access
    1 Scopus citations

  • Envy-free makespan approximation

    Cohen, E., Feldman, M., Fiat, A., Kaplan, H. & Olonetsky, S., 2010, EC'10 - Proceedings of the 2010 ACM Conference on Electronic Commerce. p. 159-165 7 p. (Proceedings of the ACM Conference on Electronic Commerce).

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

    8 Scopus citations

  • Improved bounds for geometric permutations

    Rubin, N., Kaplan, H. & Sharir, M., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 355-364 10 p. 5671203. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    Open Access
    1 Scopus citations

  • Improved recommendations via (More) collaboration

    Boim, R., Kaplan, H., Milo, T. & Rubinfeld, R., 2010, Proceedings of the 13th International Workshop on the Web and Databases, WebDB 2010, Co-located with ACM SIGMOD 2010. Association for Computing Machinery, 12. (Proceedings of the ACM SIGMOD International Conference on Management of Data).

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

    Open Access

  • Kinetic stable Delaunay graphs

    Agarwal, P. K., Gao, J., Guibas, L. J., Kaplan, H., Koltun, V., Rubin, N. & Sharir, M., 2010, Proceedings of the 26th Annual Symposium on Computational Geometry, SCG'10. p. 127-136 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    Open Access
    19 Scopus citations

  • Optimal cover of points by disks in a simple polygon

    Kaplan, H., Katz, M. J., Morgenstern, G. & Sharir, M., 2010, Algorithms, ESA 2010 - 18th Annual European Symposium, Proceedings. PART 1 ed. p. 475-486 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6346 LNCS, no. PART 1).

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

    3 Scopus citations
  • 2009

    A simpler implementation and analysis of Chazelle's Soft Heaps

    Kaplan, H. & Zwick, U., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 477-485 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    5 Scopus citations

  • Leveraging discarded samples for tighter estimation of multiple-set aggregates

    Cohen, E. & Kaplan, H., 2009, SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems. 1 ed. p. 251-262 12 p. 1555379. (SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems; vol. 37, no. 1).

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

    19 Scopus citations

  • Line transversals of convex polyhedra in ℝ3

    Kaplan, H., Rubin, N. & Sharir, M., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 170-179 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    5 Scopus citations

  • Maximum flow in directed planar graphs with vertex capacities

    Kaplan, H. & Nussbaum, Y., 2009, Algorithms - ESA 2009 - 17th Annual European Symposium, Proceedings. p. 397-407 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5757 LNCS).

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

    2 Scopus citations

  • Private coresets

    Feldman, D., Fiat, A., Kaplan, H. & Nissim, K., 2009, STOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing. p. 361-370 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    89 Scopus citations

  • Stream sampling for variance-optimal estimation of subset sums

    Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, M., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 1255-1264 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    22 Scopus citations
  • 2008

    Estimating aggregates over multiple sets

    Cohen, E. & Kaplan, H., 2008, Proceedings - 8th IEEE International Conference on Data Mining, ICDM 2008. p. 761-766 6 p. 4781175. (Proceedings - IEEE International Conference on Data Mining, ICDM).

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

    1 Scopus citations

  • I/O efficient dynamic data structures for longest prefix queries

    Hershcovitch, M. & Kaplan, H., 2008, Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings. p. 29-40 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5124 LNCS).

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

  • Path minima in incremental unrooted trees

    Kaplan, H. & Shafrir, N., 2008, Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. Springer Verlag, p. 565-576 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5193 LNCS).

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

    10 Scopus citations

  • Weak ∈-nets and interval chains

    Alon, N., Kaplan, H., Nivasch, G., Sharir, M. & Smorodinsky, S., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1194-1203 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    7 Scopus citations
  • 2007

    Algorithms and estimators for accurate summarization of internet traffic

    Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, M., 2007, IMC'07: Proceedings of the 2007 ACM SIGCOMM Internet Measurement Conference. p. 265-278 14 p. (Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC).

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

    16 Scopus citations