Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
The theory of database concurrency control
The theory of database concurrency control
Caching Hints in Distributed Systems
IEEE Transactions on Software Engineering - Special issue on distributed systems
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
On maintaining dynamic information in a concurrent environment
SIAM Journal on Computing
Concurrency versus availability: atomicity mechanisms for replicated data
ACM Transactions on Computer Systems (TOCS)
The Computer Journal
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Efficient message routing in planar networks
SIAM Journal on Computing
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Implicit representation of graphs
SIAM Journal on Discrete Mathematics
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
On devising Boolean routing schemes
Theoretical Computer Science
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Journal of Algorithms
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Worst case bounds for shortest path interval routing
Journal of Algorithms
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Multidimensional interval routing schemes
Theoretical Computer Science
Graph classes: a survey
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
SIAM Journal on Computing
Concurrency control in a dynamic search structure
ACM Transactions on Database Systems (TODS)
Towards a universal directory service
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The complexity of shortest path and dilation bounded interval routing
Theoretical Computer Science
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
SIAM Journal on Computing
Sparse communication networks and efficient routing in the plane (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Theoretical Computer Science
On the complexity of multi-dimensional interval routing schemes
Theoretical Computer Science
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact routing with minimum stretch
Journal of Algorithms
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distributed data structures in Linda
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Interval routing schemes allow broadcasting with linear message-complexity
Distributed Computing
Labeling schemes for flow and connectivity
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Routing in distributed networks: overview and open problems
ACM SIGACT News
The Compactness of Interval Routing for Almost All Graphs
SIAM Journal on Computing
Introduction to the Theory of Nested Transactions
ICDT '86 Proceedings of the International Conference on Database Theory
A Simple DFS-Based Algorithm for Linear Interval Routing
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Lower Bounds for Compact Routing (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Labeling Schemes for Dynamic Tree Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Searching among Intervals and Compact Routing Tables
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
REPLICATION METHODS FOR ABSTRACT DATA TYPES
REPLICATION METHODS FOR ABSTRACT DATA TYPES
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
ACM SIGACT news distributed computing column 13
ACM SIGACT News
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distance labeling schemes for well-separated graph classes
Discrete Applied Mathematics
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Average case analysis for tree labelling schemes
Theoretical Computer Science
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compact routing with slack in low doubling dimension
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Labeling schemes for weighted dynamic trees
Information and Computation
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Efficient First-Order Model-Checking Using Short Labels
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
Theoretical Computer Science
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
An Optimal Labeling for Node Connectivity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Labeling schemes for vertex connectivity
ACM Transactions on Algorithms (TALG)
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Distributed relationship schemes for trees
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Compact ancestry labeling schemes for XML trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Compact labelings for efficient first-order model-checking
Journal of Combinatorial Optimization
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Short labels by traversal and jumping
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Average case analysis for tree labelling schemes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Distance labeling in hyperbolic graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Localized and compact data-structure for comparability graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A dynamic implicit adjacency labelling scheme for line graphs
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Geometric routing without geometry
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Constructing labeling schemes through universal matrices
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Labeling schemes for vertex connectivity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Fault-tolerant compact routing schemes for general graphs
Information and Computation
Efficient distributed source detection with limited bandwidth
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels, selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.