Eytan H. Modiano

Eytan H. Modiano

Massachusetts Institute of Technology

Professor

Department of Aeronautics and Astronautics

Research Area

  • #Computer science
  • #Computer network
  • #Distributed computing
  • #Wireless network
  • #Throughput
  • #Wireless
  • #Approximation algorithm
  • #Telecommunications network
  • #Interference (wave propagation)
  • #Queueing theory

Get access to
Contact information

Log in

Related papers to
‘ Computer science ‘ : 16

  • Geographic max-flow and min-cut under a circular disk failure model

    2015/02

    1.4 Impact Factor

    71 citations

    Sebastian Neumayer, Alon Efrat, Eytan Modiano

    DOI : 10.1016/J.COMNET.2014.10.026

    • #Computer science
    • #Mathematical optimization
    • #Distributed computing
    • #Time complexity
    • #Disjoint sets
    • #Exact algorithm
    • #Heuristic (computer science)
    • #Electromagnetic pulse
    • #Maximum flow problem
    • #Network survivability
    • #Max-flow min-cut theorem

All papers authored by
‘ Eytan H. Modiano ’ : 19

  • Geographic max-flow and min-cut under a circular disk failure model

    2015/02
    COMPUTER NETWORKS

    1.4 Impact Factor

    71 citations

    Sebastian Neumayer, Alon Efrat, Eytan Modiano

    DOI : 10.1016/J.COMNET.2014.10.026

    • #Computer science
    • #Mathematical optimization
    • #Distributed computing
    • #Time complexity
    • #Disjoint sets
    • #Exact algorithm
    • #Heuristic (computer science)
    • #Electromagnetic pulse
    • #Maximum flow problem
    • #Network survivability
    • #Max-flow min-cut theorem

Related papers to
‘ Computer science ‘ : 16

  • Geographic max-flow and min-cut under a circular disk failure model

    2015/02
    COMPUTER NETWORKS

    1.4 Impact Factor

    71 citations

    Sebastian Neumayer, Alon Efrat, Eytan Modiano

    DOI : 10.1016/J.COMNET.2014.10.026

    • #Computer science
    • #Mathematical optimization
    • #Distributed computing
    • #Time complexity
    • #Disjoint sets
    • #Exact algorithm
    • #Heuristic (computer science)
    • #Electromagnetic pulse
    • #Maximum flow problem
    • #Network survivability
    • #Max-flow min-cut theorem
  • Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals

    2020/12
    IEEE TRANSACTIONS ON MOBILE COMPUTING

    5.1 Impact Factor

    53 citations

    Yu-Pin Hsu, Eytan Modiano, Lingjie Duan

    DOI : 10.1109/TMC.2019.2936199

    • #Computer science
    • #Mathematical optimization
    • #Wireless
    • #Scheduling (computing)
    • #Computational complexity theory
    • #Markov process
    • #Network performance
    • #Information Age
    • #Markov decision process
    • #Wireless broadcast

Get access to
Contact information

Log in

All papers authored by
‘ Eytan H. Modiano ’ : 19

  • Geographic max-flow and min-cut under a circular disk failure model

    2015/02
    COMPUTER NETWORKS

    1.4 Impact Factor

    71 citations

    Sebastian Neumayer, Alon Efrat, Eytan Modiano

    DOI : 10.1016/J.COMNET.2014.10.026

    • #Computer science
    • #Mathematical optimization
    • #Distributed computing
    • #Time complexity
    • #Disjoint sets
    • #Exact algorithm
    • #Heuristic (computer science)
    • #Electromagnetic pulse
    • #Maximum flow problem
    • #Network survivability
    • #Max-flow min-cut theorem
  • Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals

    2020/12
    IEEE TRANSACTIONS ON MOBILE COMPUTING

    5.1 Impact Factor

    53 citations

    Yu-Pin Hsu, Eytan Modiano, Lingjie Duan

    DOI : 10.1109/TMC.2019.2936199

    • #Computer science
    • #Mathematical optimization
    • #Wireless
    • #Scheduling (computing)
    • #Computational complexity theory
    • #Markov process
    • #Network performance
    • #Information Age
    • #Markov decision process
    • #Wireless broadcast

Get access to Contact information

Log in
scholarship

Are you Thesis Advisor?
Register and Get Benefits from PhD.GO!

Learn more

Blog