( en | de | ru )

 

Disambiguation of "Andreica, Mugurel Ionut"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Scheduling of Two Communication Flows on Multiple Disjoint Packet-Type Aware Paths.

, and . SYNASC, page 137-144. IEEE Computer Society, (2008)

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.

Ionut Tranca

Ionut Radu

Ionut Porumbel

Andrei Ionut Mardare

Ionut Daniel Vlad

 

Other publications of authors with the same name

Towards Using SCTP as a Data Transport Protocol for Data-Intensive Batch Jobs., , , and . CSCS, page 83-90. IEEE, (2013)Optimal Scheduling of Two Communication Flows on Multiple Disjoint Packet-Type Aware Paths., and . SYNASC, page 137-144. IEEE Computer Society, (2008)Towards a Real-Time Scheduling Framework for Data Transfers in Tree Networks., and . SYNASC, page 467-474. IEEE Computer Society, (2008)Constrained Content Distribution and Communication Scheduling for Several Restricted Classes of Graphs., and . SYNASC, page 129-136. IEEE Computer Society, (2008)Inferring Company Structure from Limited Available Information, , and . CoRR, (2008)Replication mechanisms for a distributed time series storage and retrieval service., , and . ICAC, page 161-162. ACM, (2011)Brief announcement: decentralized construction of multicast trees embedded into P2P overlay networks based on virtual geometric coordinates., , , and . PODC, page 283-284. ACM, (2010)Strategies for Assigning Virtual Geometric Node Coordinates in Peer-to-Peer Overlays., , and . 3PGCIC, page 253-258. IEEE Computer Society, (2011)A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth. CoRR, (2008)Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints., , and . SYNASC, page 265-272. IEEE Computer Society, (2009)