String realizers of posets with applications to distributed computing

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2001, Pages 72-80

  Garg, V K ^a   Skawratananond, C ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DATABASE SYSTEMS; ENCODING (SYMBOLS); THEOREM PROVING;

CLASSICAL DIMENSION THEORY; DISTRIBUTED COMPUTING; FINITE DISTRIBUTIVE LATTICE; PARTIALLY ORDERED SET; STRING REALIZER;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0034771641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/383962.383988     Document Type: Conference Paper

References (15)

1. Efficient management of transitive relationships in large data bases including is-a hierarchies
2. Lattice theory
3. Codages et dimensions de relations binaires
4. Concerning the size of logical clocks in distributed systems
5. Efficient handling of multiple inheritance hierarchies
6. Decomposition theorem for partially order sets
7. Partially order sets
8. Exploiting the induced order on type-labeled graphs for fast knowledge retrieval
9. Partial orders for parallel debugging
10. Embedding partially ordered sets into chain-products
11. Time, clocks, and the ordering of events in a distributed system
12. Virtual time and global states of distributed systems
13. Enumerative Combinatorics Volumn 1