Nira Shafrir

According to our database, Nira Shafrir authored at least 9 papers between 2002 and 2011.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2011

Data structures for mergeable trees.

Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck

ACM Trans. Algorithms, 2011

2009

Algorithms for NP-Hard problems related to strings and for approximate pattern matching and repeats

Nira Shafrir

PhD thesis, 2009

2008

Path Minima in Incremental Unrooted Trees.

Haim Kaplan, Nira Shafrir

Proceedings of the Algorithms, 2008

2006

The greedy algorithm for edit distance with moves.

Haim Kaplan, Nira Shafrir

Inf. Process. Lett., 2006

Finding the Position of the <i>k</i>-Mismatch and Approximate Tandem Repeats.

Haim Kaplan, Ely Porat, Nira Shafrir

Proceedings of the Algorithm Theory, 2006

2005

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.

Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko

J. ACM, 2005

The greedy algorithm for shortest superstrings.

Haim Kaplan, Nira Shafrir

Inf. Process. Lett., 2005

2002

Meldable heaps and boolean union-find.

Haim Kaplan, Nira Shafrir, Robert Endre Tarjan

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Union-find with deletions.

Haim Kaplan, Nira Shafrir, Robert Endre Tarjan

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002