The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Almut Burchard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  10. Does Link Scheduling Matter on Long Paths?. [Citation Graph (, )][DBLP]


  11. Non-asymptotic Delay Bounds for Networks with Heavy-Tailed Traffic. [Citation Graph (, )][DBLP]


  12. Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002