21 citations · 27 across the 3 of their papers we have counts for
3 papers
cs.DC2014★ 21 cited
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique
Stephan Holzer, Nathan Pinsker
We study the broadcast version of the CONGEST CLIQUE model of distributed computing. In this model, in each round, any node in a network of size can send the same message (i.e.…
cs.DS2014
Fast Dynamic Pointer Following via Link-Cut Trees
Erik Demaine, Nathan Pinsker, Jon Schneider
In this paper, we study the problem of fast dynamic pointer following: given a directed graph where each vertex has outdegree , efficiently support the operations of i) chan…
cs.DS2013★ 6 cited
The Dynamic Longest Increasing Subsequence Problem
Alex Chen, Timothy Chu, Nathan Pinsker
In this paper, we construct a data structure to efficiently compute the longest increasing subsequence of a sequence subject to dynamic updates. Our data structure supports a query…