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
5 papers · 2 filters
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat +1
In edge orientations, the goal is usually to orient (direct) the edges of an undirected -vertex graph such that all out-degrees are bounded. When the graph is fully dyna…
A Labeling Approach to Incremental Cycle Detection
Edith Cohen, Amos Fiat, Haim Kaplan +1
In the \emph{incremental cycle detection} problem arcs are added to a directed acyclic graph and the algorithm has to report if the new arc closes a cycle. One seeks to minimize th…
Finding the Minimum-Weight k-Path
Avinatan Hassidim, Orgad Keller, Moshe Lewenstein +1
Given a weighted -vertex graph with integer edge-weights taken from a range , we show that the minimum-weight simple path visiting vertices can be found in time…
Succinct data structures for representing equivalence classes
Moshe Lewenstein, J. Ian Munro, Venkatesh Raman
Given a partition of an n element set into equivalence classes, we consider time-space tradeoffs for representing it to support the query that asks whether two given elements are i…
Orthogonal Range Searching for Text Indexing
Moshe Lewenstein
Text indexing, the problem in which one desires to preprocess a (usually large) text for future (shorter) queries, has been researched ever since the suffix tree was invented in th…