Ariel Orda

From MaRDI portal
Revision as of 08:48, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Ariel Orda to Ariel Orda: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:287029

Available identifiers

zbMath Open orda.arielMaRDI QIDQ287029

List of research outcomes





PublicationDate of PublicationType
Design of a combinatorial double auction for local energy markets2022-10-24Paper
RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods2022-01-28Paper
Dynamic storage allocation with known durations2021-12-20Paper
On the Persistent-Idle Load Distribution Policy Under Batch Arrivals and Random Service Capacity2021-03-22Paper
Distributed shortest-path protocols for time-dependent networks2020-12-02Paper
Persistent-Idle Load-Distribution2020-09-04Paper
“Beat-Your-Rival” Routing Games2020-07-08Paper
https://portal.mardi4nfdi.de/entity/Q46359972018-04-23Paper
Efficient test \& set constructions for faulty shared memory2016-05-26Paper
“Beat-Your-Rival” Routing Games2015-11-04Paper
EquiCast2015-03-10Paper
Non-cooperative cost sharing games via subsidies2010-08-13Paper
EquiCast: scalable multicast with selfish users2009-08-26Paper
Non-cooperative Cost Sharing Games Via Subsidies2008-05-02Paper
Incentive compatible pricing strategies for QoS routing2005-04-07Paper
Optimal sliding-window strategies in networks with long round-trip delays2004-11-23Paper
Admission control in networks with advance reservations2004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q44112892003-07-07Paper
Atomic resource sharing in noncooperative networks2001-11-06Paper
Bandwidth allocation for guaranteed versus best effort service categories2001-04-03Paper
Dynamic service sharing with heterogeneous preferences2000-11-22Paper
Avoiding the Braess paradox in non-cooperative networks2000-08-21Paper
Incentive pricing in multiclass systems2000-01-01Paper
Dynamic storage allocation with known durations2000-01-01Paper
Scheduled Hot-Potato Routing1998-07-05Paper
Optimal packet fragmentation and routing in computer networks1997-07-23Paper
Capacity allocation under noncooperative routing1997-04-27Paper
Tight Bounds for Dynamic Storage Allocation1996-08-13Paper
On continuous network flows1996-04-15Paper
https://portal.mardi4nfdi.de/entity/Q31289361994-01-01Paper
Minimum weight paths in time-dependent networks1992-06-25Paper
Location of central nodes in time varying computer networks1991-01-01Paper
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length1990-01-01Paper

Research outcomes over time

This page was built for person: Ariel Orda