Compact and localized distributed data structures (Q5138487): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00446-002-0073-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2020965855
@@ Property / OpenAlex ID: W2020965855 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4829034
@@ Property / cites work: Q4829034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4733694
@@ Property / cites work: Q4733694 / rank @@
+Normal rank
@@ Property / cites work @@
+Routing with Polynomial Communication-Space Trade-Off
+Normal rank
@@ Property / cites work @@
+Concurrency of operations on B-trees
@@ Property / cites work: Concurrency of operations on B-trees / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Prefix routing schemes in dynamic networks
@@ Property / cites work: Prefix routing schemes in dynamic networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4511220
@@ Property / cites work: Q4511220 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Coding the vertexes of a graph
@@ Property / cites work: Coding the vertexes of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+An unexpected result in coding the vertices of a graph
+Normal rank
@@ Property / cites work @@
+Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
+Normal rank
@@ Property / cites work @@
+Q4829033
@@ Property / cites work: Q4829033 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Compact Routing with Minimum Stretch
@@ Property / cites work: Compact Routing with Minimum Stretch / rank @@
+Normal rank
@@ Property / cites work @@
+Compact roundtrip routing in directed networks (extended abstract)
+Normal rank
@@ Property / cites work @@
+Query efficient implementation of graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
+Normal rank
@@ Property / cites work @@
+Compact routing schemes with low stretch factor
@@ Property / cites work: Compact routing schemes with low stretch factor / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the characterization of networks supporting shortest-path interval routing.
+Normal rank
@@ Property / cites work @@
+Q4262693
@@ Property / cites work: Q4262693 / rank @@
+Normal rank
@@ Property / cites work @@
+Concurrent search and insertion in 2-3 trees
@@ Property / cites work: Concurrent search and insertion in 2-3 trees / rank @@
+Normal rank
@@ Property / cites work @@
+Concurrent Search and Insertion in AVL Trees
@@ Property / cites work: Concurrent Search and Insertion in AVL Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Interval routing schemes
@@ Property / cites work: Interval routing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+On devising Boolean Routing Schemes
@@ Property / cites work: On devising Boolean Routing Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Multidimensional interval routing schemes
@@ Property / cites work: Multidimensional interval routing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Interval Routing on Random Graphs
+Normal rank
@@ Property / cites work @@
+Memory requirement for universal routing schemes
@@ Property / cites work: Memory requirement for universal routing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4736828
@@ Property / cites work: Q4736828 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval routing schemes
@@ Property / cites work: Interval routing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535803
@@ Property / cites work: Q4535803 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval routing schemes allow broadcasting with linear message-complexity
+Normal rank
@@ Property / cites work @@
+Searching among intervals and compact routing tables
+Normal rank
@@ Property / cites work @@
+Designing networks with compact routing tables
@@ Property / cites work: Designing networks with compact routing tables / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Message Routing in Planar Networks
@@ Property / cites work: Efficient Message Routing in Planar Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Space-Efficient Message Routing in<i>c</i>-Decomposable Networks
+Normal rank
@@ Property / cites work @@
+A survey on interval routing
@@ Property / cites work: A survey on interval routing / rank @@
+Normal rank
@@ Property / cites work @@
+Worst Case Bounds for Shortest Path Interval Routing
+Normal rank
@@ Property / cites work @@
+Space-efficiency for routing schemes of stretch factor three
+Normal rank
@@ Property / cites work @@
+Q4796196
@@ Property / cites work: Q4796196 / rank @@
+Normal rank
@@ Property / cites work @@
+Memory requirement for routing in distributed networks
+Normal rank
@@ Property / cites work @@
+Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
+Normal rank
@@ Property / cites work @@
+The Compactness of Interval Routing for Almost All Graphs
+Normal rank
@@ Property / cites work @@
+Q2768294
@@ Property / cites work: Q2768294 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Sparse communication networks and efficient routing in the plane (extended abstract)
+Normal rank
@@ Property / cites work @@
+Implicat Representation of Graphs
@@ Property / cites work: Implicat Representation of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4778559
@@ Property / cites work: Q4778559 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4829035
@@ Property / cites work: Q4829035 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4829032
@@ Property / cites work: Q4829032 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501559
@@ Property / cites work: Q4501559 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal clustering structures for hierarchical topological design of large computer networks
+Normal rank
@@ Property / cites work @@
+Lower bounds for compact routing
@@ Property / cites work: Lower bounds for compact routing / rank @@
+Normal rank
@@ Property / cites work @@
+On Multi-Label Linear Interval Routing Schemes
@@ Property / cites work: On Multi-Label Linear Interval Routing Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of shortest path and dilation bounded interval routing
+Normal rank
@@ Property / cites work @@
+Concurrent manipulation of binary search trees
@@ Property / cites work: Concurrent manipulation of binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to the theory of nested transactions
@@ Property / cites work: Introduction to the theory of nested transactions / rank @@
+Normal rank
@@ Property / cites work @@
+On Maintaining Dynamic Information in a Concurrent Environment
+Normal rank
@@ Property / cites work @@
+Distributed match-making
@@ Property / cites work: Distributed match-making / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Routing onk-Trees
@@ Property / cites work: Interval Routing onk-Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Partial characterizations of networks supporting shortest path interval labeling schemes
+Normal rank
@@ Property / cites work @@
+Q3750150
@@ Property / cites work: Q3750150 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944965
@@ Property / cites work: Q4944965 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+Q4536394
@@ Property / cites work: Q4536394 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph spanners
@@ Property / cites work: Graph spanners / rank @@
+Normal rank
@@ Property / cites work @@
+A trade-off between space and efficiency for routing tables
+Normal rank
@@ Property / cites work @@
+On the complexity of multi-dimensional interval routing schemes
+Normal rank
@@ Property / cites work @@
+Labelling and Implicit Routing in Networks
@@ Property / cites work: Labelling and Implicit Routing in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding Lowest Common Ancestors: Simplification and Parallelization
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles
@@ Property / cites work: Approximate distance oracles / rank @@
+Normal rank
@@ Property / cites work @@
+Preserving order in a forest in less than logarithmic time and linear space
+Normal rank
@@ Property / cites work @@
+Q3711761
@@ Property / cites work: Q3711761 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Routing
@@ Property / cites work: Interval Routing / rank @@
+Normal rank