Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Share This Author
Reachability and distance queries via 2-hop labels
- E. Cohen, E. Halperin, Haim Kaplan, U. Zwick
- Computer ScienceSODA '02
- 6 January 2002
TLDR
Labeling dynamic XML trees
- E. Cohen, Haim Kaplan, T. Milo
- Computer SciencePODS '02
- 3 June 2002
TLDR
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
- A. Goldberg, Haim Kaplan, Renato F. Werneck
- Computer ScienceALENEX
- 21 January 2006
TLDR
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Haim Kaplan, Moshe Lewenstein, Nira Shafrir, M. Sviridenko
- Mathematics, Computer ScienceJACM
- 1 July 2005
TLDR
Compact labeling schemes for ancestor queries
- S. Abiteboul, Haim Kaplan, T. Milo
- Computer ScienceSODA '01
- 9 January 2001
TLDR
Nearest common ancestors: a survey and a new distributed algorithm
- Stephen Alstrup, C. Gavoille, Haim Kaplan, Theis Rauhe
- Computer ScienceSPAA
- 10 August 2002
TLDR
Non-price equilibria in markets of discrete goods
- Avinatan Hassidim, Haim Kaplan, Y. Mansour, N. Nisan
- EconomicsEC '11
- 21 March 2011
TLDR
Four Strikes Against Physical Mapping of DNA
- P. Goldberg, M. Golumbic, Haim Kaplan, R. Shamir
- MathematicsJ. Comput. Biol.
- 1995
TLDR
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Haim Kaplan, R. Shamir, R. Tarjan
- Computer Science, MathematicsSIAM J. Comput.
- 1 May 1999
TLDR
Learning with attribute costs
- Haim Kaplan, E. Kushilevitz, Y. Mansour
- Computer ScienceSTOC '05
- 22 May 2005
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for different attributes). Our model…
...
1
2
3
4
5
...