( en | de | ru )

 

Disambiguation of "Giaccio, Roberto"

Author of the publication

copydeleteadd this publication to your clipboard
Certifying performance of cooperative services in a digital government framework.

, , , , and . SAINT, page 249-256. IEEE Computer Society, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Roberto Cruccolini

Roberto Sala

Roberto Fornari

Roberto Minakawa

Roberto Ohrt

 

Other publications of authors with the same name

Incremental Hive Graph., and . WG, volume 1017 of Lecture Notes in Computer Science, page 49-61. Springer, (1995)Maintaining Maxima under Boundary Updates., , , and . CIAC, volume 1203 of Lecture Notes in Computer Science, page 100-109. Springer, (1997)E-Government Services: Certification and Security Overlay., and . Certification and Security in E-Services, volume 255 of IFIP Conference Proceedings, page 139-148. Kluwer, (2002)Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs., , and . STACS, volume 1200 of Lecture Notes in Computer Science, page 33-46. Springer, (1997)Intersection Problems on Segments Under Boundary Updates with Application to Persistent Lists., and . Int. J. Comput. Geom. Appl., 9 (6): 553-576 (1999)On-Line Algorithms for Satisfiability Problems with Uncertainty., and . Theor. Comput. Sci., 171 (1-2): 3-24 (1997)A General Framework to Deal with Sets of One-Dimensional Intervals., and . GULP, page 101-110. (1993)Logical Data Partitioning in Bitemporal Databases., and . IADT, page 320-327. Society for Design and Process Science, 1302 West 25th Street, Suite 300, Austin, TX 78705-4236, USA, (1998)Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae., , , and . ISAAC, volume 1350 of Lecture Notes in Computer Science, page 122-131. Springer, (1997)Semi-dynamic breadth-first search in digraphs., , and . Theor. Comput. Sci., 250 (1-2): 201-217 (2001)