23 citations · 52 across the 10 of their papers we have counts for
12 papers
Efficient and Flexible Crowdsourcing of Specialized Tasks with Precedence Constraints
Avhishek Chatterjee, Michael Borokhovich, Lav R. Varshney +1
Many companies now use crowdsourcing to leverage external (as well as internal) crowds to perform specialized work, and so methods of improving efficiency are critical. Tasks in cr…
Distributed Estimation of Graph 4-Profiles
Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich +1
We present a novel distributed algorithm for counting all four-node induced subgraphs in a big graph. These counts, called the -profile, describe a graph's connectivity properti…
Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs
Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich +1
We study the problem of approximating the -profile of a large graph. -profiles are generalizations of triangle counts that specify the number of times a small graph appears a…
FrogWild! -- Fast PageRank Approximations on Graph Engines
Ioannis Mitliagkas, Michael Borokhovich, Alexandros G. Dimakis +1
We propose FrogWild, a novel algorithm for fast approximation of high PageRank vertices, geared towards reducing network costs of running traditional PageRank algorithms. Our algor…
Distributed Computing on Core-Periphery Networks: Axiom-based Design
Chen Avin, Michael Borokhovich, Zvi Lotker +1
Inspired by social networks and complex systems, we propose a core-periphery network architecture that supports fast computation for many distributed algorithms and is robust and e…
How (Not) to Shoot in Your Foot with SDN Local Fast Failover: A Load-Connectivity Tradeoff
Michael Borokhovich, Stefan Schmid
This paper studies the resilient routing and (in-band) fast failover mechanisms supported in Software-Defined Networks (SDN). We analyze the potential benefits and limitations of s…
OBST: A Self-Adjusting Peer-to-Peer Overlay Based on Multiple BSTs
Chen Avin, Michael Borokhovich, Stefan Schmid
The design of scalable and robust overlay topologies has been a main research subject since the very origins of peer-to-peer (p2p) computing. Today, the corresponding optimization…
Generalized Perron--Frobenius Theorem for Nonsquare Matrices
Chen Avin, Michael Borokhovich, Yoram Haddad +4
The celebrated Perron--Frobenius (PF) theorem is stated for irreducible nonnegative square matrices, and provides a simple characterization of their eigenvectors and eigenvalues. T…
Efficient Joint Network-Source Coding for Multiple Terminals with Side Information
Chen Avin, Michael Borokhovich, Asaf Cohen +1
Consider the problem of source coding in networks with multiple receiving terminals, each having access to some kind of side information. In this case, standard coding techniques a…
Self-Adjusting Networks to Minimize Expected Path Length
Chen Avin, Michael Borokhovich, Bernhard Haeupler +1
Given a network infrastructure (e.g., data-center or on-chip-network) and a distribution on the source-destination requests, the expected path (route) length is an important measur…
Order Optimal Information Spreading Using Algebraic Gossip
Chen Avin, Michael Borokhovich, Keren Censor-Hillel +1
In this paper we study gossip based information spreading with bounded message sizes. We use algebraic gossip to disseminate distinct messages to all nodes in a network. Fo…
Bounds for Algebraic Gossip on Graphs
Michael Borokhovich, Chen Avin, Zvi Lotker
We study the stopping times of gossip algorithms for network coding. We analyze algebraic gossip (i.e., random linear coding) and consider three gossip algorithms for information s…