20 search results - page 3 / 4 » Lattice Drawings and Morphisms |
STACS
1991
Springer
13 years 9 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
ICSM
2005
IEEE
13 years 11 months ago
2005
IEEE
Software merging is a common and essential activity during the lifespan of large-scale software systems. Traditional textual merge techniques are inadequate for detecting syntacti...
ICCS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
QUANTUMCOMM
2009
Springer
14 years 9 days ago
2009
Springer
Abstract. In this paper, we first critically analyze two existing latticebased cryptosystems, namely GGH and Micciancio, and identify their drawbacks. Then, we introduce a method ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...