#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2002

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
- J. ACM
- 2005

A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall's theorem, one can represent such a multigraph as a combination of at most n2 cycle… (More)

- Haim Kaplan, Nira Shafrir, Robert E. Tarjan
- STOC
- 2002

In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations find-min, insert, delete, decrease-key, and meld. In the usual definition decrease-key… (More)

- Haim Kaplan, Nira Shafrir
- Inf. Process. Lett.
- 2005

- Haim Kaplan, Nira Shafrir
- ESA
- 2008

Consider a dynamic forest of unrooted trees over a set of nvertices which we update by linkoperations: Each link operation adds a new edge adjacent to vertices in two different trees. Every edge in… (More)

- Haim Kaplan, Nira Shafrir, Robert E. Tarjan
- SODA
- 2002

In the classical union-find problem we maintain a partition of a universe of <i>n</i> elements into disjoint sets subject to the operations union and find. The operation <i>union</i>(<i>A, B, C</i>)… (More)

In the classical union nd problem we maintain a partition of a universe of n elements into disjoint sets subject to the operations union and nd The operation union A B C replaces sets A and B in the… (More)

- Haim Kaplan, Ely Porat, Nira Shafrir
- SWAT
- 2006

Given a pattern P, a text T, and an integer k, we want to find for every position j of T, the index of the k-mismatch of P with the suffix of T starting at position j. We give an algorithm that finds… (More)

- Haim Kaplan, Nira Shafrir
- Inf. Process. Lett.
- 2006

- Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert E. Tarjan, Renato F. Werneck
- ACM Trans. Algorithms
- 2007

Motivated by an application in computational geometry, we consider a novel variant of the problem of efficiently maintaining a forest of dynamic rooted trees. This variant includes an operation that… (More)

- Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
- 44th Annual IEEE Symposium on Foundations of…
- 2003

A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall's theorem one can represent such a multigraph as a combination of at most n/sup 2/… (More)