4.5k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Tel Aviv UniversityIL181 papers
- Boston UniversityUS130 papers
- Weizmann Institute of ScienceIL117 papers
- Ariel UniversityIL101 papers
- Ben-Gurion University of the NegevIL99 papers
- Centre National de la Recherche ScientifiqueFR98 papers
- Hebrew University of JerusalemIL95 papers
- Technion – Israel Institute of TechnologyIL90 papers
- Massachusetts Institute of TechnologyUS82 papers
- Stanford UniversityUS75 papers
- University of CambridgeGB70 papers
- University of Maryland, College ParkUS68 papers
7 papers · 2 filters
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods
Amotz Bar-Noy, Keerti Choudhary, David Peleg +1
The classical problem of degree sequence realizability asks whether or not a given sequence of positive integers is equal to the degree sequence of some -vertex undirected s…
Resolution of the Burrows-Wheeler Transform Conjecture
Dominik Kempa, Tomasz Kociumaka
The Burrows-Wheeler Transform (BWT) is an invertible text transformation that permutes symbols of a text according to the lexicographical order of its suffixes. BWT is the main com…
Noisy Beeping Networks
Yagel Ashkenazi, Ran Gelles, Amir Leshem
We introduce noisy beeping networks, where nodes have limited communication capabilities, namely, they can only emit energy or sense the channel for energy. Furthermore, imperfecti…
The Strong 3SUM-INDEXING Conjecture is False
Tsvi Kopelowitz, Ely Porat
In the 3SUM-Indexing problem the goal is to preprocess two lists of elements from , and , such that given an element one c…
Cartesian Tree Matching and Indexing
Sung Gwan Park, Amihood Amir, Gad M. Landau +1
We introduce a new metric of match, called Cartesian tree matching, which means that two strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we d…
String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure
Dominik Kempa, Tomasz Kociumaka
Burrows-Wheeler transform (BWT) is an invertible text transformation that, given a text of length , permutes its symbols according to the lexicographic order of suffixes of…
Efficient Multiparty Interactive Coding for Insertions, Deletions and Substitutions
Ran Gelles, Yael T. Kalai, Govind Ramnarayan
In the field of interactive coding, two or more parties wish to carry out a distributed computation over a communication network that may be noisy. The ultimate goal is to develop…