The following pages link to Ariel Orda (Q287029):
Displaying 33 items.
- (Q169005) (redirect page) (← links)
- Efficient test \& set constructions for faulty shared memory (Q287031) (← links)
- Location of central nodes in time varying computer networks (Q811350) (← links)
- EquiCast: scalable multicast with selfish users (Q838503) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Dynamic service sharing with heterogeneous preferences (Q1587099) (← links)
- Incentive compatible pricing strategies for QoS routing (Q1770818) (← links)
- Incentive pricing in multiclass systems (Q1854806) (← links)
- Admission control in networks with advance reservations (Q1884772) (← links)
- Optimal sliding-window strategies in networks with long round-trip delays (Q1887182) (← links)
- On continuous network flows (Q1892659) (← links)
- RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods (Q2071508) (← links)
- Design of a combinatorial double auction for local energy markets (Q2090273) (← links)
- (Q3128936) (← links)
- Capacity allocation under noncooperative routing (Q3129377) (← links)
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length (Q3477968) (← links)
- Minimum weight paths in time-dependent networks (Q3971577) (← links)
- Avoiding the Braess paradox in non-cooperative networks (Q4261298) (← links)
- Optimal packet fragmentation and routing in computer networks (Q4345570) (← links)
- Scheduled Hot-Potato Routing (Q4397215) (← links)
- (Q4411289) (← links)
- (Q4635997) (← links)
- Tight Bounds for Dynamic Storage Allocation (Q4875443) (← links)
- Persistent-Idle Load-Distribution (Q5119416) (← links)
- Distributed shortest-path protocols for time-dependent networks (Q5137327) (← links)
- EquiCast (Q5177265) (← links)
- Non-cooperative Cost Sharing Games Via Subsidies (Q5459998) (← links)
- “Beat-Your-Rival” Routing Games (Q5896078) (← links)
- Dynamic storage allocation with known durations (Q5896857) (← links)
- “Beat-Your-Rival” Routing Games (Q5899478) (← links)
- Dynamic storage allocation with known durations (Q5918029) (← links)
- Bandwidth allocation for guaranteed versus best effort service categories (Q5928748) (← links)
- Atomic resource sharing in noncooperative networks (Q5944340) (← links)
