Miriam Di Ianni
Orcid: 0000-0002-1699-5802
According to our database1,
Miriam Di Ianni
authored at least 40 papers
between 1990 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
2
1
1
1
1
2
1
1
1
1
3
1
2
1
2
1
1
1
1
1
2
1
1
3
2
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Theor. Comput. Sci., May, 2023
Inf. Process. Lett., 2023
2022
Opinion Evolution among friends and foes: the deterministic Majority Rule - extended abstract.
CoRR, 2022
2021
Theor. Comput. Sci., 2021
2020
2016
Theor. Comput. Sci., 2016
2015
Inf. Process. Lett., 2015
2013
Proceedings of the Structural Information and Communication Complexity, 2013
2011
Inf. Process. Lett., 2011
2009
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.
Proceedings of the Structural Information and Communication Complexity, 2009
2008
Theor. Comput. Sci., 2008
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008
Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008
2007
On the bounded-hop MST problem on random Euclidean instances.
Theor. Comput. Sci., 2007
Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007
2006
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, 2006
2005
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
Proceedings of the Structural Information and Communication Complexity, 2005
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005
2004
J. Discrete Algorithms, 2004
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
Proceedings of the STACS 2004, 2004
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004
2003
The minimum broadcast range assignment problem on linear multi-hop wireless networks.
Theor. Comput. Sci., 2003
Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Benes networks.
J. Parallel Distributed Comput., 2003
2002
Approximation algorithms for routing and call scheduling in all-optical chains and rings.
Theor. Comput. Sci., 2002
2000
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems.
IEEE Trans. Parallel Distributed Syst., 2000
1998
Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees.
Proceedings of the Euro-Par '98 Parallel Processing, 1998
1997
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997
1996
On the hardness of approximating optimum schedule problems in store and forward networks.
IEEE/ACM Trans. Netw., 1996
Proceedings of the Euro-Par '96 Parallel Processing, 1996
Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract).
Proceedings of the Euro-Par '96 Parallel Processing, 1996
1995
Int. J. Found. Comput. Sci., 1995
Systolic Acyclic Orientations for Deadlock Prevention.
Proceedings of the Structure, Information and Communication Complexity, 1995
1990
Int. J. Found. Comput. Sci., 1990