default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuciano Gualà
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j25]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. 141: 103495 (2024)- 2023
- [j24]Luciano Gualà, Stefano Leucci
, Isabella Ziccardi:
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. Algorithmica 85(6): 1624-1651 (2023) - 2022
- [j23]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 84(1): 37-59 (2022) - [j22]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting bamboo down to size. Theor. Comput. Sci. 909: 54-67 (2022) - [j21]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. 932: 102-115 (2022) - 2021
- [j20]Davide Bilò, Luciano Gualà, Guido Proietti:
Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. Algorithms 14(1): 8 (2021) - [j19]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Network Creation Games with Traceroute-Based Strategies. Algorithms 14(2): 35 (2021) - 2020
- [j18]Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Algorithmica 82(2): 279-299 (2020) - [j17]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Tracking routes in communication networks. Theor. Comput. Sci. 844: 1-15 (2020) - 2018
- [j16]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 80(12): 3437-3460 (2018) - 2016
- [j15]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. 652: 86-101 (2016) - [j14]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-Based Network Creation Games. ACM Trans. Parallel Comput. 3(1): 6:1-6:26 (2016) - 2015
- [j13]Davide Bilò, Luciano Gualà, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica 73(3): 547-570 (2015) - [j12]Miriam Di Ianni, Luciano Gualà, Gianluca Rossi:
Reducing the diameter of a unit disk graph via node addition. Inf. Process. Lett. 115(11): 845-850 (2015) - [j11]Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti:
Network verification via routing table queries. J. Comput. Syst. Sci. 81(1): 234-248 (2015) - [j10]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. 562: 643-657 (2015) - [j9]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The max-distance network creation game on general host graphs. Theor. Comput. Sci. 573: 43-53 (2015) - [j8]Davide Bilò, Luciano Gualà, Guido Proietti:
Bounded-Distance Network Creation Games. ACM Trans. Economics and Comput. 3(3): 16:1-16:20 (2015) - 2014
- [j7]Davide Bilò, Luciano Gualà, Guido Proietti:
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica 68(2): 337-357 (2014) - 2012
- [j6]Patrick Briest, Luciano Gualà, Martin Hoefer, Carmine Ventre:
On stackelberg pricing with computationally bounded customers. Networks 60(1): 31-44 (2012) - [j5]Davide Bilò, Luciano Gualà, Guido Proietti:
Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417: 12-22 (2012) - 2009
- [j4]Davide Bilò, Luciano Gualà, Guido Proietti:
Dynamic mechanism design. Theor. Comput. Sci. 410(17): 1564-1572 (2009) - 2008
- [j3]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. Internet Math. 5(4): 411-437 (2008) - 2007
- [j2]Luciano Gualà, Guido Proietti:
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. Algorithmica 49(3): 171-191 (2007) - [j1]Luciano Gualà, Guido Proietti:
Efficient truthful mechanisms for the single-source shortest paths tree problem. Concurr. Comput. Pract. Exp. 19(17): 2285-2297 (2007)
Conference and Workshop Papers
- 2024
- [c50]Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota:
Graph Spanners for Group Steiner Distances. ESA 2024: 25:1-25:17 - [c49]Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci:
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. FUN 2024: 4:1-4:19 - [c48]Davide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci:
Swapping Mixed-Up Beers to Keep Them Cool. FUN 2024: 5:1-5:18 - 2023
- [c47]Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria:
Finding Diameter-Reducing Shortcuts in Trees. WADS 2023: 164-178 - 2022
- [c46]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Blackout-Tolerant Temporal Spanners. ALGOSENSORS 2022: 31-44 - [c45]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. ESA 2022: 19:1-19:16 - [c44]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS 2022: 12:1-12:21 - 2021
- [c43]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting Bamboo down to Size. FUN 2021: 5:1-5:18 - [c42]Luciano Gualà, Stefano Leucci, Isabella Ziccardi:
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. ISAAC 2021: 66:1-66:17 - [c41]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO 2021: 167-184 - 2020
- [c40]Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan:
Consensus vs Broadcast, with and Without Noise (Extended Abstract). ITCS 2020: 42:1-42:13 - 2019
- [c39]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Tracking Routes in Communication Networks. SIROCCO 2019: 81-93 - [c38]Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco:
Coalition Resilient Outcomes in Max k-Cut Games. SOFSEM 2019: 94-107 - 2018
- [c37]Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra:
On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN 2018: 7:1-7:15 - [c36]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN 2018: 8:1-8:15 - [c35]Andrea Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca:
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. MFCS 2018: 28:1-28:15 - [c34]Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti:
Efficient Oracles and Routing Schemes for Replacement Paths. STACS 2018: 13:1-13:15 - 2017
- [c33]Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca:
Rational Fair Consensus in the Gossip Model. IPDPS 2017: 163-171 - [c32]Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. ISAAC 2017: 14:1-14:13 - [c31]Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. SIROCCO 2017: 303-317 - [c30]Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca:
Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. DISC 2017: 47:1-47:4 - 2016
- [c29]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA 2016: 13:1-13:14 - [c28]Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso:
Large Peg-Army Maneuvers. FUN 2016: 18:1-18:15 - [c27]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS 2016: 18:1-18:14 - 2015
- [c26]Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. ESA 2015: 167-178 - [c25]Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Tree Spanner. SIROCCO 2015: 239-253 - 2014
- [c24]Luciano Gualà, Stefano Leucci, Emanuele Natale:
Bejeweled, Candy Crush and other match-three games are (NP-)hard. CIG 2014: 1-8 - [c23]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. ESA 2014: 137-148 - [c22]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Network Creation Games with Traceroute-Based Strategies. SIROCCO 2014: 210-223 - [c21]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based network creation games. SPAA 2014: 277-286 - 2013
- [c20]Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer:
Polygon-Constrained Motion Planning Problems. ALGOSENSORS 2013: 67-82 - [c19]Davide Bilò, Luciano Gualà, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. ESA 2013: 157-168 - [c18]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO 2013: 322-333 - 2012
- [c17]Davide Bilò, Luciano Gualà, Guido Proietti:
Bounded-Distance Network Creation Games. WINE 2012: 72-85 - [c16]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The Max-Distance Network Creation Game on General Host Graphs. WINE 2012: 392-405 - 2011
- [c15]Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti:
Network Verification via Routing Table Queries. SIROCCO 2011: 270-281 - 2010
- [c14]Davide Bilò, Luciano Gualà, Guido Proietti:
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS 2010: 138-149 - [c13]Davide Bilò, Luciano Gualà, Guido Proietti:
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS 2010: 150-161 - [c12]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE 2010: 75-86 - 2009
- [c11]Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer:
Stability of Networks in Stretchable Graphs. SIROCCO 2009: 100-112 - [c10]Patrick Briest, Martin Hoefer, Luciano Gualà, Carmine Ventre:
On Stackelberg Pricing with Computationally Bounded Consumers. WINE 2009: 42-54 - 2008
- [c9]Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer:
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262 - 2007
- [c8]Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer:
Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC 2007: 587-598 - [c7]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
An algorithm composition scheme preserving monotonicity. PODC 2007: 360-361 - [c6]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE 2007: 503-514 - 2006
- [c5]Davide Bilò, Luciano Gualà, Guido Proietti:
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN 2006: 19-30 - [c4]Davide Bilò, Luciano Gualà, Guido Proietti:
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO 2006: 295-309 - [c3]Davide Bilò, Luciano Gualà, Guido Proietti:
Dynamic Mechanism Design. WINE 2006: 3-15 - 2005
- [c2]Luciano Gualà, Guido Proietti:
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. COCOON 2005: 390-400 - [c1]Luciano Gualà, Guido Proietti:
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. Euro-Par 2005: 941-951
Informal and Other Publications
- 2024
- [i26]Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota:
Graph Spanners for Group Steiner Distances. CoRR abs/2407.01431 (2024) - [i25]Andrea Clementi, Luciano Gualà, Luca Pepè Sciarria, Alessandro Straziota:
Maintaining k-MinHash Signatures over Fully-Dynamic Data Streams with Recovery. CoRR abs/2407.21614 (2024) - [i24]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota:
Temporal queries for dynamic temporal forests. CoRR abs/2409.18750 (2024) - 2023
- [i23]Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria:
Finding Diameter-Reducing Shortcuts in Trees. CoRR abs/2305.17385 (2023) - 2022
- [i22]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. CoRR abs/2206.11113 (2022) - 2021
- [i21]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR abs/2106.12293 (2021) - [i20]Luciano Gualà, Stefano Leucci, Isabella Ziccardi:
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. CoRR abs/2109.09588 (2021) - 2020
- [i19]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting Bamboo Down to Size. CoRR abs/2005.00168 (2020) - 2018
- [i18]Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan:
Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise. CoRR abs/1807.05626 (2018) - [i17]Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco:
Coalition Resilient Outcomes in Max k-Cut Games. CoRR abs/1810.09278 (2018) - 2017
- [i16]Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca:
Rational Fair Consensus in the GOSSIP Model. CoRR abs/1705.09566 (2017) - [i15]Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca:
On the Parallel Undecided-State Dynamics with Two Colors. CoRR abs/1707.05135 (2017) - [i14]Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR abs/1707.08861 (2017) - [i13]Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. CoRR abs/1710.01516 (2017) - 2016
- [i12]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1601.04169 (2016) - [i11]Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso:
Large Peg-Army Maneuvers. CoRR abs/1603.00898 (2016) - [i10]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based Network Creation Games. CoRR abs/1607.06765 (2016) - [i9]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR abs/1608.04769 (2016) - 2015
- [i8]Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. CoRR abs/1507.00505 (2015) - 2014
- [i7]Luciano Gualà, Stefano Leucci, Emanuele Natale:
Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard. CoRR abs/1403.5830 (2014) - [i6]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR abs/1407.0628 (2014) - [i5]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1407.0637 (2014) - [i4]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The Max-Distance Network Creation Game on General Host Graphs. CoRR abs/1407.0643 (2014) - [i3]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR abs/1407.1167 (2014) - 2011
- [i2]Davide Bilò, Luciano Gualà, Guido Proietti:
Bounded-Distance Network Creation Games. CoRR abs/1112.4264 (2011) - 2009
- [i1]Davide Bilò, Luciano Gualà, Guido Proietti:
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game. Electron. Colloquium Comput. Complex. TR09 (2009)
Coauthor Index
[j25] [j23] [j22] [j21] [j20] [j19] [j18] [j17] [j16] [j15] [j14] [j13] [j11] [j10] [j9] [j8] [j7] [j5] [j4] [j3] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [c41] [c39] [c37] [c36] [c34] [c32] [c31] [c29] [c27] [c26] [c25] [c23] [c22] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [c13] [c12] [c11] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [i26] [i24] [i23] [i22] [i21] [i19] [i14] [i13] [i12] [i10] [i9] [i8] [i6] [i5] [i4] [i3] [i2] [i1]
[j25] [j24] [j23] [j22] [j21] [j19] [j18] [j17] [j16] [j15] [j14] [j10] [j9] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c41] [c39] [c37] [c36] [c34] [c32] [c31] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c18] [c16] [c12] [i26] [i24] [i23] [i22] [i21] [i20] [i19] [i14] [i13] [i12] [i11] [i10] [i9] [i8] [i7] [i6] [i5] [i4] [i3]
[j23] [j22] [j21] [j20] [j19] [j18] [j17] [j16] [j15] [j14] [j13] [j11] [j10] [j9] [j8] [j7] [j5] [j4] [j3] [j2] [j1] [c44] [c43] [c41] [c39] [c36] [c34] [c33] [c32] [c31] [c29] [c27] [c26] [c25] [c23] [c22] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [c13] [c12] [c11] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1] [i24] [i21] [i19] [i16] [i14] [i13] [i12] [i10] [i9] [i8] [i6] [i5] [i4] [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-10-18 19: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:
