default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiovanni Viglietta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j29]Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi:
Gathering on a circle with limited visibility by anonymous oblivious robots. Theor. Comput. Sci. 1025: 114974 (2025)- 2024
- [j28]Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara
:
Computational complexity of jumping block puzzles. Theor. Comput. Sci. 983: 114292 (2024) - [c44]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Efficient Computation in Congested Anonymous Dynamic Networks. MFCS 2024: 49:1-49:19 - [c43]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks. OPODIS 2024: 10:1-10:17 - [c42]Giovanni Viglietta:
History Trees and Their Applications. SIROCCO 2024: 3-23 - [i40]Giovanni Viglietta:
History Trees and Their Applications. CoRR abs/2404.02673 (2024) - [i39]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks. CoRR abs/2409.00688 (2024) - 2023
- [j27]Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta:
Pushing Blocks by Sweeping Lines. Comput. Geom. Topol. 2(1): 6:1-6:28 (2023) - [j26]Giovanni Viglietta:
A Theory of Spherical Diagrams. Comput. Geom. Topol. 2(2): 2:1-2:24 (2023) - [j25]Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta:
Minimizing Visible Edges in Polyhedra. Graphs Comb. 39(5): 111 (2023) - [c41]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks. PODC 2023: 176-179 - [c40]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks. DISC 2023: 18:1-18:20 - [i38]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Efficient Computation in Congested Anonymous Dynamic Networks. CoRR abs/2301.07849 (2023) - [i37]Giovanni Viglietta:
Minimal Arrangements of Spherical Geodesics. CoRR abs/2311.03255 (2023) - 2022
- [j24]Javier Cano, Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta:
Edge guards for polyhedra in three-space. Comput. Geom. 104: 101859 (2022) - [j23]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications. Distributed Comput. 35(2): 105-122 (2022) - [j22]Tianfeng Feng, Leonie Ryvkin, Jérôme Urhausen, Giovanni Viglietta:
Complexity of Critter Crunch. IEICE Trans. Inf. Syst. 105-D(3): 517-531 (2022) - [j21]Kwon Kham Sai, Giovanni Viglietta, Ryuhei Uehara:
Cyclic Shift Problems on Graphs. IEICE Trans. Inf. Syst. 105-D(3): 532-540 (2022) - [j20]Tianfeng Feng, Ryuhei Uehara, Giovanni Viglietta:
Bicolored Path Embedding Problems Inspired by Protein Folding Models. IEICE Trans. Inf. Syst. 105-D(3): 623-633 (2022) - [j19]Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta:
Token shifting on graphs. Int. J. Comput. Math. Comput. Syst. Theory 7(4): 223-234 (2022) - [c39]Giovanni Viglietta:
A Theory of Spherical Diagrams. CCCG 2022: 306-313 - [c38]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Computing in Anonymous Dynamic Networks Is Linear. FOCS 2022: 1122-1133 - [c37]Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta:
Pushing Blocks by Sweeping Lines. FUN 2022: 1:1-1:21 - [i36]Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta:
Pushing Blocks by Sweeping Lines. CoRR abs/2202.12045 (2022) - [i35]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Computing in Anonymous Dynamic Networks Is Linear. CoRR abs/2204.02128 (2022) - [i34]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Leaderless and Multi-Leader Computation in Disconnected Anonymous Dynamic Networks. CoRR abs/2207.08061 (2022) - [i33]Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta:
Minimizing Visible Edges in Polyhedra. CoRR abs/2208.09702 (2022) - 2021
- [j18]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Till Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. J. Comput. Geom. 13(2): 115-150 (2021) - [c36]Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta:
Token Shifting on Graphs. COCOON 2021: 643-654 - [c35]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG 2021: 5:1-5:19 - [c34]Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta:
Cyclic Shift Problems on Graphs. WALCOM 2021: 308-320 - [i32]Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta:
Chasing Puppies: Mobile Beacon Routing on Closed Curves. CoRR abs/2103.09811 (2021) - [i31]Giovanni Viglietta:
A Theory of Spherical Diagrams. CoRR abs/2107.05895 (2021) - 2020
- [j17]Giovanni Viglietta:
Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards. Comput. Geom. 86 (2020) - [j16]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Shape formation by programmable particles. Distributed Comput. 33(1): 69-101 (2020) - [j15]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Meeting in a polygon by anonymous oblivious robots. Distributed Comput. 33(5): 445-469 (2020) - [j14]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Fault-tolerant simulation of population protocols. Distributed Comput. 33(6): 561-578 (2020) - [j13]Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in dynamic rings. Theor. Comput. Sci. 811: 79-98 (2020) - [c33]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Mobile RAM and Shape Formation by Programmable Particles. Euro-Par 2020: 343-358 - [c32]Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi:
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. DISC 2020: 12:1-12:17 - [i30]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Mobile RAM and Shape Formation by Programmable Particles. CoRR abs/2002.03384 (2020) - [i29]Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi:
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. CoRR abs/2005.07917 (2020) - [i28]Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta:
Cyclic Shift Problems on Graphs. CoRR abs/2009.10981 (2020)
2010 – 2019
- 2019
- [j12]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Population protocols with faulty interactions: The impact of a leader. Theor. Comput. Sci. 754: 35-49 (2019) - [c31]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Oblivious Permutations on the Plane. OPODIS 2019: 24:1-24:16 - [p2]Giovanni Viglietta:
Uniform Circle Formation. Distributed Computing by Mobile Entities 2019: 83-108 - [p1]Giuseppe Antonio Di Luna, Giovanni Viglietta:
Robots with Lights. Distributed Computing by Mobile Entities 2019: 252-277 - [i27]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Oblivious Permutations on the Plane. CoRR abs/1911.05239 (2019) - 2018
- [c30]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Line Recovery by Programmable Particles. ICDCN 2018: 4:1-4:10 - [c29]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications. DISC 2018: 19:1-19:18 - 2017
- [j11]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Distributed computing by mobile robots: uniform circle formation. Distributed Comput. 30(6): 413-457 (2017) - [j10]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
Mutual visibility by luminous robots without collisions. Inf. Comput. 254: 392-418 (2017) - [j9]Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi:
Constructing self-stabilizing oscillators in population protocols. Inf. Comput. 255: 336-351 (2017) - [c28]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Population Protocols with Faulty Interactions: The Impact of a Leader. CIAC 2017: 454-466 - [c27]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. ICDCS 2017: 2472-2477 - [c26]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Shape Formation by Programmable Particles. OPODIS 2017: 31:1-31:16 - [c25]Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in Dynamic Rings. SIROCCO 2017: 339-355 - [c24]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
Mediated Population Protocols: Leader Election and Applications. TAMC 2017: 172-186 - [c23]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Meeting in a Polygon by Anonymous Oblivious Robots. DISC 2017: 14:1-14:15 - [c22]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Brief Announcement: Shape Formation by Programmable Particles. DISC 2017: 48:1-48:3 - [i26]Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in Dynamic Rings. CoRR abs/1704.02427 (2017) - [i25]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots. CoRR abs/1705.00324 (2017) - [i24]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Shape Formation by Programmable Particles. CoRR abs/1705.03538 (2017) - [i23]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Line-Recovery by Programmable Particles. CoRR abs/1707.05041 (2017) - [i22]Giovanni Viglietta:
Optimally Guarding 2-Reflex Orthogonal Polyhedra by Reflex Edge Guards. CoRR abs/1708.05469 (2017) - [i21]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications. CoRR abs/1709.08800 (2017) - 2016
- [j8]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous with constant memory. Theor. Comput. Sci. 621: 57-72 (2016) - [c21]Marcello Mamino, Giovanni Viglietta:
Square Formation by Asynchronous Oblivious Robots. CCCG 2016: 1-6 - [c20]Erik D. Demaine, Giovanni Viglietta, Aaron Williams:
Super Mario Bros. is Harder/Easier Than We Thought. FUN 2016: 13:1-13:14 - [c19]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
A Rupestrian Algorithm. FUN 2016: 14:1-14:20 - [c18]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Universal Systems of Oblivious Mobile Robots. SIROCCO 2016: 242-257 - [i20]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Implicit Function Computation by Oblivious Mobile Robots. CoRR abs/1602.04881 (2016) - [i19]Marcello Mamino, Giovanni Viglietta:
Square Formation by Asynchronous Oblivious Robots. CoRR abs/1605.06093 (2016) - [i18]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. CoRR abs/1610.09435 (2016) - [i17]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Population Protocols with Faulty Interactions: the Impact of a Leader. CoRR abs/1611.06864 (2016) - 2015
- [j7]Giovanni Viglietta:
Reprint of: Face-guarding polyhedra. Comput. Geom. 48(5): 415-428 (2015) - [j6]Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta:
Getting close without touching: near-gathering for autonomous mobile robots. Distributed Comput. 28(5): 333-349 (2015) - [j5]Giovanni Viglietta:
Lemmings is PSPACE-complete. Theor. Comput. Sci. 586: 120-134 (2015) - [j4]Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta:
Classic Nintendo games are (computationally) hard. Theor. Comput. Sci. 586: 135-160 (2015) - [c17]Giovanni Viglietta, Prosenjit Bose, Jean-Lou De Carufel, Michael Gene Dobbins, Heuna Kim:
The Shadows of a Cycle Cannot All Be Paths. CCCG 2015 - [c16]Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi:
Constructing Self-stabilizing Oscillators in Population Protocols. SSS 2015: 187-200 - [i16]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
Mutual Visibility by Luminous Robots Without Collisions. CoRR abs/1503.04347 (2015) - [i15]Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta:
Getting Close Without Touching: Near-Gathering for Autonomous Mobile Robots. CoRR abs/1505.07168 (2015) - [i14]Giovanni Viglietta:
Simulating a die roll by flipping two coins. CoRR abs/1506.00086 (2015) - [i13]Prosenjit Bose, Jean-Lou De Carufel, Michael Gene Dobbins, Heuna Kim, Giovanni Viglietta:
The Shadows of a Cycle Cannot All Be Paths. CoRR abs/1507.02355 (2015) - 2014
- [j3]Giovanni Viglietta:
Face-guarding polyhedra. Comput. Geom. 47(8): 833-846 (2014) - [j2]Giovanni Viglietta:
Gaming Is a Hard Job, but Someone Has to Do It! Theory Comput. Syst. 54(4): 595-621 (2014) - [c15]Giuseppe Antonio Di Luna, Paola Flocchini, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
The Mutual Visibility Problem for Oblivious Robots. CCCG 2014 - [c14]Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta:
Classic Nintendo Games Are (Computationally) Hard. FUN 2014: 40-51 - [c13]Giovanni Viglietta:
Lemmings Is PSPACE-Complete. FUN 2014: 340-351 - [c12]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. OPODIS 2014: 217-232 - [c11]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Nicola Santoro, Giovanni Viglietta:
Robots with Lights: Overcoming Obstructed Visibility Without Colliding. SSS 2014: 150-164 - [i12]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Nicola Santoro, Giovanni Viglietta:
Robots with Lights: Overcoming Obstructed Visibility Without Colliding. CoRR abs/1405.2430 (2014) - [i11]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. CoRR abs/1407.5917 (2014) - 2013
- [b1]Giovanni Viglietta:
Guarding and Searching Polyhedra. University of Pisa, Italy, 2013 - [c10]Giovanni Viglietta:
Rendezvous of Two Robots with Visible Bits. ALGOSENSORS 2013: 291-306 - [c9]Giovanni Viglietta:
Partial Searchlight Scheduling is Strongly PSPACE-complete. CCCG 2013 - [c8]Giovanni Viglietta:
Face-Guarding Polyhedra. CCCG 2013 - [c7]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous of Two Robots with Constant Memory. SIROCCO 2013: 189-200 - [c6]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow:
Algorithms for Designing Pop-Up Cards. STACS 2013: 269-280 - [i10]Giovanni Viglietta:
Face-Guarding Polyhedra. CoRR abs/1305.2866 (2013) - [i9]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous of Two Robots with Constant Memory. CoRR abs/1306.1956 (2013) - 2012
- [j1]Giovanni Viglietta:
Searching Polyhedra by rotating half-Planes. Int. J. Comput. Geom. Appl. 22(3): 243- (2012) - [c5]Giovanni Viglietta:
Gaming Is a Hard Job, But Someone Has to Do It! FUN 2012: 357-367 - [c4]Giovanni Viglietta:
Hardness of Mastermind. FUN 2012: 368-378 - [c3]Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta:
Getting Close without Touching. SIROCCO 2012: 315-326 - [i8]Giovanni Viglietta:
Partial Searchlight Scheduling is Strongly PSPACE-complete. CoRR abs/1201.2097 (2012) - [i7]Giovanni Viglietta:
Gaming is a hard job, but someone has to do it! CoRR abs/1201.4995 (2012) - [i6]Giovanni Viglietta:
Lemmings is PSPACE-complete. CoRR abs/1202.6581 (2012) - [i5]Giovanni Viglietta:
Guarding and Searching Polyhedra. CoRR abs/1211.2483 (2012) - [i4]Giovanni Viglietta:
Rendezvous of two robots with visible bits. CoRR abs/1211.6039 (2012) - 2011
- [c2]Giovanni Viglietta, Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia:
Edge-guarding Orthogonal Polyhedra. CCCG 2011 - [i3]Giovanni Viglietta:
Searching Polyhedra by Rotating Planes. CoRR abs/1104.4137 (2011) - [i2]Alberto Bandettini, Fabio Luporini, Giovanni Viglietta:
A Survey on Open Problems for Mobile Robots. CoRR abs/1111.2259 (2011) - [i1]Giovanni Viglietta:
Hardness of Mastermind. CoRR abs/1111.6922 (2011) - 2010
- [c1]Giovanni Viglietta, Maurizio Monge:
The 3-dimensional searchlight scheduling problem. CCCG 2010: 9-12
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-01-21 00:20 CET 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:
