default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntigoni Polychroniadou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j4]Yue Guo, Antigoni Polychroniadou, Elaine Shi, David Byrd, Tucker Balch:
MicroSecAgg: Streamlined Single-Server Secure Aggregation. Proc. Priv. Enhancing Technol. 2024(3): 246-275 (2024)- [j3]Zachary McBride Lazri
, Ivan Brugere, Xin Tian, Dana Dachman-Soled, Antigoni Polychroniadou, Danial Dervovic, Min Wu:
A Canonical Data Transformation for Achieving Inter- and Within-Group Fairness. IEEE Trans. Inf. Forensics Secur. 19: 7449-7464 (2024) - [c45]Antigoni Polychroniadou, Gabriele Cipriani, Richard Hua, Tucker Balch:
Atlas-X Equity Financing: Unlocking New Methods to Securely Obfuscate Axe Inventory Data Based on Differential Privacy. AAMAS 2024: 1585-1592 - [c44]Yvonne Zhou, Mingyu Liang, Ivan Brugere, Danial Dervovic, Antigoni Polychroniadou, Min Wu, Dana Dachman-Soled:
Bounding the Excess Risk for Linear Models Trained on Marginal-Preserving, Differentially-Private, Synthetic Data. ICML 2024 - [c43]Yue Guo, Harish Karthikeyan, Antigoni Polychroniadou, Chaddy Huussin:
PriDe CT: Towards Public Consensus, Private Transactions, and Forward Secrecy in Decentralized Payments. SP 2024: 3904-3922 - [i45]Yvonne Zhou, Mingyu Liang, Ivan Brugere, Dana Dachman-Soled, Danial Dervovic, Antigoni Polychroniadou, Min Wu:
Bounding the Excess Risk for Linear Models Trained on Marginal-Preserving, Differentially-Private, Synthetic Data. CoRR abs/2402.04375 (2024) - [i44]Zachary McBride Lazri, Danial Dervovic, Antigoni Polychroniadou, Ivan Brugere, Dana Dachman-Soled, Min Wu:
Balancing Fairness and Accuracy in Data-Restricted Binary Classification. CoRR abs/2403.07724 (2024) - [i43]Antigoni Polychroniadou, Gabriele Cipriani, Richard Hua, Tucker Balch:
Atlas-X Equity Financing: Unlocking New Methods to Securely Obfuscate Axe Inventory Data Based on Differential Privacy. CoRR abs/2404.06686 (2024) - [i42]Antigoni Polychroniadou, Gabriele Cipriani, Richard Hua, Tucker Balch:
Atlas-X Equity Financing: Unlocking New Methods to Securely Obfuscate Axe Inventory Data Based on Differential Privacy. IACR Cryptol. ePrint Arch. 2024: 461 (2024) - [i41]Harish Karthikeyan, Antigoni Polychroniadou:
OPA: One-shot Private Aggregation with Single Client Interaction and its Applications to Federated Learning. IACR Cryptol. ePrint Arch. 2024: 723 (2024) - [i40]Daniel Escudero, Antigoni Polychroniadou, Yifan Song, Chenkai Weng:
Dishonest Majority Multi-Verifier Zero-Knowledge Proofs for Any Constant Fraction of Corrupted Verifiers. IACR Cryptol. ePrint Arch. 2024: 997 (2024) - 2023
- [j2]Sahar Mazloom, Benjamin E. Diamond, Antigoni Polychroniadou, Tucker Balch:
An Efficient Data-Independent Priority Queue and its Application to Dark Pools. Proc. Priv. Enhancing Technol. 2023(2): 5-22 (2023) - [c42]Hanjun Li, Huijia Lin, Antigoni Polychroniadou, Stefano Tessaro:
LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking. ASIACRYPT (1) 2023: 302-334 - [c41]Ivan Damgård, Daniel Escudero, Antigoni Polychroniadou:
Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. ITC 2023: 7:1-7:21 - [c40]Alexander Bienstock, Daniel Escudero, Antigoni Polychroniadou:
On Linear Communication Complexity for (Maximally) Fluid MPC. CRYPTO (1) 2023: 263-294 - [c39]Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, Yifan Song, Chenkai Weng:
SuperPack: Dishonest Majority MPC with Constant Online Communication. EUROCRYPT (2) 2023: 220-250 - [c38]Yiping Ma, Jess Woods, Sebastian Angel, Antigoni Polychroniadou, Tal Rabin:
Flamingo: Multi-Round Single-Server Secure Aggregation with Applications to Private Federated Learning. SP 2023: 477-496 - [c37]Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso:
Prime Match: A Privacy-Preserving Inventory Matching System. USENIX Security Symposium 2023: 6417-6434 - [i39]Yiping Ma, Jess Woods, Sebastian Angel, Antigoni Polychroniadou, Tal Rabin:
Flamingo: Multi-Round Single-Server Secure Aggregation with Applications to Private Federated Learning. CoRR abs/2308.09883 (2023) - [i38]Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso:
Prime Match: A Privacy-Preserving Inventory Matching System. CoRR abs/2310.09621 (2023) - [i37]Zachary McBride Lazri, Ivan Brugere, Xin Tian, Dana Dachman-Soled, Antigoni Polychroniadou, Danial Dervovic, Min Wu:
A Canonical Data Transformation for Achieving Inter- and Within-group Fairness. CoRR abs/2310.15097 (2023) - [i36]Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, Yifan Song, Chenkai Weng:
SUPERPACK: Dishonest Majority MPC with Constant Online Communication. IACR Cryptol. ePrint Arch. 2023: 307 (2023) - [i35]Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso:
Prime Match: A Privacy-Preserving Inventory Matching System. IACR Cryptol. ePrint Arch. 2023: 400 (2023) - [i34]Yiping Ma, Jess Woods, Sebastian Angel, Antigoni Polychroniadou, Tal Rabin:
Flamingo: Multi-Round Single-Server Secure Aggregation with Applications to Private Federated Learning. IACR Cryptol. ePrint Arch. 2023: 486 (2023) - [i33]Alexander Bienstock, Daniel Escudero, Antigoni Polychroniadou:
On Linear Communication Complexity for (Maximally) Fluid MPC. IACR Cryptol. ePrint Arch. 2023: 839 (2023) - [i32]Sahar Mazloom, Benjamin E. Diamond, Antigoni Polychroniadou, Tucker Balch:
An Efficient Data-Independent Priority Queue and its Application to Dark Pools. IACR Cryptol. ePrint Arch. 2023: 1014 (2023) - [i31]Hanjun Li, Huijia Lin, Antigoni Polychroniadou, Stefano Tessaro:
LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking. IACR Cryptol. ePrint Arch. 2023: 1936 (2023) - [i30]Yue Guo, Harish Karthikeyan, Antigoni Polychroniadou:
PriDe CT: Towards Public Consensus, Private Transactions, and Forward Secrecy in Decentralized Payments. IACR Cryptol. ePrint Arch. 2023: 1948 (2023) - 2022
- [c36]Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, Yifan Song:
TurboPack: Honest Majority MPC with Constant Online Communication. CCS 2022: 951-964 - [c35]Vipul Goyal, Antigoni Polychroniadou, Yifan Song:
Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing. CRYPTO (4) 2022: 3-32 - [c34]Leo de Castro, Antigoni Polychroniadou:
Lightweight, Maliciously Secure Verifiable Function Secret Sharing. EUROCRYPT (1) 2022: 150-179 - [c33]Mariana Botelho da Gama, John Cartlidge, Antigoni Polychroniadou, Nigel P. Smart, Younes Talibi Alaoui:
Kicking-the-Bucket: Fast Privacy-Preserving Trading Using Buckets. Financial Cryptography 2022: 20-37 - [c32]David Byrd, Vaikkunth Mugunthan, Antigoni Polychroniadou, Tucker Balch:
Collusion Resistant Federated Learning with Oblivious Distributed Differential Privacy. ICAIF 2022: 114-122 - [c31]Sahar Mazloom, Antigoni Polychroniadou, Tucker Balch:
Addressing Extreme Market Responses Using Secure Aggregation. ICAIF 2022: 192-198 - [c30]Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, Antigoni Polychroniadou:
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares. SCN 2022: 516-539 - [i29]Farzam Toudeh-Fallah, Marco Pistoia, Yasushi Kawakura, Navid Moazzami, David H. Kramer, Robert I. Woodward, Greg Sysak, Benny John, Omar Amer, Antigoni Polychroniadou, Jeffrey Lyon, Suresh Shetty, Tulasi D. Movva, Sudhir Upadhyay, Monik Raj Behera, Joseph A. Dolphin, Paul Anthony Haigh, James F. Dynes, Andrew J. Shields:
Paving the Way towards 800 Gbps Quantum-Secured Optical Channel Deployment in Mission-Critical Environments. CoRR abs/2202.07764 (2022) - [i28]David Byrd, Vaikkunth Mugunthan, Antigoni Polychroniadou, Tucker Hybinette Balch:
Collusion Resistant Federated Learning with Oblivious Distributed Differential Privacy. CoRR abs/2202.09897 (2022) - [i27]Yue Guo, Antigoni Polychroniadou, Elaine Shi, David Byrd, Tucker Balch:
MicroFedML: Privacy Preserving Federated Learning for Small Weights. IACR Cryptol. ePrint Arch. 2022: 714 (2022) - [i26]Vipul Goyal, Antigoni Polychroniadou, Yifan Song:
Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing. IACR Cryptol. ePrint Arch. 2022: 831 (2022) - [i25]Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, Yifan Song:
TurboPack: Honest Majority MPC with Constant Online Communication. IACR Cryptol. ePrint Arch. 2022: 1316 (2022) - 2021
- [j1]Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Secure Multi-party Computation. J. Cryptol. 34(3): 19 (2021) - [c29]Xiaoqi Duan, Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ACCO: Algebraic Computation with Comparison. CCSW 2021: 21-38 - [c28]Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. CRYPTO (2) 2021: 244-274 - [c27]Vipul Goyal, Antigoni Polychroniadou, Yifan Song:
Unconditional Communication-Efficient MPC via Hall's Marriage Theorem. CRYPTO (2) 2021: 275-304 - [c26]Antigoni Polychroniadou, Yifan Song:
Constant-Overhead Unconditionally Secure Multiparty Computation Over Binary Fields. EUROCRYPT (2) 2021: 812-841 - [c25]Gilad Asharov, Tucker Balch, Antigoni Polychroniadou:
Privacy-preserving portfolio pricing. ICAIF 2021: 35:1-35:8 - [i24]Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, Antigoni Polychroniadou:
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares. IACR Cryptol. ePrint Arch. 2021: 576 (2021) - [i23]Leo de Castro, Antigoni Polychroniadou:
Lightweight, Verifiable Function Secret Sharing and its Applications. IACR Cryptol. ePrint Arch. 2021: 580 (2021) - [i22]Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. IACR Cryptol. ePrint Arch. 2021: 833 (2021) - [i21]Vipul Goyal, Antigoni Polychroniadou, Yifan Song:
Unconditional Communication-Efficient MPC via Hall's Marriage Theorem. IACR Cryptol. ePrint Arch. 2021: 834 (2021) - [i20]Ivan Damgård, Daniel Escudero, Antigoni Polychroniadou:
Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. IACR Cryptol. ePrint Arch. 2021: 1376 (2021) - [i19]Mariana Botelho da Gama, John Cartlidge, Antigoni Polychroniadou, Nigel P. Smart, Younes Talibi Alaoui:
Kicking-the-Bucket: Fast Privacy-Preserving Trading Using Buckets. IACR Cryptol. ePrint Arch. 2021: 1549 (2021) - 2020
- [c24]Gilad Asharov, Tucker Hybinette Balch, Antigoni Polychroniadou, Manuela Veloso:
Privacy-Preserving Dark Pools. AAMAS 2020: 1747-1749 - [c23]Andrew Morgan, Rafael Pass, Antigoni Polychroniadou:
Succinct Non-interactive Secure Computation. EUROCRYPT (2) 2020: 216-245 - [c22]Tucker Balch, Benjamin E. Diamond, Antigoni Polychroniadou:
SecretMatch: inventory matching from fully homomorphic encryption. ICAIF 2020: 15:1-15:7 - [c21]David Byrd, Antigoni Polychroniadou:
Differentially private secure multi-party computation for federated learning in financial applications. ICAIF 2020: 16:1-16:9 - [c20]Leo de Castro, Jiahao Chen, Antigoni Polychroniadou:
CryptoCredit: securely training fair models. ICAIF 2020: 17:1-17:8 - [c19]T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi:
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. SODA 2020: 2349-2365 - [i18]Leo de Castro, Jiahao Chen, Antigoni Polychroniadou:
CryptoCredit: Securely Training Fair Models. CoRR abs/2010.04840 (2020) - [i17]David Byrd, Antigoni Polychroniadou:
Differentially Private Secure Multi-Party Computation for Federated Learning in Financial Applications. CoRR abs/2010.05867 (2020) - [i16]Antigoni Polychroniadou, Yifan Song:
Constant-Overhead Unconditionally Secure Multiparty Computation over Binary Fields. IACR Cryptol. ePrint Arch. 2020: 1412 (2020)
2010 – 2019
- 2019
- [i15]T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi:
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. CoRR abs/1910.12175 (2019) - [i14]Andrew Morgan, Rafael Pass, Antigoni Polychroniadou:
Succinct Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2019: 1341 (2019) - 2018
- [c18]T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi:
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting. ASIACRYPT (3) 2018: 158-188 - [c17]Elette Boyle, Yuval Ishai, Antigoni Polychroniadou:
Limits of Practical Sublinear Secure Computation. CRYPTO (3) 2018: 302-332 - [c16]Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Secure Multi-Party Computation. CRYPTO (2) 2018: 488-520 - [c15]Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. TCC (1) 2018: 175-205 - [i13]T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi:
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. CoRR abs/1809.00825 (2018) - [i12]Elette Boyle, Yuval Ishai, Antigoni Polychroniadou:
Limits of Practical Sublinear Secure Computation. IACR Cryptol. ePrint Arch. 2018: 571 (2018) - [i11]T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi:
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. IACR Cryptol. ePrint Arch. 2018: 851 (2018) - 2017
- [c14]Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Antigoni Polychroniadou:
Laconic Oblivious Transfer and Its Applications. CRYPTO (2) 2017: 33-65 - [c13]Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. Public Key Cryptography (2) 2017: 428-460 - [c12]Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou:
Four Round Secure Computation Without Setup. TCC (1) 2017: 645-677 - [i10]Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. IACR Cryptol. ePrint Arch. 2017: 26 (2017) - [i9]Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou:
Four Round Secure Computation without Setup. IACR Cryptol. ePrint Arch. 2017: 386 (2017) - [i8]Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Antigoni Polychroniadou:
Laconic Oblivious Transfer and its Applications. IACR Cryptol. ePrint Arch. 2017: 491 (2017) - [i7]Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2017: 1056 (2017) - 2016
- [c11]Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael A. Raskin:
On the Communication Required for Unconditionally Secure Multiplication. CRYPTO (2) 2016: 459-488 - [c10]Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou:
The Exact Round Complexity of Secure Computation. EUROCRYPT (2) 2016: 448-476 - [c9]Ivan Damgård, Antigoni Polychroniadou, Vanishree Rao:
Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE). Public Key Cryptography (2) 2016: 208-233 - [c8]Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. TCC (B1) 2016: 367-399 - [i6]Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou:
The Exact Round Complexity of Secure Computation. IACR Cryptol. ePrint Arch. 2016: 252 (2016) - 2015
- [c7]Daniel Genkin, Yuval Ishai, Antigoni Polychroniadou:
Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits. CRYPTO (2) 2015: 721-741 - [c6]Marcin Andrychowicz, Ivan Damgård, Stefan Dziembowski, Sebastian Faust, Antigoni Polychroniadou:
Efficient Leakage Resilient Circuit Compilers. CT-RSA 2015: 311-329 - [c5]Sanjam Garg, Antigoni Polychroniadou:
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation. TCC (2) 2015: 614-637 - [i5]Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Token-Based Secure Computation. IACR Cryptol. ePrint Arch. 2015: 887 (2015) - [i4]Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou:
On the Communication required for Unconditionally Secure Multiplication. IACR Cryptol. ePrint Arch. 2015: 1097 (2015) - 2014
- [i3]Ivan Damgård, Antigoni Polychroniadou, Vanishree Rao:
Adaptively Secure UC Constant Round Multi-Party Computation Protocols. IACR Cryptol. ePrint Arch. 2014: 830 (2014) - [i2]Sanjam Garg, Antigoni Polychroniadou:
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 844 (2014) - 2012
- [c4]Kenneth G. Paterson, Antigoni Polychroniadou, Dale L. Sibborn:
A Coding-Theoretic Approach to Recovering Noisy RSA Keys. ASIACRYPT 2012: 386-403 - [c3]Antigoni Polychroniadou, Konstantinos Chalkias, George Stephanides:
The Concept of Compatibility between Identity-based and Certificateless Encryption Schemes. SECRYPT 2012: 403-407 - [c2]Tryfon Theodorou, George E. Violettas, Antigoni Polychroniadou, Christos K. Georgiadis:
Improved NetArgus - A Suite of Wi-fi Positioning & SNMP Monitor. SIGMAP 2012: 289-294 - [c1]Antigoni Polychroniadou, Konstantinos Chalkias, George Stephanides:
A Compatible Implementation between Identity-based and Certificateless Encryption Schemes. WEBIST 2012: 225-230 - [i1]Kenneth G. Paterson, Antigoni Polychroniadou, Dale L. Sibborn:
A Coding-Theoretic Approach to Recovering Noisy RSA Keys. IACR Cryptol. ePrint Arch. 2012: 724 (2012)
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-07 21:24 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:
