Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDPaolo Penna
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j30]Cong Chen
, Paolo Penna, Yinfeng Xu:
Online scheduling of jobs with favorite machines. Comput. Oper. Res. 116: 104868 (2020)- [j29]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. Theory Comput. Syst. 64(3): 508-521 (2020) - [i26]Diodato Ferraioli, Paolo Penna, Carmine Ventre:
Two-way Greedy: Algorithms for Imperfect Rationality. CoRR abs/2007.11868 (2020) - [i25]Ioannis Anagnostides, Paolo Penna:
Solving Zero-Sum Games through Alternating Projections. CoRR abs/2010.00109 (2020) - [i24]Ioannis Anagnostides, Paolo Penna:
A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games. CoRR abs/2010.03211 (2020) - [i23]Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann:
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. CoRR abs/2011.11500 (2020)
2010 – 2019
- 2019
- [c64]Paolo Penna, Laurent Viennot:
Independent Lazy Better-Response Dynamics on Network Games. CIAC 2019: 352-364 - [c63]Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre:
Obviously Strategyproof Mechanisms for Machine Scheduling. ESA 2019: 46:1-46:15 - [c62]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. ESA 2019: 49:1-49:14 - [c61]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti:
Dual-Mode Greedy Algorithms Can Save Energy. ISAAC 2019: 64:1-64:18 - [c60]Luca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann:
Exact Recovery for a Family of Community-Detection Generative Models. ISIT 2019: 415-419 - [c59]Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre:
Automated Optimal OSP Mechanisms for Set Systems - The Case of Small Domains. WINE 2019: 171-185 - [i22]Luca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann:
Exact Recovery for a Family of Community-Detection Generative Models. CoRR abs/1901.06799 (2019) - 2018
- [j28]Stefano Leucci, Akaki Mamageishvili, Paolo Penna:
No truthful mechanism can be better than n approximate for two natural problems. Games Econ. Behav. 111: 64-74 (2018) - [j27]Paolo Penna:
The price of anarchy and stability in general noisy best-response dynamics. Int. J. Game Theory 47(3): 839-855 (2018) - [c58]Simon Collet, Pierre Fraigniaud, Paolo Penna:
Equilibria of Games in Networks for Local Tasks. OPODIS 2018: 6:1-6:16 - [c57]Barbara Geissmann, Paolo Penna:
Inversions from Sorting with Distance-Based Errors. SOFSEM 2018: 508-522 - [c56]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. STACS 2018: 36:1-36:13 - [i21]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. CoRR abs/1804.07575 (2018) - [i20]Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre:
On the approximation guarantee of obviously strategyproof mechanisms. CoRR abs/1805.04190 (2018) - [i19]Cong Chen, Paolo Penna, Yinfeng Xu:
Online scheduling of jobs with favorite machines. CoRR abs/1812.01343 (2018) - 2017
- [c55]Andreas Bärtschi, Daniel Graf, Paolo Penna:
Truthful Mechanisms for Delivery with Agents. ATMOS 2017: 2:1-2:17 - [c54]Cong Chen, Paolo Penna, Yinfeng Xu:
Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy. COCOA (2) 2017: 226-240 - [c53]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. ISAAC 2017: 38:1-38:12 - [c52]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna:
Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS 2017: 10:1-10:14 - [i18]Andreas Bärtschi, Daniel Graf, Paolo Penna:
Truthful Mechanisms for Delivery with Mobile Agents. CoRR abs/1702.07665 (2017) - [i17]Cong Chen, Paolo Penna, Yinfeng Xu:
Selfish Jobs with Favorite Machines: Price of Anarchy vs Strong Price of Anarchy. CoRR abs/1709.06367 (2017) - [i16]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. CoRR abs/1709.07249 (2017) - [i15]Stefano Leucci, Akaki Mamageishvili, Paolo Penna:
No truthful mechanism can be better than n approximate for two natural problems. CoRR abs/1712.06709 (2017) - 2016
- [j26]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Convergence to Equilibrium of Logit Dynamics for Strategic Games. Algorithmica 76(1): 110-142 (2016) - [j25]Akaki Mamageishvili, Paolo Penna:
Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games. Oper. Res. Lett. 44(5): 645-648 (2016) - [c51]Pierluigi Crescenzi, Pierre Fraigniaud, Zvi Lotker, Paolo Penna:
Core-periphery clustering and collaboration networks. ASONAM 2016: 525-528 - [c50]Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On Computing the Total Displacement Number via Weighted Motzkin Paths. IWOCA 2016: 423-434 - [c49]Matús Mihalák, Paolo Penna, Peter Widmayer:
Bribeproof Mechanisms for Two-Values Domains. SAGT 2016: 289-301 - [i14]Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On computing the total displacement number via weighted Motzkin paths. CoRR abs/1606.05538 (2016) - [i13]Simon Collet, Pierre Fraigniaud, Paolo Penna:
Local Distributed Algorithms for Selfish Agents. CoRR abs/1607.03677 (2016) - [i12]Paolo Penna, Laurent Viennot:
Independent lazy better-response dynamics on network games. CoRR abs/1609.08953 (2016) - [i11]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna:
Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR abs/1610.02361 (2016) - [i10]Barbara Geissmann, Paolo Penna:
Sort well with energy-constrained comparisons. CoRR abs/1610.09223 (2016) - [i9]Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna:
Sequential Solutions in Machine Scheduling Games. CoRR abs/1611.04159 (2016) - 2015
- [j24]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Logit Dynamics with Concurrent Updates for Local Interaction Potential Games. Algorithmica 73(3): 511-546 (2015) - [j23]Vincenzo Auletta, George Christodoulou, Paolo Penna:
Mechanisms for Scheduling with Single-Bit Private Values. Theory Comput. Syst. 57(3): 523-548 (2015) - [j22]Diodato Ferraioli, Paolo Penna:
Imperfect Best-Response Mechanisms. Theory Comput. Syst. 57(3): 681-710 (2015) - [c48]Sandro Montanari, Paolo Penna:
On Sampling Simple Paths in Planar Graphs According to Their Lengths. MFCS (2) 2015: 493-504 - [i8]Akaki Mamageishvili, Paolo Penna:
Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games. CoRR abs/1512.03484 (2015) - [i7]Paolo Penna:
The price of anarchy and stability in general noisy best-response dynamics. CoRR abs/1512.04017 (2015) - [i6]Matús Mihalák, Paolo Penna, Peter Widmayer:
Bribeproof mechanisms for two-values domains. CoRR abs/1512.04277 (2015) - 2014
- [j21]Paolo Penna, Carmine Ventre:
Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. 86: 491-509 (2014) - 2013
- [c47]Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer:
Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS 2013: 111-122 - [c46]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Logit Dynamics with Concurrent Updates for Local Interaction Games. ESA 2013: 73-84 - [c45]Diodato Ferraioli, Paolo Penna:
Imperfect Best-Response Mechanisms. SAGT 2013: 243-254 - 2012
- [j20]Paolo Penna, Carmine Ventre:
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. ACM Trans. Comput. Theory 4(2): 6:1-6:17 (2012) - [c44]Vincenzo Auletta, George Christodoulou, Paolo Penna:
Mechanisms for Scheduling with Single-Bit Private Values. SAGT 2012: 25-36 - [i5]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Reversibility and Mixing Time for Logit Dynamics with Concurrent Updates. CoRR abs/1207.2908 (2012) - [i4]Diodato Ferraioli, Paolo Penna:
Imperfect best-response mechanisms. CoRR abs/1208.0699 (2012) - [i3]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Convergence to Equilibrium of Logit Dynamics for Strategic Games. CoRR abs/1212.1884 (2012) - 2011
- [j19]Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre:
Alternatives to truthfulness are hard to recognize. Auton. Agents Multi Agent Syst. 22(1): 200-216 (2011) - [j18]Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre:
A response to "Mechanism Design with Partial Verification and Revelation Principle". Auton. Agents Multi Agent Syst. 22(1): 224 (2011) - [c43]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Convergence to equilibrium of logit dynamics for strategic games. SPAA 2011: 197-206
2000 – 2009
- 2009
- [j17]Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
The power of verification for one-parameter agents. J. Comput. Syst. Sci. 75(3): 190-211 (2009) - [j16]Paolo Penna, Guido Proietti, Peter Widmayer:
Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. 410(17): 1607-1615 (2009) - [j15]Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
On designing truthful mechanisms for online scheduling. Theor. Comput. Sci. 410(36): 3348-3356 (2009) - [c42]Vincenzo Auletta, Paolo Penna, Giuseppe Persiano:
Private Capacities in Mechanism Design. MFCS 2009: 112-123 - [c41]Paolo Penna, Carmine Ventre:
Optimal collusion-resistant mechanisms with verification. EC 2009: 147-156 - [c40]Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer:
Pseudonyms in Cost-Sharing Games. WINE 2009: 256-267 - [p1]Luzi Anderegg, Paolo Penna, Peter Widmayer:
Online Train Disposition: To Wait or Not to Wait? Robust and Online Large-Scale Optimization 2009: 387-398 - 2008
- [j14]Paolo Penna, S. S. Ravi:
Guest editors' introduction. ACM SIGMOBILE Mob. Comput. Commun. Rev. 12(1): 15-16 (2008) - [c39]Paolo Penna, Carmine Ventre:
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. ESA 2008: 708-719 - [c38]Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre:
Alternatives to Truthfulness Are Hard to Recognize. SAGT 2008: 194-205 - [c37]Vincenzo Auletta, Luca Moscardelli, Paolo Penna, Giuseppe Persiano:
Interference Games in Wireless Networks. WINE 2008: 278-285 - 2007
- [j13]Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5(1): 162-175 (2007) - [j12]Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
Routing selfish unsplittable traffic. ACM Trans. Algorithms 3(4): 52 (2007) - [c36]Angelo Monti, Paolo Penna, Riccardo Silvestri:
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. WG 2007: 154-165 - 2006
- [c35]Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Carmine Ventre:
New Constructions of Mechanisms with Verification. ICALP (1) 2006: 596-607 - [c34]Paolo Penna, Carmine Ventre:
The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms. STACS 2006: 337-348 - [c33]Paolo Penna, Guido Proietti, Peter Widmayer:
Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE 2006: 377-388 - 2005
- [j11]Gian Carlo Bongiovanni, Paolo Penna:
XOR-Based Schemes for Fast Parallel IP Lookups. Theory Comput. Syst. 38(4): 481-501 (2005) - [j10]Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. 343(1-2): 27-41 (2005) - [j9]Mark Cieliebak, Stephan J. Eidenbenz, Paolo Penna:
Partial Digest is hard to solve for erroneous input data. Theor. Comput. Sci. 349(3): 361-381 (2005) - [c32]Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca:
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW 2005: 4-17 - [c31]Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
On Designing Truthful Mechanisms for Online Scheduling. SIROCCO 2005: 3-17 - [c30]Paolo Penna, Carmine Ventre:
Free-Riders in Steiner Tree Cost-Sharing Games. SIROCCO 2005: 231-245 - 2004
- [j8]Paolo Penna, Paola Vocca:
Proximity drawings in polynomial area and volume. Comput. Geom. 29(2): 91-116 (2004) - [j7]Pilu Crescenzi, Giorgio Gambosi, Paolo Penna:
On-line algorithms for the channel assignment problem in cellular networks. Discret. Appl. Math. 137(3): 237-266 (2004) - [j6]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
On the Power Assignment Problem in Radio Networks. Mob. Networks Appl. 9(2): 125-140 (2004) - [c29]Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
The Power of Verification for One-Parameter Agents. ICALP 2004: 171-182 - [c28]Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer:
Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS 2004: 167-180 - [c27]Paolo Penna, Carmine Ventre:
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. PE-WASUN 2004: 61-68 - [c26]Paolo Penna, Carmine Ventre:
Sharing the Cost of Multicast Transmissions in Wireless Networks. SIROCCO 2004: 255-266 - [c25]Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano:
How to route and tax selfish unsplittable traffic. SPAA 2004: 196-205 - [c24]Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. STACS 2004: 608-619 - [c23]Paolo Penna, Carmine Ventre:
More Powerful and Simpler Cost-Sharing Methods. WAOA 2004: 97-110 - 2003
- [j5]Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica 35(2): 95-110 (2003) - [c22]Gian Carlo Bongiovanni, Paolo Penna:
XOR-Based Schemes for Fast Parallel IP Lookups. CIAC 2003: 238-250 - [c21]Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer:
Improving Customer Proximity to Railway Stations. CIAC 2003: 264-276 - [c20]Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
Online Load Balancing Made Simple: Greedy Strikes Back. ICALP 2003: 1108-1122 - [c19]Andrea E. F. Clementi, Gurvan Huiban, Gianluca Rossi, Yann C. Verhoeven, Paolo Penna:
On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. IPDPS 2003: 222 - [c18]Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. SIROCCO 2003: 1-16 - [c17]Mark Cieliebak, Stephan J. Eidenbenz, Paolo Penna:
Noisy Data Make the Partial Digest Problem NP-hard. WABI 2003: 111-123 - [c16]Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA 2003: 248-251 - 2002
- [j4]Luzi Anderegg, Paolo Penna, Peter Widmayer:
Online train disposition: to wait or not to wait? Electron. Notes Theor. Comput. Sci. 66(6): 32-41 (2002) - [j3]Paolo Penna:
On the approximability of two tree drawing conventions. Inf. Process. Lett. 82(5): 237-242 (2002) - [c15]Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer:
Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS 2002: 280-291 - 2001
- [c14]Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer:
On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402 - [c13]Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri:
On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222 - [c12]Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca:
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS 2001: 121-131 - 2000
- [c11]Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna:
On-line algorithms for the channel assignment problem in cellular networks. DIAL-M 2000: 1-7 - [c10]Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks. ESA 2000: 143-154 - [c9]Gian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna:
A Note on Parallel Read Operations on Large Public Databases. ICALP Satellite Workshops 2000: 123-134 - [c8]Paolo Penna:
Succinct Representations of Model Based Belief Revision. STACS 2000: 205-216 - [c7]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
The Power Range Assignment Problem in Radio Networks on the Plane. STACS 2000: 651-660 - [i2]Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim:
Parallel Read Operations Without Memory Contention. Electron. Colloquium Comput. Complex. 7(53) (2000) - [i1]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
On the power assignment problem in radio networks. Electron. Colloquium Comput. Complex. 7(54) (2000)
1990 – 1999
- 1999
- [c6]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. RANDOM-APPROX 1999: 197-208 - [c5]Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim:
Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. STACS 1999: 68-77 - 1998
- [j2]Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno:
Linear area upward drawings of AVL trees. Comput. Geom. 9(1-2): 25-42 (1998) - [j1]Pierluigi Crescenzi, Paolo Penna:
Strictly-upward Drawings of Ordered Search Trees. Theor. Comput. Sci. 203(1): 51-67 (1998) - [c4]Paolo Penna, Paola Vocca:
Proximity drawings of binary trees in polynomial area. CCCG 1998 - [c3]Paolo Penna, Paola Vocca:
Proximity Drawings: Three Dimensions Are Better than Two. Graph Drawing 1998: 275-287 - 1997
- [c2]Pierluigi Crescenzi, Paolo Penna:
Minimum-Area h-v Drawings of Complete Binary Trees. Graph Drawing 1997: 371-382 - 1996
- [c1]Pierluigi Crescenzi, Paolo Penna:
Upward Drawings of Search Trees (Extended Abstract). WG 1996: 114-125
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-11-27 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
