default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Bienkowski
Person information
- affiliation: University of Wroclaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c56]Julien Dallot, Maciej Pacut, Marcin Bienkowski, Darya Melnyk, Stefan Schmid:
Learning Minimum Linear Arrangement of Cliques and Lines. ICDCS 2024: 175-185- [c55]Spyros Angelopoulos, Marcin Bienkowski, Christoph Dürr, Bertrand Simon:
Contract Scheduling with Distributional and Multiple Advice. IJCAI 2024: 3652-3660 - [c54]Marcin Bienkowski, Stefan Schmid
:
A Subquadratic Bound for Online Bisection. STACS 2024: 14:1-14:18 - [c53]Marcin Bienkowski, Guy Even:
An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. STACS 2024: 15:1-15:19 - [i30]Spyros Angelopoulos, Marcin Bienkowski, Christoph Dürr, Bertrand Simon:
Contract Scheduling with Distributional and Multiple Advice. CoRR abs/2404.12485 (2024) - [i29]Marcin Bienkowski, Jaroslaw Byrka, Lukasz Jez:
Online Disjoint Set Covers: Randomization is not Necessary. CoRR abs/2404.15554 (2024) - [i28]Julien Dallot, Maciej Pacut, Marcin Bienkowski, Darya Melnyk, Stefan Schmid:
Learning Minimum Linear Arrangement of Cliques and Lines. CoRR abs/2405.15963 (2024) - 2023
- [c52]Marcin Bienkowski, Marcin Mucha:
An Improved Algorithm for Online Min-Sum Set Cover. AAAI 2023: 6815-6822 - [c51]Marcin Bienkowski, David Fuchssteiner, Stefan Schmid:
Optimizing Reconfigurable Optical Datacenters: The Power of Randomization. SC 2023: 83:1-83:11 - [c50]Mateusz Basiak, Marcin Bienkowski, Agnieszka Tatarczuk:
An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem. WAOA 2023: 45-58 - [i27]Marcin Bienkowski, Stefan Schmid:
A Subquadratic Bound for Online Bisection. CoRR abs/2305.01420 (2023) - [i26]Mateusz Basiak, Marcin Bienkowski, Agnieszka Tatarczuk:
An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem. CoRR abs/2306.17755 (2023) - 2022
- [c49]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. APPROX/RANDOM 2022: 45:1-45:17 - [c48]Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt:
Deterministic Self-Adjusting Tree Networks Using Rotor Walks. ICDCS 2022: 67-77 - [i25]Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Pawel Schmidt:
Deterministic Self-Adjusting Tree Networks Using Rotor Walks. CoRR abs/2204.10754 (2022) - [i24]Marcin Bienkowski, David Fuchssteiner, Stefan Schmid:
Online B-Matchings for Reconfigurable Datacenters: The Power of Randomization. CoRR abs/2209.01863 (2022) - [i23]Marcin Bienkowski, Marcin Mucha:
An Improved Algorithm For Online Reranking. CoRR abs/2209.04870 (2022) - 2021
- [j20]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - [c47]Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu:
Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times. ICALP 2021: 28:1-28:20 - [c46]Marcin Bienkowski, Björn Feldkord, Pawel Schmidt:
A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. STACS 2021: 14:1-14:17 - [c45]Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. WAOA 2021: 224-233 - [i22]Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu:
Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times. CoRR abs/2102.06904 (2021) - [i21]Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. CoRR abs/2107.00145 (2021) - [i20]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. CoRR abs/2110.15155 (2021) - 2020
- [j19]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020) - [j18]Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, Stefan Schmid:
Dynamic Balanced Graph Partitioning. SIAM J. Discret. Math. 34(3): 1791-1812 (2020) - [j17]Marcin Bienkowski, David Fuchssteiner, Jan Marcinkowski, Stefan Schmid:
Online Dynamic B-Matching: With Applications to Reconfigurable Datacenter Networks. SIGMETRICS Perform. Evaluation Rev. 48(3): 99-108 (2020) - [c44]Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch:
An Optimal Algorithm for Online Multiple Knapsack. ICALP 2020: 13:1-13:17 - [c43]Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. STOC 2020: 1165-1169 - [i19]Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch:
An Optimal Algorithm for Online Multiple Knapsack. CoRR abs/2002.04543 (2020) - [i18]Marcin Bienkowski, David Fuchssteiner, Jan Marcinkowski, Stefan Schmid:
A Competitive B-Matching Algorithm for Reconfigurable Datacenter Networks. CoRR abs/2006.10692 (2020) - [i17]Marcin Bienkowski, Björn Feldkord, Pawel Schmidt:
A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. CoRR abs/2007.07025 (2020)
2010 – 2019
- 2019
- [j16]Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic Beats Fixed: On Phase-based Algorithms for File Migration. ACM Trans. Algorithms 15(4): 46:1-46:21 (2019) - [c42]Marcin Bienkowski, Lukasz Jez, Pawel Schmidt:
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics. ISAAC 2019: 14:1-14:14 - [c41]Marcin Bienkowski, Hsiang-Hsuan Liu:
An Improved Online Algorithm for the Traveling Repairperson Problem on a Line. MFCS 2019: 6:1-6:12 - [c40]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. MFCS 2019: 8:1-8:13 - [i16]Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. CoRR abs/1911.01592 (2019) - 2018
- [j15]Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Distributed Online and Stochastic Queueing on a Multiple Access Channel. ACM Trans. Algorithms 14(2): 21:1-21:22 (2018) - [j14]Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý:
Logarithmic price of buffer downscaling on line metrics. Theor. Comput. Sci. 707: 89-93 (2018) - [j13]Marcin Bienkowski, Nadi Sarrar, Stefan Schmid, Steve Uhlig:
Online Aggregation of the Forwarding Information Base: Accounting for Locality and Churn. IEEE/ACM Trans. Netw. 26(1): 591-604 (2018) - [c39]Marcin Bienkowski, Artur Kraska, Pawel Schmidt:
Online Service with Delay on a Line. SIROCCO 2018: 237-248 - [c38]Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu, Pawel Schmidt:
A Primal-Dual Online Deterministic Algorithm for Matching with Delays. WAOA 2018: 51-68 - [i15]Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu, Pawel Schmidt:
A Primal-Dual Online Deterministic Algorithm for Matching with Delays. CoRR abs/1804.08097 (2018) - [i14]Marcin Bienkowski, Lukasz Jez, Pawel Schmidt:
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics. CoRR abs/1810.00580 (2018) - [i13]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. CoRR abs/1811.09233 (2018) - 2017
- [c37]Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration. ICALP 2017: 13:1-13:14 - [c36]Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra:
Online Tree Caching. SPAA 2017: 329-338 - [c35]Marcin Bienkowski, Artur Kraska, Pawel Schmidt:
A Deterministic Algorithm for Online Steiner Tree Leasing. WADS 2017: 169-180 - [c34]Marcin Bienkowski, Artur Kraska, Pawel Schmidt:
A Match in Time Saves Nine: Deterministic Online Matching with Delays. WAOA 2017: 132-146 - [i12]Marcin Bienkowski, Artur Kraska, Pawel Schmidt:
A Match in Time Saves Nine: Deterministic Online Matching With Delays. CoRR abs/1704.06980 (2017) - 2016
- [j12]Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Randomized mutual exclusion on a multiple access channel. Distributed Comput. 29(5): 341-359 (2016) - [j11]Marcin Bienkowski, Leszek Gasieniec, Marek Klonowski, Miroslaw Korzeniowski, Bernard Mans, Stefan Schmid, Roger Wattenhofer:
Distributed Alarming in the On-Duty and Off-Duty Models. IEEE/ACM Trans. Netw. 24(1): 218-230 (2016) - [c33]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. ESA 2016: 12:1-12:17 - [i11]Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra:
Online Tree Caching. CoRR abs/1602.08563 (2016) - [i10]Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic beats fixed: on phase-based algorithms for file migration. CoRR abs/1609.00831 (2016) - [i9]Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý:
Logarithmic price of buffer downscaling on line metrics. CoRR abs/1610.04915 (2016) - 2015
- [j10]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young:
Approximation algorithms for the joint replenishment problem with deadlines. J. Sched. 18(6): 545-560 (2015) - [c32]Marcin Bienkowski, Jaroslaw Byrka, Krzysztof Chrobak, Tomasz Jurdzinski, Dariusz R. Kowalski:
Provable fairness for TDMA scheduling. INFOCOM 2015: 1320-1327 - [c31]Marcin Bienkowski, Artur Kraska, Pawel Schmidt:
A Randomized Algorithm for Online Scheduling with Interval Conflicts. SIROCCO 2015: 91-103 - [i8]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. CoRR abs/1507.02378 (2015) - 2014
- [j9]Marcin Bienkowski:
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches. Algorithmica 68(2): 426-447 (2014) - [j8]Marcin Bienkowski, Anja Feldmann, Johannes Grassler, Gregor Schaffrath, Stefan Schmid:
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach. IEEE/ACM Trans. Netw. 22(1): 165-178 (2014) - [c30]Nadi Sarrar, Robert Wuttke, Stefan Schmid, Marcin Bienkowski, Steve Uhlig:
Leveraging locality for FIB aggregation. GLOBECOM 2014: 1930-1935 - [c29]Marcin Bienkowski, Nadi Sarrar, Stefan Schmid, Steve Uhlig:
Competitive FIB Aggregation without Update Churn. ICDCS 2014: 607-616 - [c28]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, Jirí Sgall:
Better Approximation Bounds for the Joint Replenishment Problem. SODA 2014: 42-54 - 2013
- [j7]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak:
Collecting Weighted Items from a Dynamic Queue. Algorithmica 65(1): 60-94 (2013) - [j6]Marcin Bienkowski, Pawel Zalewski:
(1, 2)-Hamiltonian Completion on a Matching. Int. J. Found. Comput. Sci. 24(1): 95-108 (2013) - [j5]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak:
A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue. Theor. Comput. Sci. 475: 92-102 (2013) - [c27]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young:
Approximation Algorithms for the Joint Replenishment Problem with Deadlines. ICALP (1) 2013: 135-147 - [c26]Marcin Bienkowski, Stefan Schmid:
Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie. SIROCCO 2013: 92-103 - [c25]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall, Grzegorz Stachowiak:
Online Control Message Aggregation in Chain Networks. WADS 2013: 133-145 - [i7]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall:
Better Approximation Bounds for the Joint Replenishment Problem. CoRR abs/1307.2531 (2013) - 2012
- [j4]Marcin Bienkowski:
Migrating and replicating data in networks. Comput. Sci. Res. Dev. 27(3): 169-179 (2012) - [j3]Marcin Bienkowski, Jaroslaw Kutylowski:
The k-resource problem in uniform metric spaces. Theor. Comput. Sci. 459: 42-54 (2012) - [c24]Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Distributed Online and Stochastic Queuing on a Multiple Access Channel. DISC 2012: 121-135 - [i6]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak:
Approximation Algorithms for the Joint Replenishment Problem with Deadlines. CoRR abs/1212.3233 (2012) - 2011
- [j2]Marcin Bienkowski, Marek Chrobak, Lukasz Jez:
Randomized competitive algorithms for online buffer management in the adaptive adversary model. Theor. Comput. Sci. 412(39): 5121-5131 (2011) - [c23]Dushyant Arora, Marcin Bienkowski, Anja Feldmann, Gregor Schaffrath, Stefan Schmid:
Online strategies for intra and inter provider service migration in virtual networks. IPTComm 2011: 10:1-10:11 - [c22]Marcin Bienkowski:
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches. SODA 2011: 1295-1305 - [i5]Dushyant Arora, Marcin Bienkowski, Anja Feldmann, Gregor Schaffrath, Stefan Schmid:
Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks. CoRR abs/1103.0966 (2011) - 2010
- [c21]Marcin Bienkowski, André Brinkmann, Marek Klonowski, Miroslaw Korzeniowski:
SkewCCC+: A Heterogeneous Distributed Hash Table. OPODIS 2010: 219-234 - [c20]Marcin Bienkowski, Anja Feldmann, Dan Jurca, Wolfgang Kellerer, Gregor Schaffrath, Stefan Schmid, Joerg Widmer:
Competitive analysis for service migration in VNets. VISA@SIGCOMM 2010: 17-24 - [c19]Marcin Bienkowski, Leszek Gasieniec, Marek Klonowski, Miroslaw Korzeniowski, Stefan Schmid:
Event Extent Estimation. SIROCCO 2010: 57-71 - [c18]Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Dynamic Sharing of a Multiple Access Channel. STACS 2010: 83-94 - [c17]Marcin Bienkowski, Stefan Schmid:
Online Function Tracking with Generalized Penalties. SWAT 2010: 359-370 - [i4]Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Dynamic sharing of a multiple access channel. CoRR abs/1001.3044 (2010) - [i3]Marcin Bienkowski:
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches. CoRR abs/1007.1535 (2010)
2000 – 2009
- 2009
- [j1]Marcin Bienkowski, Jaroslaw Byrka, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Optimal algorithms for page migration in dynamic networks. J. Discrete Algorithms 7(4): 545-569 (2009) - [c16]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak:
Collecting weighted items from a dynamic queue. SODA 2009: 1126-1135 - [c15]Marcin Bienkowski:
Price Fluctuations: To Buy or to Rent. WAOA 2009: 25-36 - 2008
- [c14]Marcin Bienkowski, Aleksander Madry:
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers. LATIN 2008: 252-263 - [c13]Marcin Bienkowski, André Brinkmann, Miroslaw Korzeniowski:
Degree 3 Suffices: A Large-Scale Overlay for P2P Networks. OPODIS 2008: 184-196 - [c12]Marcin Bienkowski, Marek Chrobak, Lukasz Jez:
Randomized Algorithms for Buffer Management with 2-Bounded Delay. WAOA 2008: 92-104 - [i2]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Jakub Lopuszanski, Grzegorz Stachowiak:
Generalized Whac-a-Mole. CoRR abs/0802.1685 (2008) - 2007
- [c11]Marcin Bienkowski, Jaroslaw Kutylowski:
The k -Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. WADS 2007: 337-348 - 2005
- [b1]Marcin Bienkowski:
Page migration in dynamic networks. University of Paderborn, Germany, 2005, ISBN 978-3-942647-01-4, pp. 1-167 - [c10]Marcin Bienkowski, Jaroslaw Byrka:
Bucket Game with Applications to Set Multicover and Dynamic Page Migration. ESA 2005: 815-826 - [c9]Marcin Bienkowski, Miroslaw Korzeniowski:
Dynamic Page Migration Under Brownian Motion. Euro-Par 2005: 962-971 - [c8]Marcin Bienkowski, André Brinkmann, Miroslaw Korzeniowski, Orhan Orhan:
Cube Connected Cycles Based Bluetooth Scatternet Formation. ICN (1) 2005: 413-420 - [c7]Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Dynamic Load Balancing in Distributed Hash Tables. IPTPS 2005: 217-225 - [c6]Marcin Bienkowski, Friedhelm Meyer auf der Heide:
Page Migration in Dynamic Networks. MFCS 2005: 1-14 - [c5]Marcin Bienkowski, Miroslaw Korzeniowski:
Bounding Communication Cost in Dynamic Load Balancing of Distributed Hash Tables. OPODIS 2005: 381-395 - [c4]Marcin Bienkowski:
Dynamic page migration with stochastic requests. SPAA 2005: 270-278 - [c3]Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzeniowski:
Improved Algorithms for Dynamic Page Migration. STACS 2005: 365-376 - [i1]Marcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, Christian Sohler:
Average case complexity of Voronoi diagrams of n sites from the unit cube. EuroCG 2005: 167-170 - 2004
- [c2]Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Fighting against two adversaries: page migration in dynamic networks. SPAA 2004: 64-73 - 2003
- [c1]Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke:
A practical algorithm for constructing oblivious routing schemes. SPAA 2003: 24-33
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-21 20:29 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:
