default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomasz Jurdzinski
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
- 2025
[c56]Tomasz Jurdzinski, Dariusz R. Kowalski:
Searching for and Avoiding Hidden Sets Using Queries with Local Feedback. AAAI 2025: 27036-27044- 2024
- [j31]Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139: 103476 (2024) - [c55]Adam Ganczorz
, Leszek Gasieniec, Tomasz Jurdzinski, Jakub Kowalski, Grzegorz Stachowiak:
Selective Population Protocols. SSS 2024: 225-239 - [i17]Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc:
Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks. CoRR abs/2410.07382 (2024) - 2023
- [j30]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic size discovery and topology recognition in radio networks with short labels. Inf. Comput. 292: 105010 (2023) - [j29]Klaus-Tycho Foerster, Tomasz Jurdzinski, Stefan Schmid:
Guest editorial: Structural Information and Communication Complexity 2021. Theor. Comput. Sci. 971: 113913 (2023) - [i16]Adam Ganczorz, Leszek Gasieniec, Tomasz Jurdzinski, Grzegorz Stachowiak:
Selective Population Protocols. CoRR abs/2305.08460 (2023) - 2022
- [j28]Vicent Cholvi, Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Stable routing scheduling algorithms in multi-hop wireless networks. Theor. Comput. Sci. 921: 20-35 (2022) - 2021
- [j27]Gianluca De Marco, Tomasz Jurdzinski, Dariusz R. Kowalski:
Optimal channel utilization with limited feedback. J. Comput. Syst. Sci. 119: 21-33 (2021) - [c54]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. SPAA 2021: 432-434 - [c53]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. DISC 2021: 22:1-22:20 - [e4]Tomasz Jurdzinski, Stefan Schmid:
Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings. Lecture Notes in Computer Science 12810, Springer 2021, ISBN 978-3-030-79526-9 [contents] - [e3]Tomás Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. H. Wong:
SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings. Lecture Notes in Computer Science 12607, Springer 2021, ISBN 978-3-030-67730-5 [contents] - [i15]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. CoRR abs/2105.10595 (2021) - 2020
- [j26]Gianluca De Marco, Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
Subquadratic non-adaptive threshold group testing. J. Comput. Syst. Sci. 111: 42-56 (2020) - [j25]Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
Token traversal in ad hoc wireless networks via implicit carrier sensing. Theor. Comput. Sci. 811: 3-20 (2020) - [c52]Vicent Cholvi, Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks. SIROCCO 2020: 165-182 - [c51]Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Efficient Local Medium Access. SPAA 2020: 247-257
2010 – 2019
- 2019
- [j24]Leszek Gasieniec, Tomasz Jurdzinski, Russell Martin, Grzegorz Stachowiak:
Communication and location discovery in geometric ring networks. Inf. Comput. 266: 19-48 (2019) - [j23]Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys:
Online packet scheduling under adversarial errors. Theor. Comput. Sci. 795: 492-509 (2019) - [c50]Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak:
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. CIAC 2019: 174-186 - [c49]Gianluca De Marco, Tomasz Jurdzinski, Dariusz R. Kowalski:
Optimal Channel Utilization with Limited Feedback. FCT 2019: 140-152 - [c48]Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Miguel A. Mosteiro:
mmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals. IPDPS 2019: 708-717 - [c47]Bogdan S. Chlebus, Elijah Hradovich, Tomasz Jurdzinski, Marek Klonowski, Dariusz R. Kowalski:
Energy Efficient Adversarial Routing in Shared Channels. SPAA 2019: 191-200 - [c46]Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Stable Memoryless Queuing under Contention. DISC 2019: 17:1-17:16 - [i14]Vicent Cholvi, Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Packet-oblivious stable routing in multi-hop wireless networks. CoRR abs/1909.12379 (2019) - 2018
- [j22]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) - [c45]Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
Deterministic Digital Clustering of Wireless Ad Hoc Networks. PODC 2018: 105-114 - [c44]Tomasz Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki:
Communication Complexity in Vertex Partition Whiteboard Model. SIROCCO 2018: 264-279 - [c43]Tomasz Jurdzinski, Krzysztof Nowicki:
Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique. SIROCCO 2018: 331-344 - [c42]Tomasz Jurdzinski, Krzysztof Nowicki:
MST in O(1) Rounds of Congested Clique. SODA 2018: 2620-2632 - [c41]Tomasz Jurdzinski, Krzysztof Nowicki:
On Range and Edge Capacity in the Congested Clique. SOFSEM 2018: 305-318 - [c40]Huda Chuangpishit, Jurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou, Tomasz Jurdzinski, Evangelos Kranakis:
Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits. SOFSEM 2018: 367-380 - [c39]Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Local Queuing Under Contention. DISC 2018: 28:1-28:18 - [i13]Bogdan S. Chlebus, Vicent Cholvi, Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Routing in Wireless Networks with Interferences. CoRR abs/1808.02144 (2018) - [i12]Bogdan S. Chlebus, Elijah Hradovich, Tomasz Jurdzinski, Marek Klonowski, Dariusz R. Kowalski:
Energy Efficient Adversarial Routing in Shared Channels. CoRR abs/1810.11441 (2018) - 2017
- [j21]Bogdan S. Chlebus, Vicent Cholvi, Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Routing in Wireless Networks With Interferences. IEEE Commun. Lett. 21(9): 2105-2108 (2017) - [c38]Gianluca De Marco, Tomasz Jurdzinski, Michal Rózanski, Grzegorz Stachowiak:
Subquadratic Non-adaptive Threshold Group Testing. FCT 2017: 177-189 - [c37]Tomasz Jurdzinski, Michal Rózanski:
Deterministic Oblivious Local Broadcast in the SINR Model. FCT 2017: 312-325 - [c36]Pawel Garncarek, Tomasz Jurdzinski, Krzysztof Lorys:
Fault-Tolerant Online Packet Scheduling on Parallel Channels. IPDPS 2017: 347-356 - [c35]Tomasz Jurdzinski, Michal Rózanski, Grzegorz Stachowiak:
Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier Sensing. SIROCCO 2017: 15-33 - [c34]Tomasz Jurdzinski, Krzysztof Nowicki:
Brief Announcement: On Connectivity in the Broadcast Congested Clique. DISC 2017: 54:1-54:4 - [e2]Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, Yanyong Zhang:
Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10718, Springer 2017, ISBN 978-3-319-72750-9 [contents] - [i11]Tomasz Jurdzinski, Krzysztof Nowicki:
MSF and Connectivity in Limited Variants of the Congested Clique. CoRR abs/1703.02743 (2017) - [i10]Tomasz Jurdzinski, Krzysztof Nowicki:
MST in O(1) Rounds of the Congested Clique. CoRR abs/1707.08484 (2017) - [i9]Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
Deterministic Digital Clustering of Wireless Ad Hoc Networks. CoRR abs/1708.08647 (2017) - [i8]Huda Chuangpishit, Jurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou, Tomasz Jurdzinski, Evangelos Kranakis:
Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits. CoRR abs/1710.00466 (2017) - 2016
- [r2]Tomasz Jurdzinski, Dariusz R. Kowalski:
Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. Encyclopedia of Algorithms 2016: 577-580 - [r1]Tomasz Jurdzinski, Dariusz R. Kowalski:
Wake-Up Problem in Multi-Hop Radio Networks. Encyclopedia of Algorithms 2016: 2352-2354 - 2015
- [c33]Leszek Gasieniec, Tomasz Jurdzinski, Russell Martin, Grzegorz Stachowiak:
Deterministic Symmetry Breaking in Ring Networks. ICDCS 2015: 517-526 - [c32]Marcin Bienkowski, Jaroslaw Byrka, Krzysztof Chrobak, Tomasz Jurdzinski, Dariusz R. Kowalski:
Provable fairness for TDMA scheduling. INFOCOM 2015: 1320-1327 - [c31]Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
On setting-up asynchronous ad hoc wireless networks. INFOCOM 2015: 2191-2199 - [c30]Tomasz Jurdzinski, Grzegorz Stachowiak:
The Cost of Synchronizing Multiple-Access Channels. PODC 2015: 421-430 - [i7]Leszek Gasieniec, Tomasz Jurdzinski, Russell Martin, Grzegorz Stachowiak:
Deterministic Symmetry Breaking in Ring Networks. CoRR abs/1504.07127 (2015) - 2014
- [c29]Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
On the impact of geometry on ad hoc communication in wireless networks. PODC 2014: 357-366 - [c28]Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys:
Online Packet Scheduling Under Adversarial Jamming. WAOA 2014: 193-206 - [i6]Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
On the Impact of Geometry on Ad Hoc Communication in Wireless Networks. CoRR abs/1406.2852 (2014) - 2013
- [c27]Tomasz Jurdzinski, Dariusz R. Kowalski, Grzegorz Stachowiak:
Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks. FCT 2013: 195-209 - [c26]Tomasz Jurdzinski, Dariusz R. Kowalski, Grzegorz Stachowiak:
Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices. ICALP (2) 2013: 632-644 - [c25]Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. DISC 2013: 373-387 - [i5]Tomasz Jurdzinski, Dariusz R. Kowalski, Grzegorz Stachowiak:
Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks. CoRR abs/1302.4059 (2013) - [i4]Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys:
Online Packet Scheduling under Adversarial Jamming. CoRR abs/1310.4935 (2013) - 2012
- [c24]Tomasz Jurdzinski, Dariusz R. Kowalski:
On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks. OPODIS 2012: 209-223 - [c23]Tomasz Jurdzinski, Dariusz R. Kowalski:
Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks. DISC 2012: 106-120 - [c22]Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Distributed Online and Stochastic Queuing on a Multiple Access Channel. DISC 2012: 121-135 - [i3]Tomasz Jurdzinski, Dariusz R. Kowalski:
Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks. CoRR abs/1207.0602 (2012) - [i2]Tomasz Jurdzinski, Dariusz R. Kowalski, Tomasz Maciejewski, Grzegorz Stachowiak:
Distributed Broadcasting in Wireless Networks under the SINR Model. CoRR abs/1207.6732 (2012) - [i1]Tomasz Jurdzinski, Dariusz R. Kowalski, Grzegorz Stachowiak:
Distributed Deterministic Broadcasting in Wireless Networks under the SINR Model. CoRR abs/1210.1804 (2012) - 2011
- [j20]Tomasz Jurdzinski:
Growing Grammars and Length-reducing Automata. Fundam. Informaticae 112(2-3): 193-217 (2011) - [j19]Artur Jez, Tomasz Jurdzinski:
Length-reducing Automata (almost) without Auxiliary Symbols. J. Autom. Lang. Comb. 16(2-4): 141-164 (2011) - 2010
- [c21]Tomasz Jurdzinski:
Growing Grammars and Length-Reducing Automata. NCMA 2010: 9-10
2000 – 2009
- 2009
- [j18]Tomasz Jurdzinski:
Probabilistic Length-Reducing Two-Pushdown Automata. Theory Comput. Syst. 45(1): 74-107 (2009) - 2008
- [j17]Tomasz Jurdzinski:
The Boolean Closure of Growing Context-Sensitive Languages. Fundam. Informaticae 89(2-3): 289-305 (2008) - [j16]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On the Complexity of 2-Monotone Restarting Automata. Theory Comput. Syst. 42(4): 488-518 (2008) - [c20]Tomasz Jurdzinski:
Leftist Grammars Are Non-primitive Recursive. ICALP (2) 2008: 51-62 - 2007
- [j15]Tomasz Jurdzinski, Krzysztof Lorys:
Lower bound technique for length-reducing automata. Inf. Comput. 205(9): 1387-1412 (2007) - [j14]Tomasz Jurdzinski, Friedrich Otto:
Shrinking Restarting Automata. Int. J. Found. Comput. Sci. 18(2): 361-385 (2007) - [j13]Frantisek Mráz, Martin Plátek, Tomasz Jurdzinski:
Ambiguity by Restarting Automata. Int. J. Found. Comput. Sci. 18(6): 1343-1352 (2007) - [j12]Tomasz Jurdzinski, Friedrich Otto:
Sequential monotonicity for restarting automata. RAIRO Theor. Informatics Appl. 41(2): 157-175 (2007) - [j11]Tomasz Jurdzinski, Krzysztof Lorys:
Leftist Grammars and the Chomsky Hierarchy. Theory Comput. Syst. 41(2): 233-256 (2007) - [j10]Tomasz Jurdzinski:
On complexity of grammars related to the safety problem. Theor. Comput. Sci. 389(1-2): 56-72 (2007) - [e1]Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki:
Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings. Lecture Notes in Computer Science 4596, Springer 2007, ISBN 978-3-540-73419-2 [contents] - 2006
- [j9]Tomasz Jurdzinski, Friedrich Otto:
Restarting automata with restricted utilization of auxiliary symbols. Theor. Comput. Sci. 363(2): 162-181 (2006) - [j8]Frantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski:
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. Theor. Comput. Sci. 366(3): 272-296 (2006) - [j7]Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Degrees of non-monotonicity for restarting automata. Theor. Comput. Sci. 369(1-3): 1-34 (2006) - [c19]Tomasz Jurdzinski:
The Boolean Closure of Growing Context-Sensitive Languages. Developments in Language Theory 2006: 248-259 - [c18]Tomasz Jurdzinski:
On Complexity of Grammars Related to the Safety Problem. ICALP (2) 2006: 432-443 - [c17]Tomasz Jurdzinski:
Probabilistic Length-Reducing Automata. MFCS 2006: 561-572 - 2005
- [j6]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. Fundam. Informaticae 64(1-4): 217-228 (2005) - [j5]Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
Efficient simulation of synchronous systems by multi-speed systems. RAIRO Theor. Informatics Appl. 39(2): 403-419 (2005) - [j4]Tomasz Jurdzinski, Grzegorz Stachowiak:
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks. Theory Comput. Syst. 38(3): 347-367 (2005) - [c16]Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. Developments in Language Theory 2005: 284-295 - [c15]Tomasz Jurdzinski, Krzysztof Lorys:
Leftist Grammars and the Chomsky Hierarchy. FCT 2005: 293-304 - [c14]Tomasz Jurdzinski, Friedrich Otto:
Shrinking Restarting Automata. MFCS 2005: 532-543 - [c13]Tomasz Jurdzinski, Friedrich Otto:
Restricting the Use of Auxiliary Symbols for Restarting Automata. CIAA 2005: 176-187 - 2004
- [j3]Tomasz Jurdzinski, Krzysztof Lorys, Gundula Niemann, Friedrich Otto:
Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages. J. Autom. Lang. Comb. 9(4): 407-437 (2004) - [c12]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On the Complexity of 2-Monotone Restarting Automata. Developments in Language Theory 2004: 237-248 - [c11]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On Left-Monotone Deterministic Restarting Automata. Developments in Language Theory 2004: 249-260 - 2003
- [j2]Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
Weak communication in single-hop radio networks: adjusting algorithms to industrial standards. Concurr. Comput. Pract. Exp. 15(11-12): 1117-1131 (2003) - [j1]Andreas Goerdt, Tomasz Jurdzinski:
Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. Comb. Probab. Comput. 12(3): 245-267 (2003) - 2002
- [c10]Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection. COCOON 2002: 279-289 - [c9]Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
Weak Communication in Radio Networks. Euro-Par 2002: 965-972 - [c8]Tomasz Jurdzinski, Krzysztof Lorys:
Church-Rosser Languages vs. UCFL. ICALP 2002: 147-158 - [c7]Tomasz Jurdzinski, Grzegorz Stachowiak:
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. ISAAC 2002: 535-549 - [c6]Andreas Goerdt, Tomasz Jurdzinski:
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. MFCS 2002: 280-291 - [c5]Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
Efficient algorithms for leader election in radio networks. PODC 2002: 51-57 - 2001
- [c4]Tomasz Jurdzinski, Miroslaw Kutylowski:
Communication Gap for Finite Memory Devices. ICALP 2001: 1052-1064 - [c3]Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
Communication Complexity for Asynchronous Systems of Finite Devices. IPDPS 2001: 139
1990 – 1999
- 1999
- [c2]Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys:
Multi-party Finite Computations. COCOON 1999: 318-329 - 1998
- [c1]Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys:
Power of Cooperation and Multihead Finite Systems. ICALP 1998: 896-907
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 2025-04-20 23:53 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:
