default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlmut Burchard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Majid Raeis, Almut Burchard, Jörg Liebeherr
:
Analysis of a Queueing Model for Energy Storage Systems with Self-discharge. ACM Trans. Model. Perform. Evaluation Comput. Syst. 5(3): 14:1-14:26 (2020)
2010 – 2019
- 2018
- [c10]Almut Burchard, Jörg Liebeherr:
A General Per-Flow Service Curve for GPS. ITC (2) 2018: 31-36 - [i7]Almut Burchard, Jörg Liebeherr:
A General Per-Flow Service Curve for GPS. CoRR abs/1804.08034 (2018) - 2017
- [i6]Majid Raeis, Almut Burchard, Jörg Liebeherr:
Analysis of the Leakage Queue: A Queueing Model for Energy Storage Systems with Self-discharge. CoRR abs/1710.09506 (2017) - 2016
- [j12]Hussein Al-Zubaidy, Jörg Liebeherr, Almut Burchard:
Network-Layer Performance Analysis of Multihop Fading Channels. IEEE/ACM Trans. Netw. 24(1): 204-217 (2016) - [c9]Alireza Shekaramiz, Jörg Liebeherr, Almut Burchard:
Network Calculus Analysis of a Feedback System with Random Service. SIGMETRICS 2016: 393-394 - 2015
- [i5]Alireza Shekaramiz, Jörg Liebeherr, Almut Burchard:
Window Flow Control Systems with Random Service. CoRR abs/1507.04631 (2015) - 2013
- [c8]Hussein Al-Zubaidy, Jörg Liebeherr, Almut Burchard:
A (min, ×) network calculus for multi-hop fading channels. INFOCOM 2013: 1833-1841 - 2012
- [j11]Jörg Liebeherr, Almut Burchard, Florin Ciucu:
Delay Bounds in Communication Networks With Heavy-Tailed and Self-Similar Traffic. IEEE Trans. Inf. Theory 58(2): 1010-1024 (2012) - [i4]Hussein Al-Zubaidy, Jörg Liebeherr, Almut Burchard:
A Network Calculus Approach for the Analysis of Multi-Hop Fading Channels. CoRR abs/1207.6630 (2012) - 2011
- [j10]Jörg Liebeherr, Yashar Ghiassi-Farrokhfal, Almut Burchard:
On the Impact of Link Scheduling on End-to-End Delays in Large Networks. IEEE J. Sel. Areas Commun. 29(5): 1009-1020 (2011) - [j9]Almut Burchard, Marina Chugunova:
On Computing the Instability Index of a Non-Self-Adjoint Differential Operator Associated with Coating and Rimming Flows. SIAM J. Math. Anal. 43(1): 367-388 (2011) - [j8]Almut Burchard, Jörg Liebeherr, Florin Ciucu:
On superlinear scaling of network delays. IEEE/ACM Trans. Netw. 19(4): 1043-1056 (2011) - [c7]Yashar Ghiassi-Farrokhfal, Jörg Liebeherr, Almut Burchard:
The impact of link scheduling on long paths: Statistical analysis and optimal bounds. INFOCOM 2011: 1242-1250 - [i3]Yashar Ghiassi-Farrokhfal, Jörg Liebeherr, Almut Burchard:
Statistical Analysis of Link Scheduling on Long Paths. CoRR abs/1101.1237 (2011) - 2010
- [c6]Jörg Liebeherr, Yashar Ghiassi-Farrokhfal, Almut Burchard:
Does Link Scheduling Matter on Long Paths?. ICDCS 2010: 199-208 - [c5]Jörg Liebeherr, Almut Burchard, Florin Ciucu:
Non-asymptotic Delay Bounds for Networks with Heavy-Tailed Traffic. INFOCOM 2010: 1325-1333
2000 – 2009
- 2009
- [i2]Jörg Liebeherr, Almut Burchard, Florin Ciucu:
Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic. CoRR abs/0911.3856 (2009) - 2007
- [j7]Chengzhi Li, Almut Burchard, Jörg Liebeherr:
A network calculus with effective bandwidth. IEEE/ACM Trans. Netw. 15(6): 1442-1453 (2007) - [c4]Almut Burchard, Jörg Liebeherr, Florin Ciucu:
On Q(H log H) Scaling of Network Delays. INFOCOM 2007: 1866-1874 - 2006
- [j6]Almut Burchard, Jochen Denzler:
On the Geometry of Optimal Windows, with Special Focus on the Square. SIAM J. Math. Anal. 37(6): 1800-1827 (2006) - [j5]Florin Ciucu, Almut Burchard, Jörg Liebeherr:
Scaling properties of statistical end-to-end bounds in the network calculus. IEEE Trans. Inf. Theory 52(6): 2300-2312 (2006) - [j4]Almut Burchard, Jörg Liebeherr, Stephen D. Patek:
A Min-Plus Calculus for End-to-End Statistical Service Guarantees. IEEE Trans. Inf. Theory 52(9): 4105-4114 (2006) - 2005
- [c3]Florin Ciucu, Almut Burchard, Jörg Liebeherr:
A network service curve approach for the stochastic analysis of networks. SIGMETRICS 2005: 279-290 - 2003
- [c2]Jörg Liebeherr, Stephen D. Patek, Almut Burchard:
Statistical Per-Flow Service Bounds in a Network with Aggregate Provisioning. INFOCOM 2003: 1680-1690 - 2002
- [i1]Almut Burchard, Jörg Liebeherr, Stephen D. Patek:
A Calculus for End-to-end Statistical Service Guarantees. CoRR cs.NI/0205001 (2002) - 2000
- [j3]Robert R. Boorstyn, Almut Burchard, Jörg Liebeherr, Chaiwat Oottamakorn:
Statistical service assurances for traffic scheduling algorithms. IEEE J. Sel. Areas Commun. 18(12): 2651-2664 (2000) - [c1]Robert R. Boorstyn, Almut Burchard, Jörg Liebeherr, Chaiwat Oottamakorn:
Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks. INFOCOM 2000: 1223-1232
1990 – 1999
- 1999
- [j2]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
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
