default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteffen Bondorf
Person information
- affiliation: Ruhr University Bochum, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Boyang Zhou, Isaac Howenstine, Liang Cheng, Steffen Bondorf:
Breaking Cyclic Dependencies for Network Calculus using Service Partitioning. SIGMETRICS Perform. Evaluation Rev. 51(4): 32-42 (2024)- [i7]Steffen Bondorf, Anne Bouillard, Markus Fidler, Jörg Liebeherr, Lisa Maile:
Network Calculus (Dagstuhl Seminar 24141). Dagstuhl Reports 14(4): 1-22 (2024) - 2023
- [j7]Fabien Geyer
, Alexander Scheffler, Steffen Bondorf:
Network Calculus With Flow Prolongation - A Feedforward FIFO Analysis Enabled by ML. IEEE Trans. Computers 72(1): 97-110 (2023) - [j6]David A. Nascimento, Steffen Bondorf, Divanilson R. Campelo:
Modeling and Analysis of Time-Aware Shaper on Half-Duplex Ethernet PLCA Multidrop. IEEE Trans. Commun. 71(4): 2216-2229 (2023) - [c26]Patrick Laskowski, Peter Detzner, Steffen Bondorf:
Tree-structured Overlays with Minimal Height: Construction, Maintenance and Operation. DEBS 2023: 168-176 - [i6]Fabien Geyer, Steffen Bondorf:
Differentiable Programming & Network Calculus: Configuration Synthesis under Delay Constraints. CoRR abs/2307.14280 (2023) - 2022
- [c25]Fabien Geyer, Steffen Bondorf:
Network Synthesis under Delay Constraints: The Power of Network Calculus Differentiability. INFOCOM 2022: 1539-1548 - [c24]Peter Detzner, Jana Gödeke, Steffen Bondorf:
Peer Discovery in Tree-Structured P2P Overlay Networks by Means of Connected Dominating Sets. LCN 2022: 447-454 - [c23]Alexander Scheffler, Jens B. Schmitt, Steffen Bondorf:
Searching for Upper Delay Bounds in FIFO Multiplexing Feedforward Networks. RTNS 2022: 230-241 - [i5]Fabien Geyer, Alexander Scheffler, Steffen Bondorf:
Network Calculus with Flow Prolongation - A Feedforward FIFO Analysis enabled by ML. CoRR abs/2202.03004 (2022) - 2021
- [j5]Steffen Bondorf, Binbin Chen, Jonathan Scarlett, Haifeng Yu, Yuda Zhao:
Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding. IEEE Trans. Inf. Theory 67(3): 1559-1570 (2021) - [j4]Fabien Geyer, Steffen Bondorf:
Graph-Based Deep Learning for Fast and Tight Network Calculus Analyses. IEEE Trans. Netw. Sci. Eng. 8(1): 75-88 (2021) - [c22]Peter Detzner, Jana Gödeke, Steffen Bondorf:
Low-Cost Search in Tree-Structured P2P Overlays: The Null-Balance Benefit. LCN 2021: 613-620 - [c21]Alexander Scheffler, Steffen Bondorf:
Network Calculus for Bounding Delays in Feedforward Networks of FIFO Queueing Systems. QEST 2021: 149-167 - [c20]Fabien Geyer, Alexander Scheffler, Steffen Bondorf:
Tightening Network Calculus Delay Bounds by Predicting Flow Prolongations in the FIFO Analysis. RTAS 2021: 157-170 - 2020
- [c19]Bruno Cattelan, Steffen Bondorf, Alberto E. Schaeffer-Filho:
An Empirical Study of Tightest Network Calculus Analyses for Networks with Multicast Flows. COMPSAC 2020: 601-606 - [c18]Bruno Cattelan, Steffen Bondorf:
On Delay Bounds and Measurements: A COTS Testbed for Network Performance Experimentation. COMPSAC 2020: 1133-1138 - [c17]Fabien Geyer, Steffen Bondorf:
On the Robustness of Deep Learning-predicted Contention Models for Network Calculus. ISCC 2020: 1-7 - [c16]Steffen Bondorf, Fabien Geyer:
Virtual Cross-Flow Detouring in the Deterministic Network Calculus Analysis. Networking 2020: 554-558
2010 – 2019
- 2019
- [c15]Fabien Geyer, Steffen Bondorf:
DeepTMA: Predicting Effective Contention Models for Network Calculus using Graph Neural Networks. INFOCOM 2019: 1009-1017 - [c14]Steffen Bondorf, Binbin Chen, Jonathan Scarlett, Haifeng Yu, Yuda Zhao:
Cross-sender bit-mixing coding. IPSN 2019: 205-216 - [p1]Steffen Bondorf, Fabien Geyer:
Deterministic Network Calculus Analysis of Multicast Flows. Systems Modeling: Methodologies and Tools 2019: 63-78 - [i4]Steffen Bondorf, Binbin Chen, Jonathan Scarlett, Haifeng Yu, Yuda Zhao:
Sublinear-Time Non-Adaptive Group Testing with O(k log n) Tests via Bit-Mixing Coding. CoRR abs/1904.10102 (2019) - [i3]Fabien Geyer, Steffen Bondorf:
On the Robustness of Deep Learning-predicted Contention Models for Network Calculus. CoRR abs/1911.10522 (2019) - 2018
- [c13]Alexander Scheffler, Markus Fogen, Steffen Bondorf:
The Deterministic Network Calculus Analysis: Reliability Insights and Performance Improvements. CAMAD 2018: 1-6 - [c12]Steffen Bondorf, Paul Nikolaus, Jens B. Schmitt:
Catching Corner Cases in Network Calculus - Flow Segregation Can Improve Accuracy. MMB 2018: 218-233 - [i2]Steffen Bondorf, Binbin Chen, Jonathan Scarlett, Haifeng Yu, Yuda Zhao:
Cross-Sender Bit-Mixing Coding. CoRR abs/1807.04449 (2018) - 2017
- [j3]Jens B. Schmitt, Steffen Bondorf, Wint Yi Poe:
The Sensor Network Calculus as Key to the Design of Wireless Sensor Networks with Predictable Performance. J. Sens. Actuator Networks 6(3): 21 (2017) - [j2]Steffen Bondorf, Paul Nikolaus, Jens B. Schmitt:
Quality and Cost of Deterministic Network Calculus: Design and Evaluation of an Accurate and Fast Analysis. Proc. ACM Meas. Anal. Comput. Syst. 1(1): 16:1-16:34 (2017) - [c11]Steffen Bondorf:
Better bounds by worse assumptions - Improving network calculus accuracy by adding pessimism to the network model. ICC 2017: 1-7 - [c10]Kai Lampka, Steffen Bondorf, Jens B. Schmitt, Nan Guan, Wang Yi:
Generalized finitary real-time calculus. INFOCOM 2017: 1-9 - [c9]Steffen Bondorf, Paul Nikolaus, Jens B. Schmitt:
Quality and Cost of Deterministic Network Calculus: Design and Evaluation of an Accurate and Fast Analysis. SIGMETRICS (Abstracts) 2017: 65 - 2016
- [b1]Steffen Bondorf:
Worst-Case Performance Analysis of Feed-Forward Networks - An Efficient and Accurate Network Calculus. Kaiserslautern University of Technology, Germany, 2016 - [j1]Steffen Bondorf, Jens B. Schmitt:
Calculating Accurate End-to-End Delay Bounds - You Better Know Your Cross-Traffic. EAI Endorsed Trans. Ubiquitous Environ. 3(11): e1 (2016) - [c8]Kai Lampka, Steffen Bondorf, Jens B. Schmitt:
Achieving Efficiency without Sacrificing Model Accuracy: Network Calculus on Compact Domains. MASCOTS 2016: 313-318 - [c7]Steffen Bondorf, Jens B. Schmitt:
Improving Cross-Traffic Bounds in Feed-Forward Networks - There is a Job for Everyone. MMB/DFT 2016: 9-24 - [c6]Steffen Bondorf, Jens B. Schmitt:
Should Network Calculus Relocate? An Assessment of Current Algebraic and Optimization-Based Analyses. QEST 2016: 207-223 - [c5]Steffen Bondorf, Fabien Geyer:
Generalizing Network Calculus Analysis to Derive Performance Guarantees for Multicast Flows. VALUETOOLS 2016 - [i1]Steffen Bondorf, Paul Nikolaus, Jens B. Schmitt:
Delay Bounds in Feed-Forward Networks - A Fast and Accurate Network Calculus Solution. CoRR abs/1603.02094 (2016) - 2015
- [c4]Steffen Bondorf, Jens B. Schmitt:
Boosting sensor network calculus by thoroughly bounding cross-traffic. INFOCOM 2015: 235-243 - 2014
- [c3]Steffen Bondorf, Jens B. Schmitt:
The DiscoDNC v2 - A Comprehensive Tool for Deterministic Network Calculus. VALUETOOLS 2014 - 2011
- [c2]Jens B. Schmitt, Nicos Gollan, Steffen Bondorf, Ivan Martinovic:
Pay bursts only once holds for (some) non-FIFO systems. INFOCOM 2011: 1970-1978 - 2010
- [c1]Steffen Bondorf, Jens B. Schmitt:
Statistical response time bounds in randomly deployed wireless sensor networks. LCN 2010: 340-343
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-10-09 20:30 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:
