David Peleg
YOU?
Author Swipe
View article: Degree Realization by Bipartite Cactus Graphs
Degree Realization by Bipartite Cactus Graphs Open
The \textsc{Degree Realization} problem with respect to a graph family $\mathcal{F}$ is defined as follows. The input is a sequence $d$ of $n$ positive integers, and the goal is to decide whether there exists a graph $G \in \mathcal{F}$ wh…
View article: Degree Realization by Bipartite Multigraphs
Degree Realization by Bipartite Multigraphs Open
The problem of realizing a given degree sequence by a multigraph can be thought of as a relaxation of the classical degree realization problem (where the realizing graph is simple). This paper concerns the case where the realizing multigra…
View article: Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings
Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings Open
The distributed Data Retrieval (DR) model consists of k peers connected by a complete peer-to-peer communication network, and a trusted external data source that stores an array X of n bits (n ≫ k). Up to β k of the peers might fail in any…
View article: Approximate Realizations for Outerplanaric Degree Sequences
Approximate Realizations for Outerplanaric Degree Sequences Open
We study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an outerpl…
View article: Local Recurrent Problems in the SUPPORTED Model
Local Recurrent Problems in the SUPPORTED Model Open
We study the SUPPORTED model of distributed computing introduced by Schmid and Suomela [Schmid and Suomela, 2013], which generalizes the LOCAL and CONGEST models. In this framework, multiple instances of the same problem, differing from ea…
View article: Byzantine Resilient Computing with the Cloud
Byzantine Resilient Computing with the Cloud Open
We study a framework for modeling distributed network systems assisted by a reliable and powerful cloud service. Our framework aims at capturing hybrid systems based on a point to point message passing network of machines, with the additio…
View article: Online Algorithms with Predictions (Invited Talk)
Online Algorithms with Predictions (Invited Talk) Open
We give an introduction to online algorithms with predictions, from an algorithms researcher’s perspective, concentrating on minimization problems.
View article: The Power of Small Coalitions under Two-Tier Majority on Regular Graphs
The Power of Small Coalitions under Two-Tier Majority on Regular Graphs Open
In this paper, we study the following problem. Consider a setting where a proposal is offered to the vertices of a given network $G$, and the vertices must conduct a vote and decide whether to accept the proposal or reject it. Each vertex …
View article: An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm Open
A singularly (near) optimal distributed algorithm is one that is (near) optimal in \emph{two} criteria, namely, its time and message complexities. For \emph{synchronous} CONGEST networks, such algorithms are known for fundamental distribut…
View article: The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication Open
Theoretical study of optimization problems in wireless communication often deals with tasks that concern a single point. For example, the power control problem requires computing a power assignment guaranteeing that each transmitting stati…
View article: Distributed Graph Realizations
Distributed Graph Realizations Open
We study graph realization problems from a distributed perspective and we study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for representing peer-to-peer networks. We focus on two central var…
View article: Singularly Near Optimal Leader Election in Asynchronous Networks
Singularly Near Optimal Leader Election in Asynchronous Networks Open
This paper concerns designing distributed algorithms that are {\em singularly optimal}, i.e., algorithms that are {\em simultaneously} time and message {\em optimal}, for the fundamental leader election problem in {\em asynchronous} networ…
View article: Budgeted Dominating Sets in Uncertain Graphs
Budgeted Dominating Sets in Uncertain Graphs Open
We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, namely, graphs with a probability distribution p associated with the edges, such that an edge e exists in the graph with probability p(e). The input to the problem con…
View article: Budgeted Dominating Sets in Uncertain Graphs
Budgeted Dominating Sets in Uncertain Graphs Open
We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, namely, graphs with a probability distribution p associated with the edges, such that an edge e exists in the graph with probability p(e). The input to the problem con…
View article: Singularly Optimal Randomized Leader Election
Singularly Optimal Randomized Leader Election Open
This paper concerns designing distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the fundamental leader election problem in networks. Our main result is a randomized d…
View article: Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods Open
The classical problem of degree sequence realizability asks whether or not a given sequence of $n$ positive integers is equal to the degree sequence of some $n$-vertex undirected simple graph. While the realizability problem of degree sequ…
View article: Hotelling Games with Multiple Line Faults
Hotelling Games with Multiple Line Faults Open
The Hotelling game consists of n servers each choosing a point on the line segment, so as to maximize the amount of clients it attracts. Clients are uniformly distributed along the line, and each client buys from the closest server. In thi…
View article: Efficiently Realizing Interval Sequences
Efficiently Realizing Interval Sequences Open
We consider the problem of realizable interval-sequences. An interval sequence comprises of n integer intervals [a_i,b_i] such that 0 <= a_i <= b_i <= n-1, and is said to be graphic/realizable if there exists a graph with degree sequence, …
View article: The Generalized Microscopic Image Reconstruction Problem
The Generalized Microscopic Image Reconstruction Problem Open
This paper presents and studies a generalization of the microscopic image reconstruction problem (MIR) introduced by Frosini and Nivat [Andrea Frosini and Maurice Nivat, 2007; Nivat, 2002]. Consider a specimen for inspection, represented a…
View article: Issue Information
Issue Information Open
US$5143 (Rest of World), €3323 (Europe), £2630 (UK)
View article: Elites in social networks: An axiomatic approach to power balance and Price’s square root law
Elites in social networks: An axiomatic approach to power balance and Price’s square root law Open
A common two-tier structure for social networks is based on partitioning society into two parts, referred to as the elite and the periphery, where the "elite" is the relatively small but well-connected and highly influential group of power…
View article: Issue Information
Issue Information Open
US$5143 (Rest of World), €3323 (Europe), £2630 (UK)
View article: Issue Information
Issue Information Open
US$5143 (Rest of World), €3323 (Europe), £2630 (UK)
View article: Issue Information
Issue Information Open
US$5143 (Rest of World), €3323 (Europe), £2630 (UK)
View article: Issue Information
Issue Information Open
US$5143 (Rest of World), €3323 (Europe), £2630 (UK)