Bar-Ilan University

output

19922026

most citedCatastrophic cascade of failures in interdependent networks

4.5k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

S. Havlin271 · h 143
E. Barkai106 · h 52
I. Kanter2 profiles94 · h 39
D. Kessler88 · h 38
M. Katz79 · h 33
H. Stanley3 profiles78 · h 137
R. Berkovits67 · h 23
A. Pe’er2 profiles49 · h 38
E. Cohen48 · h 27
E. Kogan2 profiles47 · h 16
S. Buldyrev44 · h 88
E. Shimshoni42 · h 16

collaborating institutions

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

Showing 2021 · cs.DSShow all

2 papers · 2 filters

cs.DS2021★ 4 cited

An Improved Algorithm for The $k$ -Dyck Edit Distance Problem

Dvir Fried, Shay Golan, Tomasz Kociumaka +3

A Dyck sequence is a sequence of opening and closing parentheses (of various types) that is balanced. The Dyck edit distance of a given sequence of parentheses $S$ is the smallest…

cs.DS2021

Incremental Edge Orientation in Forests

Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul +2

For any forest $G = (V, E)$ it is possible to orient the edges $E$ so that no vertex in $V$ has out-degree greater than $1$ . This paper considers the incremental edge-orientation p…

An Improved Algorithm for The k-Dyck Edit Distance Problem

Incremental Edge Orientation in Forests

An Improved Algorithm for The $k$ -Dyck Edit Distance Problem