עקוב אחר
Haim Kaplan
Haim Kaplan
School of Computer Science, Tel Aviv University
כתובת אימייל מאומתת בדומיין post.tau.ac.il
כותרת
צוטט על ידי
צוטט על ידי
שנה
Reachability and distance queries via 2-hop labels
E Cohen, E Halperin, H Kaplan, U Zwick
SIAM Journal on Computing 32 (5), 1338-1355, 2003
8672003
Faster and simpler algorithm for sorting signed permutations by reversals
H Kaplan, R Shamir, RE Tarjan
Proceedings of the first annual international conference on Computational …, 1997
4221997
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
AV Goldberg, H Kaplan, RF Werneck
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and …, 2006
4162006
Labeling dynamic XML trees
E Cohen, H Kaplan, T Milo
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on …, 2002
4032002
Associative search in peer to peer networks: Harnessing latent semantics
E Cohen, A Fiat, H Kaplan
Computer Networks 51 (8), 1861-1881, 2007
3302007
Optimal oblivious routing in polynomial time
Y Azar, E Cohen, A Fiat, H Kaplan, H Racke
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
2802003
Graph sandwich problems
MC Golumbic, H Kaplan, R Shamir
Journal of Algorithms 19 (3), 449-473, 1995
2711995
Compact labeling scheme for ancestor queries
S Abiteboul, S Alstrup, H Kaplan, T Milo, T Rauhe
SIAM Journal on Computing 35 (6), 1295-1309, 2006
2502006
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
H Kaplan, M Lewenstein, N Shafrir, M Sviridenko
Journal of the ACM (JACM) 52 (4), 602-626, 2005
2492005
Four strikes against physical mapping of DNA
PW Goldberg, MC Golumbic, H Kaplan, R Shamir
Journal of Computational Biology 2 (1), 139-152, 1995
2381995
Computing the discrete Fréchet distance in subquadratic time
PK Agarwal, RB Avraham, H Kaplan, M Sharir
SIAM Journal on Computing 43 (2), 429-449, 2014
2292014
Prefetching the means for document transfer: A new approach for reducing Web latency
E Cohen, H Kaplan
Proceedings IEEE INFOCOM 2000. Conference on Computer Communications …, 2000
2172000
Nearest common ancestors: a survey and a new distributed algorithm
S Alstrup, C Gavoille, H Kaplan, T Rauhe
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
2162002
Proactive caching of DNS records: Addressing a performance bottleneck
E Cohen, H Kaplan
Computer Networks 41 (6), 707-726, 2003
1732003
Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs
H Kaplan, R Shamir, RE Tarjan
SIAM Journal on Computing 28 (5), 1906-1922, 1999
1721999
Private coresets
D Feldman, A Fiat, H Kaplan, K Nissim
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1682009
Summarizing data using bottom-k sketches
E Cohen, H Kaplan
Proceedings of the twenty-sixth annual ACM symposium on Principles of …, 2007
1662007
Refreshment policies for web content caches
E Cohen, H Kaplan
Proceedings IEEE INFOCOM 2001. Conference on Computer Communications …, 2001
1652001
Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques
H Kaplan, R Shamir
SIAM Journal on Computing 25 (3), 540-561, 1996
1651996
On the complexity of DNA physical mapping
MC Golumbic, H Kaplan, R Shamir
Advances in Applied Mathematics 15 (3), 251-261, 1994
1651994
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20