A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Parallel shortcutting of rooted trees
Journal of Algorithms
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Journal of the ACM (JACM)
Compact routing with minimum stretch
Journal of Algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Directed graphs requiring large numbers of shortcuts
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Testing Algorithms for Monotonicity
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Compact roundtrip routing in directed networks
Journal of Algorithms
Journal of the ACM (JACM)
Dynamic and efficient key management for access hierarchies
Proceedings of the 12th ACM conference on Computer and communications security
Approximate distance oracles for unweighted graphs in expected O(n2) time
ACM Transactions on Algorithms (TALG)
Property-Preserving Data Reconstruction
Algorithmica
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Local Monotonicity Reconstruction
SIAM Journal on Computing
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Online geometric reconstruction
Journal of the ACM (JACM)
Improved approximation for the directed spanner problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Steiner transitive-closure spanners of low-dimensional posets
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
Given a directed graph G = (V,E) and an integer k ≥ 1, a k- transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V,EH) that has (1) the same transitive-closure as G and (2) diameter at most k. Transitive-closure spanners are a common abstraction for applications in access control, property testing and data structures. We show a connection between 2-TC-spanners and local monotonicity reconstructors. A local monotonicity reconstructor, introduced by Saks and Seshadhri (SIAM Journal on Computing, 2010), is a randomized algorithm that, given access to an oracle for an almost monotone function f : [m]d → R, can quickly evaluate a related function g : [m]d → R which is guaranteed to be monotone. Furthermore, the reconstructor can be implemented in a distributed manner. We show that an efficient local monotonicity reconstructor implies a sparse 2-TC-spanner of the directed hypergrid (hypercube), providing a new technique for proving lower bounds for local monotonicity reconstructors. Our connection is, in fact, more general: an efficient local monotonicity reconstructor for functions on any partially ordered set (poset) implies a sparse 2-TC-spanner of the directed acyclic graph corresponding to the poset. We present tight upper and lower bounds on the size of the sparsest 2-TC-spanners of the directed hypercube and hypergrid. These bounds imply tighter lower bounds for local monotonicity reconstructors that nearly match the known upper bounds.