1.8k citations
- Tel Aviv UniversityIL45 papers
- Boston UniversityUS31 papers
- Ben-Gurion University of the NegevIL26 papers
- Technion – Israel Institute of TechnologyIL26 papers
- Ariel UniversityIL22 papers
- Hebrew University of JerusalemIL22 papers
- University of Maryland, College ParkUS21 papers
- Weizmann Institute of ScienceIL19 papers
- Centre National de la Recherche ScientifiqueFR18 papers
- Harvard UniversityUS16 papers
- Institute of MathematicsPL13 papers
- Institute of Radio AstronomyUA13 papers
7 papers · 2 filters
Polynomials: a new tool for length reduction in binary discrete convolutions
Amihood Amir, Oren Kapah, Ely Porat +1
Efficient handling of sparse data is a key challenge in Computer Science. Binary convolutions, such as polynomial multiplication or the Walsh Transform are a useful tool in many ap…
Dictionary Matching with One Gap
Amihood Amir, Avivit Levy, Ely Porat +1
The dictionary matching with gaps problem is to preprocess a dictionary of gapped patterns over alphabet , where each gapped pattern is a sequence…
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Amihood Amir, Oren Kapah, Tsvi Kopelowitz +2
We introduce and examine the {\em Holiday Gathering Problem} which models the difficulty that couples have when trying to decide with which parents should they spend the holiday. O…
New routing techniques and their applications
Liam Roditty, Roei Tov
Let be an undirected graph with vertices and edges. We obtain the following new routing schemes: - A routing scheme for unweighted graphs that uses $\tilde O(\fra…
Dynamic Set Intersection
Tsvi Kopelowitz, Seth Pettie, Ely Porat
Consider the problem of maintaining a family of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given , report every member of…
Weighted ancestors in suffix trees
Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson
The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees,…