Christian Capelle  Home/Search
Context Related
| lirmm.fr/~capelle/...prartllncs.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lirmm.fr/~capelle/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We present a practical method to obtain a compact computer memory representation of orders and to compute pairwise comparisons efficiently. The principle of this method is to represent an order P as a union of interval orders P i for which an optimal representation is already known (i.e. a union representation of P [Wes85]). For a directed acyclic graph G = (X; U) representing an order P = (X; !P ), the preprocessing time complexity is not better than the transitive closure computation cost.... (Update)
Cited by: More
Efficient Subtyping Tests with PQ-Encoding - Zibin, Gil (2001) (Correct)
Active bibliography (related documents): More All
0.7: Linear Time Recognition Algorithm for Distributive Lattices - Habib, Nourine (1998) (Correct)
0.4: Embedding Partially Ordered Sets into Chain-Products - Habib, Huchard, Nourine (1995) (Correct)
0.4: Lazy Completion of a Partial Order to the Smallest Lattice - Bertet, Morvan, Nourine (1997) (Correct)
Similar documents based on text: More All
0.2: Block Decomposition of Inheritance Hierarchies - Capelle (1997) (Correct)
0.2: CSP techniques using partial orders on domain values - Bellicha, Capelle, Habib.. (1994) (Correct)
0.2: Exploitation de la relation de.. - Bellicha.. (Correct)
BibTeX entry: (Update)
C. Capelle. Representation of an order as union of interval orders. In ORDAL'94 (Orders, Algorithms and Applications), LNCS 831, pages 143--162. Springer, 1994. http://citeseer.ist.psu.edu/capelle94representation.html More
@inproceedings{ capelle94representation,
author = "Christian Capelle",
title = "Representation of an Order as Union of Interval Orders",
booktitle = "{ORDAL}",
pages = "143-161",
year = "1994",
url = "citeseer.ist.psu.edu/capelle94representation.html" }
Citations (may not include all citations):917 and the ordering of events in distributed systems (context) - Lamport, clocks - 1978
352 Virtual time and global states of distributed systems - Mattern - 1989
132 Timestamps in message-passing systems that preserve the part.. (context) - Fidge - 1988
44 This article was processed using the L A T E X macro package.. (context) - Yannakakis, of et al. - 1982
37 Efficient management of transitive relationships in large da.. (context) - Agrawal, Borgida et al. - 1989
31 Computationally tractable classes of ordered sets (context) - Mohring - 1989
25 Efficient handling of multiple inheritance hierarchies (context) - Caseau - 1993
12 Tree structure for distributive lattices and its application.. (context) - Habib, Nourine
6 A linear time and space algorithm to recognize interval orde.. (context) - Baldy, Morvan - 1993
5 the calculation of transitive reduction-closure of orders (context) - Habib, Morvan et al. - 1993
5 Quelques Propri'et'es Algorithmiques des Treillis (context) - Nourine - 1993
4 Parameters of partial orders and graphs: packing (context) - West - 1985
3 Intransitive indifference in preference theory: a survey (context) - Fishburn - 1970
3 ACM Transactions on Programming Langages and Systems (context) - Ait-Kaci, Boyer et al. - 1989
2 Transitive closure for restricted classes of partial orders (context) - Ma, Spinrad - 1991
1 Repr'esentation des ensembles ordonn'es (context) - Capelle - 1993
1 the interplay between interval dimension and ordinary dimens.. (context) - Felsner, Habib et al. - 1991
1 Estampillage des algorithmes distribu 'es et ensembles ordon.. (context) - Baldy, Fiorio - 1991
1 emes distribu (context) - Baldy, algorithmes et al. - 1994
1 Analyse de la relation de causalit'e dans les ex'ecutions r'.. (context) - Diehl - 1992
1 Algorithmes Lin'eaires et Invariants d'Ordres (context) - Morvan - 1991
1 Imlicit representation of graphs (context) - Kannan, Naor et al. - 1992
1 The interval inclusion number of a partial ordered set (context) - Madej, West - 1991
Documents on the same site (http://www.lirmm.fr/~capelle/publications.html): More
Exploitation de la relation de.. - Bellicha.. (Correct)
Graph Decompositions and Factorizing Permutations - Capelle, Habib (Correct)
CSP techniques using partial orders on domain values - Bellicha, Capelle, Habib.. (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC