default search action
Klaus-Tycho Förster
Klaus-Tycho Foerster
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j28]Matthew Nance Hall
, Paul Barford
Improving Scalability in Traffic Engineering via Optical Topology Programming. IEEE Trans. Netw. Serv. Manag. 21(2): 1581-1600 (2024) - [c76]Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Long Luo, Stefan Schmid:
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. INFOCOM 2024: 1461-1470 - [c75]Erik van den Akker
Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs. SIROCCO 2024: 513-519 - [i19]Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Long Luo, Stefan Schmid
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. CoRR abs/2401.04638 (2024) - [i18]Erik van den Akker, Kevin Buchin, Klaus-Tycho Foerster:
Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs. CoRR abs/2402.13845 (2024) - 2023
- [j27]Klaus-Tycho Foerster, Tomasz Jurdzinski, Stefan Schmid
Guest editorial: Structural Information and Communication Complexity 2021. Theor. Comput. Sci. 971: 113913 (2023) - [j26]Wenkai Dai
Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing. ACM Trans. Model. Perform. Evaluation Comput. Syst. 8(3): 1-30 (2023) - [c74]Stephanie Althoff
Towards Local Shortcutting of Fast Failover Routes. StudentWorkshop@CoNEXT 2023: 1-2 - [c73]Maximilian Brügge, Jasper Müller, Sai Kireet Patri, Sander Jansen, Jim Zou, Stephanie Althoff, Klaus-Tycho Förster:
Live Demonstration of ML-based PON Characterization and Monitoring. OFC 2023: 1-3 - [c72]Wenkai Dai
A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible. SPAA 2023: 153-163 - [c71]Henri Schmidt, Zeineb Rejiba
Transparent Fault Tolerance for Stateful Applications in Kubernetes with Checkpoint/Restore. SRDS 2023: 129-139 - [c70]Klaus-Tycho Foerster
Analyzing the Communication Clusters in Datacenters✱. WWW 2023: 3022-3032 - 2022
- [j25]Long Luo
Optimizing multicast flows in high-bandwidth reconfigurable datacenter networks. J. Netw. Comput. Appl. 203: 103399 (2022) - [j24]Philipp Zabka, Klaus-Tycho Foerster
Empirical evaluation of nodes and channels of the lightning network. Pervasive Mob. Comput. 83: 101584 (2022) - [j23]Maciej Pacut, Wenkai Dai, Alexandre Labbe, Klaus-Tycho Foerster, Stefan Schmid
Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion. SIGMETRICS Perform. Evaluation Rev. 49(3): 35-36 (2022) - [j22]Klaus-Tycho Foerster
Improved Fast Rerouting Using Postprocessing. IEEE Trans. Dependable Secur. Comput. 19(1): 537-550 (2022) - [c69]Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid
On the Price of Locality in Static Fast Rerouting. DSN 2022: 215-226 - [c68]Philipp Zabka, Klaus-Tycho Förster, Christian Decker, Stefan Schmid
Short Paper: A Centrality Analysis of the Lightning Network. Financial Cryptography 2022: 374-385 - [c67]Neta Rozen Schiff, Klaus-Tycho Foerster, Stefan Schmid
Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks. OPODIS 2022: 25:1-25:23 - [c66]Wenkai Dai
Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies. DISC 2022: 42:1-42:3 - [i17]Philipp Zabka, Klaus-Tycho Foerster, Stefan Schmid, Christian Decker:
A Centrality Analysis of the Lightning Network. CoRR abs/2201.07746 (2022) - [i16]Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid
On the Price of Locality in Static Fast Rerouting. CoRR abs/2204.03413 (2022) - [i15]Neta Rozen Schiff, Klaus-Tycho Foerster, Stefan Schmid
Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks. CoRR abs/2211.06131 (2022) - 2021
- [j21]Matthew Nance Hall
A Survey of Reconfigurable Optical Networks. Opt. Switch. Netw. 41: 100621 (2021) - [j20]Maciej Pacut
Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion. Perform. Evaluation 152: 102238 (2021) - [j19]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz
Input-Dynamic Distributed Algorithms for Communication Networks. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 06:1-06:33 (2021) - [c65]Oliver Schweiger, Klaus-Tycho Foerster, Stefan Schmid
Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths). ANCS 2021: 1-7 - [c64]Apoorv Shukla, Klaus-Tycho Foerster:
Shortcutting Fast Failover Routes in the Data Plane. ANCS 2021: 15-22 - [c63]Thomas Fenz
On Efficient Oblivious Wavelength Assignments for Programmable Wide-Area Topologies. ANCS 2021: 38-51 - [c62]Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
On the Feasibility of Perfect Resilience with Local Fast Failover. APOCS 2021: 55-69 - [c61]Zikai Zhou, Mu He, Wolfgang Kellerer
P4Update: fast and locally verifiable consistent network updates in the P4 data plane. CoNEXT 2021: 175-190 - [c60]Mahmoud Parham, Thomas Fenz
Traffic engineering with joint link weight and segment optimization. CoNEXT 2021: 313-327 - [c59]Niko Motschnig, Alexander Ramharter, Oliver Schweiger, Philipp Zabka, Klaus-Tycho Foerster:
On Comparing and Enhancing Two Common Approaches to Network Community Detection. GLOBECOM 2021: 1-6 - [c58]Philipp Zabka, Klaus-Tycho Förster, Stefan Schmid
Node Classification and Geographical Analysis of the Lightning Cryptocurrency Network. ICDCN 2021: 126-135 - [c57]Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid
Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes. INFOCOM 2021: 1-10 - [c56]Esra Ceylan, Klaus-Tycho Foerster, Stefan Schmid
Demand-Aware Plane Spanners of Bounded Degree. Networking 2021: 1-9 - [c55]Matthew Nance Hall, Paul Barford, Klaus-Tycho Foerster, Manya Ghobadi, William Jensen, Ramakrishnan Durairajan:
Are WANs Ready for Optical Topology Programming? OptSys@SIGCOMM 2021: 28-33 - [c54]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz
Input-Dynamic Distributed Algorithms for Communication Networks. SIGMETRICS (Abstracts) 2021: 71-72 - [i14]Niko Motschnig, Alexander Ramharter, Oliver Schweiger, Philipp Zabka, Klaus-Tycho Foerster:
On Comparing and Enhancing Common Approaches to Network Community Detection. CoRR abs/2108.13482 (2021) - [i13]Oliver Schweiger, Klaus-Tycho Foerster, Stefan Schmid:
Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths). CoRR abs/2111.14123 (2021) - [i12]Apoorv Shukla, Klaus-Tycho Foerster:
Shortcutting Fast Failover Routes in the Data Plane. CoRR abs/2111.14579 (2021) - 2020
- [j18]Saeed Akhoondian Amiri
Walking Through Waypoints. Algorithmica 82(7): 1784-1812 (2020) - [j17]Thomas Fenz
Efficient non-segregated routing for reconfigurable demand-aware networks. Comput. Commun. 164: 138-147 (2020) - [j16]Long Luo
Deadline-Aware Multicast Transfers in Software-Defined Optical Wide-Area Networks. IEEE J. Sel. Areas Commun. 38(7): 1584-1599 (2020) - [j15]Long Luo, Hongfang Yu, Klaus-Tycho Foerster
Inter-Datacenter Bulk Transfers: Trends and Challenges. IEEE Netw. 34(5): 240-246 (2020) - [j14]Wenkai Dai
Load-Optimization in Reconfigurable Networks: Algorithms and Complexity of Flow Routing. SIGMETRICS Perform. Evaluation Rev. 48(3): 39-44 (2020) - [j13]Sebastian Brandt
Wireless evacuation on m rays with k searchers. Theor. Comput. Sci. 811: 56-69 (2020) - [j12]Sebastian Brandt
Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs. Theor. Comput. Sci. 839: 176-185 (2020) - [j11]Elif Bozkaya
AirNet: Energy-Aware Deployment and Scheduling of Aerial Networks. IEEE Trans. Veh. Technol. 69(10): 12252-12263 (2020) - [c53]Debasish Pattanayak
Conic Formation in Presence of Faulty Robots. ALGOSENSORS 2020: 170-185 - [c52]Utz Nisslmueller, Klaus-Tycho Foerster, Stefan Schmid
Inferring Sensitive Information in Cryptocurrency Off-Chain Networks Using Probing and Timing Attacks. ICISSP (Revised Selected Papers) 2020: 1-21 - [c51]Utz Nisslmueller, Klaus-Tycho Foerster, Stefan Schmid
Toward Active and Passive Confidentiality Attacks on Cryptocurrency Off-chain Networks. ICISSP 2020: 7-14 - [c50]Long Luo, Klaus-Tycho Foerster, Stefan Schmid
SplitCast: Optimizing Multicast Flows in Reconfigurable Datacenter Networks. INFOCOM 2020: 2559-2568 - [c49]Mahmoud Parham
Maximally Resilient Replacement Paths for a Family of Product Graphs. OPODIS 2020: 26:1-26:16 - [c48]Klaus-Tycho Foerster
OptFlow: A Flow-based Abstraction for Programmable Topologies. SOSR 2020: 96-102 - [c47]Klaus-Tycho Foerster
Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally. DISC 2020: 46:1-46:3 - [i11]Utz Nisslmueller, Klaus-Tycho Foerster, Stefan Schmid, Christian Decker:
Toward Active and Passive Confidentiality Attacks On Cryptocurrency Off-Chain Networks. CoRR abs/2003.00003 (2020) - [i10]Debasish Pattanayak, Klaus-Tycho Foerster, Partha Sarathi Mandal, Stefan Schmid:
Distributed Pattern Formation With Faulty Robots. CoRR abs/2003.01914 (2020) - [i9]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid:
Input-dynamic distributed graph algorithms for congested networks. CoRR abs/2005.07637 (2020) - [i8]Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
On the Feasibility of Perfect Resilience with Local Fast Failover. CoRR abs/2006.06513 (2020)
2010 – 2019
- 2019
- [j10]Klaus-Tycho Foerster
On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures. Comput. Commun. Rev. 49(2): 2-8 (2019) - [j9]Klaus-Tycho Foerster
Survey of Consistent Software-Defined Network Updates. IEEE Commun. Surv. Tutorials 21(2): 1435-1461 (2019) - [j8]Jiaqi Zheng, Bo Li, Chen Tian
Congestion-Free Rerouting of Multiple Flows in Timed SDNs. IEEE J. Sel. Areas Commun. 37(5): 968-981 (2019) - [j7]Klaus-Tycho Foerster, Stefan Schmid:
Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity. SIGACT News 50(2): 62-79 (2019) - [c46]Klaus-Tycho Foerster
Bonsai: Efficient Fast Failover Routing Using Small Arborescences. DSN 2019: 276-288 - [c45]Klaus-Tycho Foerster
CASA: Congestion and Stretch Aware Static Fast Rerouting. INFOCOM 2019: 469-477 - [c44]Klaus-Tycho Foerster
On the Power of Preprocessing in Decentralized Network Optimization. INFOCOM 2019: 1450-1458 - [c43]Long Luo, Klaus-Tycho Foerster
DaRTree: deadline-aware multicast transfers in reconfigurable wide-area networks. IWQoS 2019: 28:1-28:10 - [c42]Klaus-Tycho Foerster
Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees. NCA 2019: 1-4 - [c41]Thomas Fenz
Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks. Networking 2019: 1-9 - [c40]Klaus-Tycho Foerster
Latency and Consistent Flow Migration: Relax for Lossless Updates. Networking 2019: 1-9 - [c39]Klaus-Tycho Foerster
Does Preprocessing Help under Congestion? PODC 2019: 259-261 - [c38]Klaus-Tycho Foerster:
Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network Updates. PODC 2019: 547-548 - [c37]Klaus-Tycho Foerster
Improved Fast Rerouting Using Postprocessing. SRDS 2019: 173-182 - [i7]Sebastian Brandt, Klaus-Tycho Foerster, Jonathan Maurer, Roger Wattenhofer:
Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs. CoRR abs/1903.00581 (2019) - [i6]Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid:
Brief Announcement: Does Preprocessing Help under Congestion? CoRR abs/1905.03012 (2019) - [i5]Klaus-Tycho Foerster, Stefan Schmid:
Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees. CoRR abs/1908.10086 (2019) - 2018
- [j6]Klaus-Tycho Foerster
Local Fast Failover Routing With Low Stretch. Comput. Commun. Rev. 48(1): 35-41 (2018) - [j5]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid
Charting the Algorithmic Complexity of Waypoint Routing. Comput. Commun. Rev. 48(1): 42-48 (2018) - [j4]Klaus-Tycho Foerster
Local checkability, no strings attached: (A)cyclicity, reachability, loop free updates in SDNs. Theor. Comput. Sci. 709: 48-63 (2018) - [j3]Klaus-Tycho Foerster
Loop-Free Route Updates for Software-Defined Networks. IEEE/ACM Trans. Netw. 26(1): 328-341 (2018) - [c36]Klaus-Tycho Foerster
Characterizing the algorithmic complexity of reconfigurable data center architectures. ANCS 2018: 89-96 - [c35]Rachee Singh, Manya Ghobadi, Klaus-Tycho Foerster, Mark Filer, Phillipa Gill:
Beyond Binary Failures in Networks. ANRW 2018: 8 - [c34]Emmy-Charlotte Förster, Klaus-Tycho Förster, Thomas Löwe:
Teaching programming skills in primary school mathematics classes: An evaluation using game programming. EDUCON 2018: 1504-1513 - [c33]Jiaqi Zheng, Bo Li, Chen Tian, Klaus-Tycho Foerster
Scheduling Congestion-Free Updates of Multiple Flows with Chronicle in Timed SDNs. ICDCS 2018: 12-21 - [c32]Klaus-Tycho Foerster
TI-MFA: Keep calm and reroute segments fast. INFOCOM Workshops 2018: 415-420 - [c31]Saeed Akhoondian Amiri
Walking Through Waypoints. LATIN 2018: 37-51 - [c30]Klaus-Tycho Foerster
On the Consistent Migration of Splittable Flows: Latency-Awareness and Complexities. NCA 2018: 1-4 - [c29]Saeed Akhoondian Amiri, Klaus-Tycho Foerster
Waypoint Routing in Special Networks. Networking 2018: 496-504 - [c28]Klaus-Tycho Foerster
Local Fast Segment Rerouting on Hypercubes. OPODIS 2018: 13:1-13:17 - [c27]Rachee Singh, Manya Ghobadi, Klaus-Tycho Foerster
RADWAN: rate adaptive wide area network. SIGCOMM 2018: 547-560 - [i4]Klaus-Tycho Foerster, Juho Hirvonen, Stefan Schmid, Jukka Suomela:
On the Power of Preprocessing in Decentralized Network Optimization. CoRR abs/1812.00854 (2018) - 2017
- [j2]Sebastian Brandt
Augmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs. Pervasive Mob. Comput. 36: 134-150 (2017) - [c26]Klaus-Tycho Foerster
A Walk in the Clouds: Routing Through VNFs on Bidirected Networks. ALGOCLOUD 2017: 11-26 - [c25]Pascal Bissig, Klaus-Tycho Foerster
Distributed discussion diarisation. CCNC 2017: 1032-1037 - [c24]Klaus-Tycho Foerster
Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds. CIAC 2017: 247-259 - [c23]Klaus-Tycho Foerster
Teaching spatial geometry in a virtual world: Using minecraft in mathematics in grade 5/6. EDUCON 2017: 1411-1418 - [c22]Rachee Singh, Monia Ghobadi, Klaus-Tycho Foerster
Run, Walk, Crawl: Towards Dynamic Link Capacities. HotNets 2017: 143-149 - [c21]Klaus-Tycho Foerster, Oliver Richter, Jochen Seidel, Roger Wattenhofer:
Local Checkability in Dynamic Networks. ICDCN 2017: 4 - [c20]Klaus-Tycho Foerster
On the consistent migration of unsplittable flows: Upper and lower complexity bounds. NCA 2017: 153-156 - [c19]Klaus-Tycho Förster:
Vom Flaggenalphabet zur Vorratsdatenspeicherung: Schülerinnen und Schüler als Multiplikatoren technischer Aspekte der digitalen Welt. INFOS 2017: 171-179 - [c18]Danyang Zhuo, Monia Ghobadi, Ratul Mahajan, Klaus-Tycho Förster
Understanding and Mitigating Packet Corruption in Data Center Networks. SIGCOMM 2017: 362-375 - [c17]Sebastian Brandt
Wireless Evacuation on m Rays with k Searchers. SIROCCO 2017: 140-157 - [i3]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid:
Charting the Complexity Landscape of Waypoint Routing. CoRR abs/1705.00055 (2017) - [i2]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid:
Walking Through Waypoints. CoRR abs/1708.09827 (2017) - 2016
- [b1]Klaus-Tycho Förster:
Don't disturb my Flows: Algorithms for Consistent Network Updates in Software Defined Networks. ETH Zurich, Zürich, Switzerland, 2016 - [j1]Klaus-Tycho Foerster
Lower and upper competitive bounds for online directed graph exploration. Theor. Comput. Sci. 655: 15-29 (2016) - [c16]Klaus-Tycho Förster
The Power of Two in Consistent Network Updates: Hard Loop Freedom, Easy Flow Migration. ICCCN 2016: 1-9 - [c15]Klaus-Tycho Förster
Local checkability, no strings attached. ICDCN 2016: 21:1-21:10 - [c14]Sebastian Brandt
Augmenting anycast network flows. ICDCN 2016: 24:1-24:10 - [c13]Sebastian Brandt
On consistent migration of flows in SDNs. INFOCOM 2016: 1-9 - [c12]Pascal Bissig, Jan Deriu, Klaus-Tycho Foerster
RTDS: real-time discussion statistics. MUM 2016: 267-271 - [c11]Klaus-Tycho Foerster
Reducing the latency-tail of short-lived flows: Adding forward error correction in data centers. NCA 2016: 122-125 - [c10]Klaus-Tycho Förster
Consistent updates in software defined networks: On dependencies, loop freedom, and blackholes. Networking 2016: 1-9 - [c9]Klaus-Tycho Foerster
Integrating Programming into the Mathematics Curriculum: Combining Scratch and Geometry in Grades 6 and 7. SIGITE 2016: 91-96 - [c8]Klaus-Tycho Förster
A Concept for an Introduction to Parallelization in Java: Multithreading with Programmable Robots in Minecraft. SIGITE 2016: 169 - [i1]Klaus-Tycho Foerster, Stefan Schmid, Stefano Vissicchio:
Survey of Consistent Network Updates. CoRR abs/1609.02305 (2016) - 2015
- [c7]Nick Shelly, Brendan Tschaen, Klaus-Tycho Förster
Destroying networks for fun (and profit). HotNets 2015: 6:1-6:7 - [c6]Klaus-Tycho Förster
Programming in Scratch and Mathematics: Augmenting Your Geometry Curriculum, Today! SIGITE 2015: 97 - [c5]Klaus-Tycho Förster
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond. SIROCCO 2015: 342-356 - 2014
- [c4]Klaus-Tycho Förster
SpareEye: enhancing the safety of inattentionally blind smartphone users. MUM 2014: 68-72 - [c3]Klaus-Tycho Förster
Deterministic Leader Election in Multi-hop Beeping Networks - (Extended Abstract). DISC 2014: 212-226 - 2013
- [c2]Klaus-Tycho Förster
Approximating Fault-Tolerant Domination in General Graphs. ANALCO 2013: 25-32 - 2012
- [c1]Klaus-Tycho Förster
Directed Graph Exploration. OPODIS 2012: 151-165
Coauthor Index
[c76] [i19] [j27] [j26] [c72] [c70] [j25] [j24] [j23] [j22] [c69] [c68] [c67] [c66] [i17] [i16] [i15] [j21] [j20] [j19] [c65] [c63] [c62] [c60] [c58] [c57] [c56] [c54] [i13] [j18] [j17] [j16] [j15] [j14] [j11] [c53] [c52] [c51] [c50] [c49] [c47] [i11] [i10] [i9] [i8] [j10] [j9] [j8] [j7] [c46] [c45] [c44] [c43] [c42] [c41] [c39] [c37] [i6] [i5] [j6] [j5] [j3] [c36] [c33] [c32] [c31] [c29] [c28] [i4] [c26] [i3] [i2] [i1]
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-21 21:32 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: