#### Filter Results:

#### Publication Year

1977

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Key Phrases

#### Organism

Learn More

- Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
- ACM Trans. Algorithms
- 2007

The <i>edit distance</i> between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this article, we present a worst-case <i>O</i>(<i>n</i><sup>3</sup>)-time algorithm for the… (More)

- Shay Mozes, Christian Wulff-Nilsen
- ESA
- 2010

Given an n-vertex planar directed graph with real edge lengths and with no negative cycles, we show how to compute single-source shortest path distances in the graph in O(n log 2 n/ log log n) time with O(n) space. This improves on a recent O(n log 2 n) time bound by Klein et al.

- Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
- 2011 IEEE 52nd Annual Symposium on Foundations of…
- 2011

We give an O(n log3 n) algorithm that, given an n-node directed planar graph with arc capacities, a set of source nodes, and a set of sink nodes, finds a maximum flow from the sources to the sinks. Previously, the fastest algorithms known for this problem were those for general graphs.

- Shay Mozes, Christian Sommer
- SODA
- 2012

We present new and improved data structures that answer exact node-to-node distance queries in planar graphs. Such data structures are also known as distance oracles. For any directed planar graph on n nodes with non-negative lengths we obtain the following: 1 • Given a desired space allocation S ∈ [n lg lg n, n 2 ], we show how to construct iñ O(S) time a… (More)

- Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
- SODA
- 2012

We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix , and its output is the maximum element of that subma-trix. Our data structure for an n × n Monge matrix takes O(n log n) space, O(n log 2 n) preprocessing time, and can answer queries in… (More)

- Shay Mozes, Krzysztof Onak, Oren Weimann
- SODA
- 2008

We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the goal is to minimize the number of queries required to find a target element in the worst case. However, while the optimal strategy for searching an array is straightforward… (More)

- Philip N. Klein, Shay Mozes
- ArXiv
- 2010

We give an O(n 1.5 log n) algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a single sink node, finds a maximum flow from the sources to the sink. This is the first subquadratic-time strongly polynomial algorithm for the problem.

We start a systematic study of data structures for the nearest colored node problem on trees. Given a tree with colored nodes and weighted edges, we want to answer queries (v, c) asking for the nearest node to node v that has color c. This is a natural generalization of the well-known nearest marked ancestor problem. We give an O(n)-space O(log log n)-query… (More)

We give an O(n log 2 n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes. The best previously known algorithm requires O(n log 3 n) time and O(n log n) space. 1 Introduction The problem of directed shortest paths with negative lengths is as… (More)

- Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
- CPM
- 2007

We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the application of our method to Viterbi's decoding and training algorithms (IEEE Trans. Inform. Theory IT-13:260–269, 1967), as well as to the forward-backward and Baum-Welch (Inequalities… (More)