| 2007 |
|---|
| 10 | EE | Almut Burchard,
Jörg Liebeherr,
Florin Ciucu:
On Q(H log H) Scaling of Network Delays.
INFOCOM 2007: 1866-1874 |
| 9 | EE | Chengzhi Li,
Almut Burchard,
Jörg Liebeherr:
A network calculus with effective bandwidth.
IEEE/ACM Trans. Netw. 15(6): 1442-1453 (2007) |
| 2006 |
|---|
| 8 | EE | Florin Ciucu,
Almut Burchard,
Jörg Liebeherr:
Scaling properties of statistical end-to-end bounds in the network calculus.
IEEE Transactions on Information Theory 52(6): 2300-2312 (2006) |
| 7 | EE | Almut Burchard,
Jörg Liebeherr,
Stephen D. Patek:
A Min-Plus Calculus for End-to-End Statistical Service Guarantees.
IEEE Transactions on Information Theory 52(9): 4105-4114 (2006) |
| 2005 |
|---|
| 6 | EE | Florin Ciucu,
Almut Burchard,
Jörg Liebeherr:
A network service curve approach for the stochastic analysis of networks.
SIGMETRICS 2005: 279-290 |
| 2003 |
|---|
| 5 | EE | Jörg Liebeherr,
Stephen D. Patek,
Almut Burchard:
Statistical Per-Flow Service Bounds in a Network with Aggregate Provisioning.
INFOCOM 2003 |
| 2002 |
|---|
| 4 | EE | Almut Burchard,
Jörg Liebeherr,
Stephen D. Patek:
A Calculus for End-to-end Statistical Service Guarantees
CoRR cs.NI/0205001: (2002) |
| 2000 |
|---|
| 3 | EE | Robert Boorstyn,
Almut Burchard,
Jörg Liebeherr,
Chaiwat Oottamakorn:
Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks.
INFOCOM 2000: 1223-1232 |
| 1999 |
|---|
| 2 | | Michael Aizenman,
Almut Burchard,
Charles M. Newman,
David Bruce Wilson:
Scaling limits for minimal and random spanning trees in two dimensions.
Random Struct. Algorithms 15(3-4): 319-367 (1999) |
| 1995 |
|---|
| 1 | | Almut Burchard,
Jörg Liebeherr,
Yingfeng Oh,
Sang Hyuk Son:
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems.
IEEE Trans. Computers 44(12): 1429-1442 (1995) |
