High Parallel Complexity Graphs and Memory-Hard Functions (Q2941555): Difference between revisions

@@ Property / cites work @@
+On Approximate Distance Labels and Routing Schemes with Affine Stretch
+Normal rank
@@ Property / cites work @@
+On sparse spanners of weighted graphs
@@ Property / cites work: On sparse spanners of weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Linear Time Construction of Sparse Neighborhood Covers
+Normal rank
@@ Property / cites work @@
+Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles with constant query time
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
+Normal rank
@@ Property / cites work @@
+Ramsey partitions and proximity data structures
@@ Property / cites work: Ramsey partitions and proximity data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q5414573
@@ Property / cites work: Q5414573 / rank @@
+Normal rank
@@ Property / cites work @@
+Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path queries in static networks
@@ Property / cites work: Shortest-path queries in static networks / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles
@@ Property / cites work: Approximate distance oracles / rank @@
+Normal rank