| Publication | Date of Publication | Type |
|---|
Design of a combinatorial double auction for local energy markets
| 2022-10-24 | Paper |
RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods
Machine Learning | 2022-01-28 | Paper |
Dynamic storage allocation with known durations
Algorithms — ESA '97 | 2021-12-20 | Paper |
On the Persistent-Idle Load Distribution Policy Under Batch Arrivals and Random Service Capacity
| 2021-03-22 | Paper |
Distributed shortest-path protocols for time-dependent networks
Distributed Computing | 2020-12-02 | Paper |
Persistent-idle load-distribution
Stochastic Systems | 2020-09-04 | Paper |
“Beat-Your-Rival” Routing Games
Multilevel Strategic Interaction Game Models for Complex Networks | 2020-07-08 | Paper |
scientific article; zbMATH DE number 6863612 (Why is no real title available?)
| 2018-04-23 | Paper |
Efficient test \& set constructions for faulty shared memory
Information Processing Letters | 2016-05-26 | Paper |
``Beat-your-rival routing games
Algorithmic Game Theory | 2015-11-04 | Paper |
EquiCast, scalable multicast with selfish users
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Non-cooperative cost sharing games via subsidies
Theory of Computing Systems | 2010-08-13 | Paper |
EquiCast: scalable multicast with selfish users
Computer Networks | 2009-08-26 | Paper |
Non-cooperative Cost Sharing Games Via Subsidies
Algorithmic Game Theory | 2008-05-02 | Paper |
Incentive compatible pricing strategies for QoS routing
Networks and Spatial Economics | 2005-04-07 | Paper |
Optimal sliding-window strategies in networks with long round-trip delays
Computer Networks | 2004-11-23 | Paper |
Admission control in networks with advance reservations
Algorithmica | 2004-11-05 | Paper |
scientific article; zbMATH DE number 1947059 (Why is no real title available?)
| 2003-07-07 | Paper |
Atomic resource sharing in noncooperative networks
Telecommunication Systems | 2001-11-06 | Paper |
Bandwidth allocation for guaranteed versus best effort service categories
Queueing Systems | 2001-04-03 | Paper |
Dynamic service sharing with heterogeneous preferences
Queueing Systems | 2000-11-22 | Paper |
Avoiding the Braess paradox in non-cooperative networks
Journal of Applied Probability | 2000-08-21 | Paper |
Incentive pricing in multiclass systems
Telecommunication Systems | 2000-01-01 | Paper |
Dynamic storage allocation with known durations
Discrete Applied Mathematics | 2000-01-01 | Paper |
Scheduled Hot-Potato Routing
Journal of Graph Algorithms and Applications | 1998-07-05 | Paper |
Optimal packet fragmentation and routing in computer networks
| 1997-07-23 | Paper |
Capacity allocation under noncooperative routing
IEEE Transactions on Automatic Control | 1997-04-27 | Paper |
Tight Bounds for Dynamic Storage Allocation
SIAM Journal on Discrete Mathematics | 1996-08-13 | Paper |
On continuous network flows
Operations Research Letters | 1996-04-15 | Paper |
scientific article; zbMATH DE number 1003306 (Why is no real title available?)
| 1994-01-01 | Paper |
Minimum weight paths in time-dependent networks
Networks | 1992-06-25 | Paper |
Location of central nodes in time varying computer networks
Operations Research Letters | 1991-01-01 | Paper |
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM | 1990-01-01 | Paper |
