2 citations · 3 across the 3 of their papers we have counts for
4 papers
Graph Spanners in the Message-Passing Model
Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative…
The Query Complexity of Mastermind with Distances
Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
Consider a variant of the Mastermind game in which queries are distances, rather than the usual Hamming distance. That is, a codemaker chooses a hidden vector $\mathbf{y}\…
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel -means Clustering
Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
We present tight lower bounds on the number of kernel evaluations required to approximately solve kernel ridge regression (KRR) and kernel -means clustering (KKMC) on input…
Maximal Planar Subgraphs of Fixed Girth in Random Graphs
Manuel Fernández, Nicholas Sieger, Michael Tait
In 1991, Bollobás and Frieze showed that the threshold for to contain a spanning maximal planar subgraph is very close to . In this paper, we compute simila…