| Memento: Making Sliding Windows Efficient for Heavy Hitters | 0 | 0.34 | 2022 |
| Communication-aware Fairness in Blockchain Transaction Ordering | 0 | 0.34 | 2022 |
| Load balancing with JET: just enough tracking for connection consistency | 0 | 0.34 | 2021 |
| RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods | 0 | 0.34 | 2021 |
| Design of a Combinatorial Double Auction for Local Energy Markets | 0 | 0.34 | 2020 |
| LSQ: Load Balancing in Large-Scale Heterogeneous Systems with Multiple Dispatchers | 1 | 0.35 | 2020 |
| Discrete and stochastic coalitional storage games | 0 | 0.34 | 2020 |
| Combflex: a linear combinatorial auction for local energy markets | 1 | 0.37 | 2020 |
| Exploiting Flexibility in Irrigation While Maintaining Optimal Crop Productivity | 0 | 0.34 | 2019 |
| Enforcing Fairness in Blockchain Transaction Ordering | 2 | 0.42 | 2019 |
| The effect of ramp constraints on coalitional storage games. | 2 | 0.44 | 2019 |
| Minimum-Weight Link-Disjoint Node-"Somewhat Disjoint" Paths. | 2 | 0.37 | 2018 |
| Memento: making sliding windows efficient for heavy hitters | 3 | 0.41 | 2018 |
| AnchorHash: A Scalable Consistent Hash | 0 | 0.34 | 2018 |
| Proxy Voting for Better Outcomes. | 0 | 0.34 | 2017 |
| Strategic Formation of Heterogeneous Networks. | 0 | 0.34 | 2017 |
| No Packet Left Behind: Avoiding Starvation in Dynamic Topologies. | 2 | 0.42 | 2017 |
| dRMT: Disaggregated Programmable Switching | 16 | 0.62 | 2017 |
| Establishing Multiple Survivable Connections (Extended Version). | 0 | 0.34 | 2016 |
| Reversing the supermarket: A distributed approach for handling elasticity in the cloud. | 0 | 0.34 | 2016 |
| Replication-based Load Balancing | 10 | 0.48 | 2016 |
| Optimal link-disjoint node-“somewhat disjoint” paths | 0 | 0.34 | 2016 |
| Composite-Path Switching | 2 | 0.39 | 2016 |
| Optics in Data Centers: Adapting to Diverse Modern Workloads. | 0 | 0.34 | 2016 |
| Formation Games Of Reliable Networks | 6 | 0.49 | 2015 |
| Minimum Energy Routing and Jamming to Thwart Wireless Network Eavesdroppers | 14 | 0.58 | 2015 |
| "Don't let the stack get stuck": A novel approach for designing efficient stackable routers. | 0 | 0.34 | 2015 |
| “Beat-Your-Rival” Routing Games | 0 | 0.34 | 2015 |
| Workload Factoring: A Game-Theoretic Perspective | 2 | 0.40 | 2015 |
| Resource Allocation And Management In Cloud Computing | 3 | 0.47 | 2015 |
| Topology Design of Communication Networks: A Game-Theoretic Perspective | 5 | 0.46 | 2014 |
| Tunable survivable spanning trees. | 1 | 0.38 | 2014 |
| Network formation games with heterogeneous players and the internet structure | 8 | 0.58 | 2014 |
| Localized epidemic detection in networks with overwhelming noise. | 8 | 0.49 | 2014 |
| Constrained Maximum Flow in Stochastic Networks | 1 | 0.34 | 2014 |
| Tunable QoS-aware network survivability | 6 | 0.44 | 2013 |
| Schedule first, manage later: Network-aware load balancing | 3 | 0.46 | 2013 |
| Efficient wireless security through jamming, coding and routing | 7 | 0.47 | 2013 |
| Worst-Case Coalitions in Routing Games. | 3 | 0.65 | 2013 |
| Formation Games and the Internet Structure. | 3 | 0.44 | 2013 |
| How good is bargained routing? | 1 | 0.36 | 2012 |
| Dynamic power allocation under arbitrary varying channels: an online approach | 9 | 0.62 | 2012 |
| Distributed oblivious load balancing using prioritized job replication | 3 | 0.43 | 2012 |
| Survivable impairment-aware traffic grooming in WDM rings | 3 | 0.49 | 2011 |
| Special Issue: Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks: selected papers from WiOpt 2010. | 0 | 0.34 | 2011 |
| Non-Cooperative Cost Sharing Games via Subsidies | 8 | 0.58 | 2010 |
| Topology Design and Control: A Game-Theoretic Perspective | 15 | 0.71 | 2009 |
| On-line survivable routing in WDM networks | 3 | 0.47 | 2009 |
| Maximum Coverage at Minimum Cost for Multi-Domain IP/MPLS Networks | 0 | 0.34 | 2008 |
| Quasi-opportunistic Supercomputing in Grid Environments | 1 | 0.36 | 2008 |
