( en | de | ru )

 

Disambiguation of "Proietti, Guido"

Author of the publication

copydeleteadd this publication to your clipboard
Rational Fair Consensus in the Gossip Model.

, , , and . IPDPS, page 163-171. IEEE Computer Society, (2017)

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.

Bruno Remo Guidotti

Sauter Guido

Curt Guido

Isabella Guido

Luca Guido

 

Other publications of authors with the same name

An algorithm composition scheme preserving monotonicity., , , and . PODC, page 360-361. ACM, (2007)Selectivity Estimation of Window Queries., and . CIKM, page 340-347. ACM, (1998)Accurate Modeling of Region Data., and . IEEE Trans. Knowl. Data Eng., 13 (6): 874-883 (2001)Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem., , , , and . J. Comb. Optim., 38 (1): 165-184 (2019)Optimizing Nozzle Travel Time in Proton Therapy., , , , , , , , , and 1 other author(s). CBMS, page 441-446. IEEE, (2022)On the Clustered Shortest-Path Tree Problem., , , , and . ICTCS, volume 1720 of CEUR Workshop Proceedings, page 263-268. CEUR-WS.org, (2016)Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary., and . SOFSEM, volume 1338 of Lecture Notes in Computer Science, page 399-406. Springer, (1997)Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs., , , and . SIROCCO, volume 8179 of Lecture Notes in Computer Science, page 322-333. Springer, (2013)Range Augmentation Problems in Static Ad-Hoc Wireless Networks., and . SIROCCO, volume 3499 of Lecture Notes in Computer Science, page 49-64. Springer, (2005)On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem., , and . SIROCCO, volume 4056 of Lecture Notes in Computer Science, page 295-309. Springer, (2006)