| 2009 |
|---|
| 6 | EE | Philip Klein,
Shay Mozes,
Oren Weimann:
Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2 n)-time algorithm.
SODA 2009: 236-245 |
| 2008 |
|---|
| 5 | EE | Shay Mozes,
Dekel Tsur,
Oren Weimann,
Michal Ziv-Ukelson:
Fast Algorithms for Computing Tree LCS.
CPM 2008: 230-243 |
| 4 | EE | Shay Mozes,
Krzysztof Onak,
Oren Weimann:
Finding an optimal tree searching strategy in linear time.
SODA 2008: 1096-1105 |
| 2007 |
|---|
| 3 | EE | Shay Mozes,
Oren Weimann,
Michal Ziv-Ukelson:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.
CPM 2007: 4-15 |
| 2 | EE | Erik D. Demaine,
Shay Mozes,
Benjamin Rossman,
Oren Weimann:
An Optimal Decomposition Algorithm for Tree Edit Distance.
ICALP 2007: 146-157 |
| 2006 |
|---|
| 1 | EE | Erik D. Demaine,
Shay Mozes,
Benjamin Rossman,
Oren Weimann:
An O(n^3)-Time Algorithm for Tree Edit Distance
CoRR abs/cs/0604037: (2006) |
