default search action
Arne Ludwig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c12]René Otten
, Lea Schreckenberg, Patrick Vliex
Qubit Bias using a CMOS DAC at mK Temperatures. ICECS 2022 2022: 1-4
2010 – 2019
- 2018
- [j4]Klaus-Tycho Foerster
Loop-Free Route Updates for Software-Defined Networks. IEEE/ACM Trans. Netw. 26(1): 328-341 (2018) - [j3]Arsany Basta
Efficient Loop-Free Rerouting of Multiple SDN Flows. IEEE/ACM Trans. Netw. 26(2): 948-961 (2018) - [j2]Arne Ludwig, Szymon Dudycz
Transiently Policy-Compliant Network Updates. IEEE/ACM Trans. Netw. 26(6): 2569-2582 (2018) - [c11]Johannes Zerwas, Patrick Kalmbach, Carlo Fuerst, Arne Ludwig, Andreas Blenk
AHAB: Data-Driven Virtual Cluster Hunting. Networking 2018: 379-387 - 2016
- [b1]Arne Ludwig:
Dynamic aspects of network virtualization: algorithmic and economic opportunities. Technical University of Berlin, Germany, 2016 - [c10]Szymon Dudycz
Can't Touch This: Consistent Network Updates for Multiple Policies. DSN 2016: 133-143 - [c9]Apoorv Shukla, Stefan Schmid
Towards Transiently Secure Updates in Asynchronous SDNs. SIGCOMM 2016: 597-598 - [c8]Arne Ludwig, Szymon Dudycz
Transiently Secure Network Updates. SIGMETRICS 2016: 273-284 - [c7]Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski
Transiently Consistent SDN Updates: Being Greedy is Hard. SIROCCO 2016: 391-406 - [i2]Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid:
Transiently Consistent SDN Updates: Being Greedy is Hard. CoRR abs/1605.03158 (2016) - 2015
- [j1]Arne Ludwig, Stefan Schmid
Distributed Cloud Market: Who Benefits from Specification Flexibilities? SIGMETRICS Perform. Evaluation Rev. 43(3): 38-41 (2015) - [c6]Xinhui Hu, Arne Ludwig, Andréa W. Richa, Stefan Schmid
Competitive Strategies for Online Cloud Resource Allocation with Discounts: The 2-Dimensional Parking Permit Problem. ICDCS 2015: 93-102 - [c5]Arne Ludwig, Jan Marcinkowski
Scheduling Loop-free Network Updates: It's Good to Relax! PODC 2015: 13-22 - [i1]Arne Ludwig, Carlo Fuerst, Alexander Henze, Stefan Schmid:
Opposites Attract: Virtual Cluster Embedding for Profit. CoRR abs/1511.02354 (2015) - 2014
- [c4]Arne Ludwig, Matthias Rost, Damien Foucard, Stefan Schmid
Good Network Updates for Bad Packets: Waypoint Enforcement Beyond Destination-Based Routing Policies. HotNets 2014: 15:1-15:7 - 2013
- [c3]Arne Ludwig, Stefan Schmid
Specificity vs. flexibility: On the embedding cost of a virtual network. ITC 2013: 1-9 - 2012
- [c2]Arne Ludwig, Stefan Schmid
The Price of Specificity in the Age of Network Virtualization. UCC 2012: 187-190
1990 – 1999
- 1994
- [c1]Arne Ludwig:
An image processing language for digital radiography systems. CBMS 1994: 276-280
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-08-05 20:18 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: