#### Filter Results:

- Full text PDF available (87)

#### Publication Year

2000

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ely Porat, Amir Rothschild
- IEEE Transactions on Information Theory
- 2008

Group testing is a long studied problem in combinatorics: A small set of <i>r</i> ill people should be identified out of the whole (<i>n</i> people) by using only queries (tests) of the form “Does set X contain an ill human?” In this paper we provide an explicit construction of a testing scheme which is better (smaller) than any known explicit… (More)

We propose a new paradigm for string matching, namely <i>structural matching</i>. In structural matching, the text and pattern contents are not important. Rather, some areas in the text and patterns are singled out, say intervals. A “match” is a text location where a specified relation between the text and pattern areas is satisfied.
In… (More)

- Amihood Amir, Moshe Lewenstein, Ely Porat
- SODA
- 2000

The string matching with mismatches problem is that of nding the number of mismatches between a pattern P of length m and every length m substring of the text T. Currently, the fastest algorithms for this problem are the following. The Landau-Vishkin algorithm nds all locations where the pattern has at most k errors (where k is part of the input) in time… (More)

- Yoram Bachrach, Ely Porat
- AAMAS
- 2010

We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. PDGs can model physical or network security domains. The coalition attempts to stop the adversary by placing checkpoints in intermediate nodes in the graph, to make sure the… (More)

- Amihood Amir, Estrella Eisenberg, Ely Porat
- ESA
- 2004

- T. Kaufman, S. Lovett, E. Porat
- IEEE Transactions on Information Theory
- 2012

The weight distribution and list-decoding size of Reed-Muller codes are studied in this work. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with weight up to the given parameter; and given a received word and a distance parameter, we are interested in bounding the size of the list of Reed-Muller codewords that… (More)

- Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra
- PODS
- 2012

Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who… (More)

- Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff
- STOC
- 2011

We give a space-optimal streaming algorithm with update time O(log<sup>2</sup>(1/ε)loglog(1/ε)) for approximating the pth frequency moment, 0 < p < 2, of a length-n vector updated in a data stream up to a factor of 1 +/- ε. This provides a nearly exponential improvement over the previous space optimal algorithm of [Kane-Nelson-Woodruff, SODA… (More)

- Amihood Amir, Yonatan Aumann, +5 authors Uzi Vishne
- SODA
- 2006

Historically, approximate pattern matching has mainly focused at coping with errors in the data, while the order of the text/pattern was assumed to be more or less correct. In this paper we consider a class of pattern matching problems where the content is assumed to be correct, while the <i>locations</i> may have shifted/changed. We formally define a broad… (More)

We give the first non-trivial algorithms for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols and a bound k, our algorithms find all the places that the pattern matches the text with at most k mismatches. We first give an O(n(k + log n log log n) log m) time randomised… (More)