Rapporti Tecnici 1996

 

 

• Model Finiteness and Functionality in a Declarative Language with Oid Invention (RT-3)
  Luca Cabibbo, Giansalvatore Mecca

 

• From Polyline to Polygon via XOR tree (RT-4)
  Claudio Baldazzi, Alberto Paoluzzi

 

• Exploiting SML for Experimenting with Algebraic Algorithms: The Example of p-adic Lifting (RT-5)
  Wolfgang Gehrke, Carla Limongelli

 

• Explicit Parallel Combinators Defined On Top of CML for Symbolic Computations (RT-6)
  Wolfgang Gehrke, Carla Limongelli

 

• Complex and Hyper-Complex Numbers: A Case Study for the Combination of Algebraic Computation and Deduction  (RT-7)
  Wolfgang Gehrke

 

• The Strength of Weak Proximity (RT-8)
  Giuseppe Di Battista, Giuseppe Liotta, Sue H. Whitesides

 

• Proximity Constraints and Representable Trees (RT-9)
  Prosenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta

 

• An abstract view of contexts in reduction systems (RT-10)
  Giulio Balestreri, Marta Cialdea Mayer

 

• The Expressive Power of Stratifed Logic Programs with Value Invention (RT-11)
  Luca Cabibbo

 

• Analysis and Optimization of Active Databases (RT-12)
  Danilo Montesi, Riccardo Torlone

 

• IsaLog(¬): a Deductive Language with Negation for Complex-Object Databases with Hierarchies (RT-13)
  Paolo Atzeni, Luca Cabibbo, Giansalvatore Mecca

 

• Sequences, Datalog and Transducers (RT-14)
  Anthony J. Bonner, Giansalvatore Mecca

 

• Mijn meester Escher a nice appendix of a course in graphic (RT-15)
  Flavio Poletti, Andrea Vitaletti

 

• Output-Sensitive Reporting of Disjoint Paths (RT-16)
  Giuseppe Di Battista, Roberto Tamassia, Luca Vismara

 

• Bijective Dimension-Independent Boundary to Interior Mapping with BSP Trees (RT-17)
  Claudio Baldazzi, Alberto Paoluzzi

 

• Uniform Representation of Basic Algebraic Structures in Computer Algebra (RT-18)
  Carla Limongelli, Giuseppina Malerba, Marco Temperini