( en | de | ru )

 

Disambiguation of "Ianni, Miriam Di"

Author of the publication

copydeleteadd this publication to your clipboard
Distributed Community Detection in Dynamic Graphs

, , , , and . CoRR, (2013)

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.

Alen Ianni

Sara Ianni

Inge Ianniello

Remo Ianniello

Angela Alexandra Ingrid Ianni

 

Other publications of authors with the same name

Wormhole Deadlock Prediction.. Parallel Process. Lett., 10 (4): 295-304 (2000)Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees., and . Euro-Par, volume 1470 of Lecture Notes in Computer Science, page 1029-1039. Springer, (1998)Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract)., , and . Euro-Par, Vol. II, volume 1124 of Lecture Notes in Computer Science, page 594-601. Springer, (1996)Smooth movement and Manhattan path based Random Waypoint mobility., , , , , and . Inf. Process. Lett., 111 (5): 239-246 (2011)Opinion Evolution among friends and foes: the deterministic Majority Rule - extended abstract.. CoRR, (2022)Complexity of Scorpion Solitaire and applications to Klondike., and . ICTCS, volume 2756 of CEUR Workshop Proceedings, page 172-183. CEUR-WS.org, (2020)Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings., , , , and . WG, volume 5344 of Lecture Notes in Computer Science, page 90-100. (2008)Distributed Community Detection in Dynamic Graphs - (Extended Abstract)., , , , and . SIROCCO, volume 8179 of Lecture Notes in Computer Science, page 1-12. Springer, (2013)Optimum Schedule Problems in Store and Forward Networks., and . INFOCOM, page 1336-1343. IEEE Computer Society, (1994)Latency-Bounded Target Set Selection in Signed Networks., and . Algorithms, 13 (2): 32 (2020)