Figure 17 - uploaded by Giuseppe Scollo
Content may be subject to copyright.
Download
View publication
First phase source tree reductions with default tactics: (i,ii) bottom-up, (iii,iv) top- down.  

First phase source tree reductions with default tactics: (i,ii) bottom-up, (iii,iv) top- down.  

Source publication
Figure 1: Signed reassociation
Figure 2: Edge-labelled reassociation  
Figure 3: Backbone representation of reassociations and of solutions
Figure 4: Top edge reassociation as first move  
+13 Figure 5: Combined reassociation moves and reduction steps
Reducibility and Solvability of Some Classes of Kryuchkov Binary Tree Pairs
Article
Full-text available
  • Jan 2012
This paper addresses the problem of characterizing classes of pairs of binary trees of equal size for which a signed reassociation sequence, in the Eliahou-Kryuchkov sense, can be shown to exist, either with a size induction hypothesis (reducible pairs), or without it (solvable pairs). A few concepts proposed by Cooper, Rowland and Zeilberger, in t...
Cite
Download full-text

Similar publications

Figure 1. 
What matters in business/it shared understanding? Development of a unified construct
Conference Paper
Full-text available
  • Jan 2014
The mutual understanding, shared knowledge, or cognition between business and IT units has been discussed frequently and in wide range of fields in IS research. On the other hand, we are still lacking a consistent and comprehensive conceptualization of what shared business/IT un-derstanding is actually about, and previous studies have usually only...
View