default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeeter Laud
Person information
- affiliation: Cybernetica AS, Tartu, Estonia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j10]Nikita Snetkov, Jelizaveta Vakarjuk, Peeter Laud:
TOPCOAT: towards practical two-party Crystals-Dilithium. Discov. Comput. 27(1): 18 (2024)- [c73]Dan Bogdanov, Joosep Jääger, Peeter Laud, Härmel Nestra, Martin Pettai, Jaak Randmets, Raul-Martin Rebane, Ville Sokk, Kert Tali, Sandhra-Mirella Valdma:
ZK-SecreC: a Domain-Specific Language for Zero-Knowledge Proofs. CSF 2024: 372-387 - [c72]Jelizaveta Vakarjuk, Nikita Snetkov, Peeter Laud:
Identifying Obstacles of PQC Migration in E-Estonia. CyCon 2024: 63-81 - [i31]Kaarel August Kurik, Peeter Laud:
Novel approximations of elementary functions in zero-knowledge proofs. IACR Cryptol. ePrint Arch. 2024: 859 (2024) - 2023
- [c71]Aivo Kalu
, Burak Can Kus, Peeter Laud, Kin Long Leung, Nikita Snetkov, Jelizaveta Vakarjuk:
CACS: A Cloud Privacy-Preserving Attribute Management System. ARES 2023: 122:1-122:9 - [c70]Pierluigi Plebani, Ronen I. Kat, Frank Pallas, Sebastian Werner, Giacomo Inches, Peeter Laud, Rita Santiago:
TEADAL: Trustworthy, Energy-Aware federated DAta Lakes along the computing continuum. CAiSE Research Projects Exhibition 2023: 28-35 - [i30]Johanna Maria Kirss, Peeter Laud, Nikita Snetkov, Jelizaveta Vakarjuk:
Server-Supported Decryption for Mobile Devices. IACR Cryptol. ePrint Arch. 2023: 39 (2023) - 2022
- [j9]Mohammad Anagreh, Peeter Laud, Eero Vainikko:
Privacy-Preserving Parallel Computation of Minimum Spanning Forest. SN Comput. Sci. 3(6): 448 (2022) - [j8]Marlon Dumas, Luciano García-Bañuelos, Joosep Jääger, Peeter Laud, Raimundas Matulevicius, Alisa Pankova, Martin Pettai, Pille Pullonen-Raudvere, Aivo Toots, Reedik Tuuling, Maksym Yerokhin:
Multi-level privacy analysis of business processes: the Pleak toolset. Int. J. Softw. Tools Technol. Transf. 24(2): 183-203 (2022) - [c69]Alisa Pankova, Peeter Laud:
Interpreting Epsilon of Differential Privacy in Terms of Advantage in Guessing or Approximating Sensitive Attributes. CSF 2022: 96-111 - [c68]Mohammad Anagreh, Peeter Laud:
A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem. DPM/CBT@ESORICS 2022: 120-135 - [c67]Peeter Laud, Jelizaveta Vakarjuk:
A Comparison-Based Methodology for the Security Assurance of Novel Systems. CyberICPS/SECPRE/SPOSE/CPS4CIP/CDT&SECOMAN/EIS/SecAssure@ESORICS 2022: 625-644 - [c66]Mohammad Anagreh, Peeter Laud, Eero Vainikko:
Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity. ICISSP 2022: 37-47 - [c65]Johanna Maria Kirss, Peeter Laud, Nikita Snetkov, Jelizaveta Vakarjuk:
Server-Supported Decryption for Mobile Devices. STM 2022: 71-81 - [i29]Dan Bogdanov, Joosep Jääger, Peeter Laud, Härmel Nestra, Martin Pettai, Jaak Randmets, Ville Sokk, Kert Tali, Sandhra-Mirella Valdma:
ZK-SecreC: a Domain-Specific Language for Zero Knowledge Proofs. CoRR abs/2203.15448 (2022) - [i28]Mohammad Anagreh, Peeter Laud:
A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem. CoRR abs/2207.07964 (2022) - [i27]Peeter Laud, Nikita Snetkov, Jelizaveta Vakarjuk:
DiLizium 2.0: Revisiting Two-Party Crystals-Dilithium. IACR Cryptol. ePrint Arch. 2022: 644 (2022) - 2021
- [j7]Mohammad Anagreh, Peeter Laud, Eero Vainikko:
Parallel Privacy-Preserving Shortest Path Algorithms. Cryptogr. 5(4): 27 (2021) - [c64]Aleksandr Lenin, Peeter Laud:
Attribute-based encryption for named data networking. ICN 2021: 118-120 - [c63]Peeter Laud:
Linear-Time Oblivious Permutations for SPDZ. CANS 2021: 245-252 - [c62]Mohammad Anagreh, Eero Vainikko, Peeter Laud:
Parallel Privacy-preserving Computation of Minimum Spanning Trees. ICISSP 2021: 181-190 - [c61]Mohammad Anagreh, Eero Vainikko, Peeter Laud:
Parallel Privacy-Preserving Shortest Paths by Radius-Stepping. PDP 2021: 276-280 - [c60]Peeter Laud:
Efficient Permutation Protocol for MPC in the Head. STM 2021: 62-80 - [c59]Mark F. St. John, Grit Denker, Peeter Laud, Karsten Martiny, Alisa Pankova, Dusko Pavlovic:
Decision Support for Sharing Data using Differential Privacy. VizSec 2021: 26-35 - [i26]Aleksandr Lenin, Peeter Laud:
Content Confidentiality in Named Data Networking. CoRR abs/2102.10612 (2021) - [i25]Peeter Laud:
Efficient permutation protocol for MPC in the head. IACR Cryptol. ePrint Arch. 2021: 354 (2021) - 2020
- [j6]Peeter Laud, Alisa Pankova, Martin Pettai:
A Framework of Metrics for Differential Privacy from Local Sensitivity. Proc. Priv. Enhancing Technol. 2020(2): 175-208 (2020) - [c58]Gamal Elkoumy, Stephan A. Fahrenkrog-Petersen, Marlon Dumas, Peeter Laud, Alisa Pankova, Matthias Weidlich:
Shareprom: A Tool for Privacy-Preserving Inter-Organizational Process Mining. BPM (PhD/Demos) 2020: 72-76 - [c57]Gamal Elkoumy, Stephan A. Fahrenkrog-Petersen, Marlon Dumas, Peeter Laud, Alisa Pankova, Matthias Weidlich:
Secure Multi-party Computation for Inter-organizational Process Mining. BPMDS/EMMSAD@CAiSE 2020: 166-181 - [c56]Mohammad Anagreh, Eero Vainikko, Peeter Laud:
Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM. ICISSP 2020: 176-184
2010 – 2019
- 2019
- [j5]Aivo Toots, Reedik Tuuling, Maksym Yerokhin, Marlon Dumas, Luciano García-Bañuelos, Peeter Laud, Raimundas Matulevicius, Alisa Pankova, Martin Pettai, Pille Pullonen, Jake Tom:
Business Process Privacy Analysis in Pleak - (Extended Abstract). Inform. Spektrum 42(5): 354-355 (2019) - [c55]Hayretdin Bahsi, Veiko Dieves, Taivo Kangilaski, Peeter Laud, Leo Motus, Jaan Murumets, Illimar Ploom, Jaan Priisalu, Mari Seeba, Ermo Täks, Kaide Tammel, Piia Tammpuu, Kuldar Taveter, Avo Trumm, Tiia-Triin Truusa, Triin Vihalemm:
Mapping the Information Flows for the Architecture of a Nationwide Situation Awareness System : (Poster). CogSIMA 2019: 152-157 - [c54]Aivo Toots, Reedik Tuuling, Maksym Yerokhin, Marlon Dumas, Luciano García-Bañuelos, Peeter Laud, Raimundas Matulevicius, Alisa Pankova, Martin Pettai, Pille Pullonen, Jake Tom:
Business Process Privacy Analysis in Pleak. FASE 2019: 306-312 - [c53]Mohammad Anagreh, Eero Vainikko, Peeter Laud:
Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing. ICISSP 2019: 238-245 - [i24]Aivo Toots, Reedik Tuuling, Maksym Yerokhin, Marlon Dumas, Luciano García-Bañuelos, Peeter Laud, Raimundas Matulevicius, Alisa Pankova, Martin Pettai, Pille Pullonen, Jake Tom:
Business Process Privacy Analysis in Pleak. CoRR abs/1902.05052 (2019) - [i23]Peeter Laud, Alisa Pankova:
Interpreting Epsilon of Differential Privacy in Terms of Advantage in Guessing or Approximating Sensitive Attributes. CoRR abs/1911.12777 (2019) - [i22]Gamal Elkoumy, Stephan A. Fahrenkrog-Petersen, Marlon Dumas, Peeter Laud, Alisa Pankova, Matthias Weidlich:
Secure Multi-Party Computation for Inter-Organizational Process Mining. CoRR abs/1912.01855 (2019) - 2018
- [c52]Peeter Laud, Martin Pettai, Jaak Randmets:
Sensitivity Analysis of SQL Queries. PLAS@CCS 2018: 2-12 - [c51]Peeter Laud, Alisa Pankova:
Bit Decomposition Protocols in Secure Multiparty Computation. WAHC@CCS 2018: 37-48 - [c50]Marlon Dumas, Luciano García-Bañuelos, Peeter Laud:
Disclosure Analysis of SQL Workflows. GraMSec@FLoC 2018: 51-70 - [i21]Peeter Laud, Alisa Pankova, Martin Pettai:
Achieving Differential Privacy using Methods from Calculus. CoRR abs/1811.06343 (2018) - 2017
- [j4]Peeter Laud, Alisa Pankova, Roman Jagomägis:
Preprocessing Based Verification of Multiparty Protocols with Honest Majority. Proc. Priv. Enhancing Technol. 2017(4): 23-76 (2017) - [c49]Ahto Buldas, Aivo Kalu, Peeter Laud, Mart Oruaas:
Server-Supported RSA Signatures for Mobile Devices. ESORICS (1) 2017: 315-333 - [c48]Peeter Laud, Alisa Pankova:
Privacy-Preserving Frequent Itemset Mining for Sparse and Dense Data. NordSec 2017: 139-155 - [c47]Martin Pettai, Peeter Laud:
Combining Differential Privacy and Mutual Information for Analyzing Leakages in Workflows. POST 2017: 298-319 - 2016
- [c46]Marlon Dumas, Luciano García-Bañuelos, Peeter Laud:
Differential Privacy Analysis of Data Processing Workflows. GraMSec@CSF 2016: 62-79 - [c45]Peeter Laud, Alisa Pankova:
Securing Multiparty Protocols Against the Exposure of Data to Honest Parties. DPM/QASA@ESORICS 2016: 165-180 - [c44]Liisi Kerik, Peeter Laud, Jaak Randmets:
Optimizing MPC for Robust and Scalable Integer and Floating-Point Arithmetic. Financial Cryptography Workshops 2016: 271-287 - [c43]Peeter Laud, Alisa Pankova:
Optimizing Secure Computation Programs with Private Conditionals. ICICS 2016: 418-430 - [c42]Peeter Laud, Martin Pettai:
Secure Multiparty Sorting Protocols with Covert Privacy. NordSec 2016: 216-231 - [i20]Peeter Laud, Alisa Pankova:
Securing Multiparty Protocols against the Exposure of Data to Honest Parties. IACR Cryptol. ePrint Arch. 2016: 650 (2016) - [i19]Peeter Laud, Alisa Pankova:
Optimizing Secure Computation Programs with Private Conditionals. IACR Cryptol. ePrint Arch. 2016: 942 (2016) - 2015
- [j3]Peeter Laud:
Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees. Proc. Priv. Enhancing Technol. 2015(2): 188-205 (2015) - [c41]Martin Pettai, Peeter Laud:
Combining Differential Privacy and Secure Multiparty Computation. ACSAC 2015: 421-430 - [c40]Peeter Laud, Jaak Randmets:
A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols. CCS 2015: 1492-1503 - [c39]Martin Pettai, Peeter Laud:
Automatic Proofs of Privacy of Secure Multi-party Computation Protocols against Active Adversaries. CSF 2015: 75-89 - [c38]Dilian Gurov, Peeter Laud, Roberto Guanciale:
Privacy preserving business process matching. PST 2015: 36-43 - [i18]Peeter Laud, Alisa Pankova:
Transformation-Based Outsourcing of Linear Equation Systems over Real Numbers. IACR Cryptol. ePrint Arch. 2015: 322 (2015) - [i17]Martin Pettai, Peeter Laud:
Combining Differential Privacy and Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2015: 598 (2015) - [i16]Peeter Laud, Alisa Pankova:
Privacy-preserving Frequent Itemset Mining for Sparse and Dense Data. IACR Cryptol. ePrint Arch. 2015: 671 (2015) - [i15]Peeter Laud, Alisa Pankova:
Preprocessing-Based Verification of Multiparty Protocols with Honest Majority. IACR Cryptol. ePrint Arch. 2015: 674 (2015) - 2014
- [c37]Dan Bogdanov, Peeter Laud, Sven Laur, Pille Pullonen:
From Input Private to Universally Composable Secure Multi-party Computation Primitives. CSF 2014: 184-198 - [c36]Dan Bogdanov, Peeter Laud, Jaak Randmets:
Domain-Polymorphic Programming of Privacy-Preserving Applications. PLAS@ECOOP 2014: 53 - [c35]Peeter Laud, Jan Willemson:
Composable Oblivious Extended Permutations. FPS 2014: 294-310 - [c34]Peeter Laud:
A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation. ICICS 2014: 143-157 - [c33]Ahto Buldas, Risto Laanoja, Peeter Laud, Ahto Truu:
Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures. ProvSec 2014: 130-145 - [c32]Peeter Laud, Alisa Pankova:
Verifiable Computation in Multiparty Protocols with Honest Majority. ProvSec 2014: 146-161 - [c31]Roberto Guanciale, Dilian Gurov, Peeter Laud:
Private intersection of regular languages. PST 2014: 112-120 - [i14]Peeter Laud, Alisa Pankova:
Verifiable Computation in Multiparty Protocols with Honest Majority. IACR Cryptol. ePrint Arch. 2014: 60 (2014) - [i13]Dan Bogdanov, Peeter Laud, Sven Laur, Pille Pullonen:
From Input Private to Universally Composable Secure Multiparty Computation Primitives. IACR Cryptol. ePrint Arch. 2014: 201 (2014) - [i12]Martin Pettai, Peeter Laud:
Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries. IACR Cryptol. ePrint Arch. 2014: 240 (2014) - [i11]Peeter Laud, Jan Willemson:
Composable Oblivious Extended Permutations. IACR Cryptol. ePrint Arch. 2014: 400 (2014) - [i10]Peeter Laud:
Efficient Oblivious Parallel Array Reads and Writes for Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 630 (2014) - [i9]Ahto Buldas, Risto Laanoja, Peeter Laud, Ahto Truu:
Bounded Pre-Image Awareness and the Security of Hash-Tree Keyless Signatures. IACR Cryptol. ePrint Arch. 2014: 700 (2014) - 2013
- [c30]Peeter Laud, Alisa Pankova, Martin Pettai, Jaak Randmets:
Specifying sharemind's arithmetic black box. PETShop@CCS 2013: 19-22 - [c29]Dan Bogdanov, Peeter Laud, Jaak Randmets:
Domain-polymorphic language for privacy-preserving applications. PETShop@CCS 2013: 23-26 - [c28]Peeter Laud, Alisa Pankova:
On the (Im)possibility of privately outsourcing linear programming. CCSW 2013: 55-64 - [c27]Martin Pettai, Peeter Laud:
Dynamics and Secure Information Flow for a Higher-Order Pi-Calculus. NordSec 2013: 100-115 - [c26]Peeter Laud, Alisa Pankova:
New Attacks against Transformation-Based Privacy-Preserving Linear Programming. STM 2013: 17-32 - [i8]Peeter Laud, Alisa Pankova:
New Attacks against Transformation-Based Privacy-Preserving Linear Programming. IACR Cryptol. ePrint Arch. 2013: 355 (2013) - [i7]Dan Bogdanov, Peeter Laud, Jaak Randmets:
Domain-Polymorphic Programming of Privacy-Preserving Applications. IACR Cryptol. ePrint Arch. 2013: 371 (2013) - [i6]Peeter Laud, Jan Willemson:
Universally composable privacy preserving finite automata execution with low online and offline complexity. IACR Cryptol. ePrint Arch. 2013: 678 (2013) - 2012
- [c25]Alisa Pankova, Peeter Laud:
Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings. CSF 2012: 63-77 - [c24]Peeter Laud:
Secure Implementation of Asynchronous Method Calls and Futures. INTRUST 2012: 25-47 - [c23]Martin Pettai, Peeter Laud:
Securing the Future - An Information Flow Analysis of a Distributed OO Language. SOFSEM 2012: 576-587 - [e1]Peeter Laud:
Information Security Technology for Applications - 16th Nordic Conference on Secure IT Systems, NordSec 2011, Tallinn, Estonia, October 26-28, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7161, Springer 2012, ISBN 978-3-642-29614-7 [contents] - 2011
- [c22]Sven Heiberg, Peeter Laud, Sigurðr Másson, Claus Popp Larsen:
Secure mobile access to homecare patients' data. ICEGOV 2011: 363-364 - [c21]Abu Shohel Ahmed, Peeter Laud:
Formal Security Analysis of OpenID with GBA Protocol. MobiSec 2011: 113-124 - [c20]Peeter Laud:
Implementing Cryptographic Primitives in the Symbolic Model. NASA Formal Methods 2011: 267-281 - [c19]Madeline González Muñiz, Peeter Laud:
On the (im)possibility of perennial message recognition protocols without public-key cryptography. SAC 2011: 1510-1515 - [c18]Sven Heiberg, Peeter Laud, Jan Willemson:
The Application of I-Voting for Estonian Parliamentary Elections of 2011. VoteID 2011: 208-223 - [i5]Madeline González Muñiz, Peeter Laud:
Strong Forward Security in Identity-Based Signcryption. IACR Cryptol. ePrint Arch. 2011: 156 (2011)
2000 – 2009
- 2009
- [c17]Peeter Laud, Ilja Tsahhirov:
A User Interface for a Game-Based Protocol Verification Tool. Formal Aspects in Security and Trust 2009: 263-278 - [c16]Peeter Laud, Meelis Roos:
Formal Analysis of the Estonian Mobile-ID Protocol. NordSec 2009: 271-286 - 2008
- [c15]Peeter Laud:
On the computational soundness of cryptographically masked flows. POPL 2008: 337-348 - [c14]Peeter Laud, Long Ngo:
Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library. ProvSec 2008: 298-312 - [i4]Peeter Laud, Long Ngo:
Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library. IACR Cryptol. ePrint Arch. 2008: 367 (2008) - 2007
- [c13]Ilja Tsahhirov, Peeter Laud:
Application of Dependency Graphs to Security Protocol Analysis. TGC 2007: 294-311 - 2006
- [j2]Peeter Laud, Tarmo Uustalu, Varmo Vene:
Type systems equivalent to data-flow analyses for imperative languages. Theor. Comput. Sci. 364(3): 292-310 (2006) - [c12]Michael Backes, Peeter Laud:
Computationally sound secrecy proofs by mechanized flow analysis. CCS 2006: 370-379 - [c11]Ahto Buldas, Peeter Laud, Jaan Priisalu, Märt Saarepera, Jan Willemson:
Rational Choice of Security Measures Via Multi-parameter Attack Trees. CRITIS 2006: 235-248 - [i3]Michael Backes, Peeter Laud:
Computationally Sound Secrecy Proofs by Mechanized Flow Analysis. IACR Cryptol. ePrint Arch. 2006: 266 (2006) - 2005
- [c10]Peeter Laud:
Secrecy types for a simulatable cryptographic library. CCS 2005: 26-35 - [c9]Peeter Laud, Varmo Vene:
A Type System for Computationally Secure Information Flow. FCT 2005: 365-377 - [c8]Ahto Buldas, Peeter Laud, Märt Saarepera, Jan Willemson:
Universally Composable Time-Stamping Schemes with Audit. ISC 2005: 359-373 - [i2]Ahto Buldas, Peeter Laud, Märt Saarepera, Jan Willemson:
Universally Composable Time-Stamping Schemes with Audit. IACR Cryptol. ePrint Arch. 2005: 198 (2005) - 2004
- [c7]Peeter Laud:
Symmetric Encryption in Automatic Analyses for Confidentiality against Active Adversaries. S&P 2004: 71-85 - 2003
- [c6]Peeter Laud:
Handling Encryption in an Analysis for Secure Information Flow. ESOP 2003: 159-173 - [c5]Peeter Laud, Ricardo Corin:
Sound Computational Interpretation of Formal Encryption with Composed Keys. ICISC 2003: 55-66 - 2002
- [b1]Peeter Laud:
Computationally secure information flow. Saarland University, Saarbrücken, Germany, 2002, ISBN 9985-78-703-X, pp. 1-192 - [j1]Ahto Buldas, Peeter Laud, Helger Lipmaa:
Eliminating Counterevidence with Applications to Accountable Certificate Management. J. Comput. Secur. 10(3): 273-296 (2002) - 2001
- [c4]Peeter Laud:
Semantics and Program Analysis of Computationally Secure Information Flow. ESOP 2001: 77-91 - 2000
- [c3]Ahto Buldas, Peeter Laud, Helger Lipmaa:
Accountable certificate management using undeniable attestations. CCS 2000: 9-17 - [i1]Ahto Buldas, Peeter Laud, Helger Lipmaa:
Accountable Certificate Management using Undeniable Attestations. IACR Cryptol. ePrint Arch. 2000: 27 (2000)
1990 – 1999
- 1998
- [c2]Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Willemson:
Time-Stamping with Binary Linking Schemes. CRYPTO 1998: 486-501 - [c1]Ahto Buldas, Peeter Laud:
New linking schemes for digital time-stamping. ICISC 1998: 3-13
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-18 19:30 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:
