


default search action
Ramji Venkataramanan
Person information
- affiliation: University of Cambridge, Department of Engineering, UK
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Nelvin Tan, Pablo Pascual Cobo, Jonathan Scarlett, Ramji Venkataramanan
:
Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing. SIAM J. Math. Data Sci. 6(4): 1027-1054 (2024) - [j28]Pablo Pascual Cobo
, Kuan Hsieh
, Ramji Venkataramanan
:
Bayes-Optimal Estimation in Generalized Linear Models via Spatial Coupling. IEEE Trans. Inf. Theory 70(11): 8343-8363 (2024) - [c42]Yihan Zhang, Hong Chang Ji, Ramji Venkataramanan, Marco Mondelli:
Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing (Extended Abstract). COLT 2024: 5224-5230 - [c41]Gabriel Arpino, Xiaoqi Liu, Ramji Venkataramanan:
Inferring Change Points in High-Dimensional Linear Regression via Approximate Message Passing. ICML 2024 - [c40]Xiaoqi Liu, Kuan Hsieh, Ramji Venkataramanan:
Coded Many-User Multiple Access via Approximate Message Passing. ISIT 2024: 2987-2992 - [c39]Xiaoqi Liu, Pablo Pascual Cobo, Ramji Venkataramanan:
Many-user multiple access with random user activity. ISIT 2024: 2993-2998 - [i44]Xiaoqi Liu, Kuan Hsieh, Ramji Venkataramanan:
Coded Many-User Multiple Access via Approximate Message Passing. CoRR abs/2402.05625 (2024) - [i43]Gabriel Arpino, Xiaoqi Liu, Ramji Venkataramanan:
Inferring Change Points in High-Dimensional Linear Regression via Approximate Message Passing. CoRR abs/2404.07864 (2024) - [i42]Nelvin Tan, Pablo Pascual Cobo, Ramji Venkataramanan:
Quantitative Group Testing and Pooled Data in the Linear Regime with Sublinear Tests. CoRR abs/2408.00385 (2024) - [i41]Xiaoqi Liu, Pablo Pascual Cobo, Ramji Venkataramanan:
Many-User Multiple Access with Random User Activity: Achievability Bounds and Efficient Schemes. CoRR abs/2412.01511 (2024) - 2023
- [j27]Nelvin Tan, Ramji Venkataramanan:
Mixed Regression via Approximate Message Passing. J. Mach. Learn. Res. 24: 317:1-317:44 (2023) - [j26]Xiaoqi Liu
, Ramji Venkataramanan
:
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing. IEEE Trans. Inf. Theory 69(9): 6071-6097 (2023) - [c38]Nelvin Tan, Ramji Venkataramanan:
Mixed Linear Regression via Approximate Message Passing. AISTATS 2023: 2116-2131 - [c37]Gabriel Arpino, Ramji Venkataramanan:
Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression. COLT 2023: 921-986 - [c36]Pablo Pascual Cobo, Kuan Hsieh, Ramji Venkataramanan:
Bayes-Optimal Estimation in Generalized Linear Models via Spatial Coupling. ISIT 2023: 773-778 - [i40]Gabriel Arpino, Ramji Venkataramanan:
Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression. CoRR abs/2303.02118 (2023) - [i39]Nelvin Tan, Ramji Venkataramanan:
Mixed Regression via Approximate Message Passing. CoRR abs/2304.02229 (2023) - [i38]Yihan Zhang, Hong Chang Ji, Ramji Venkataramanan, Marco Mondelli:
Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing. CoRR abs/2308.14507 (2023) - [i37]Pablo Pascual Cobo, Kuan Hsieh, Ramji Venkataramanan:
Bayes-Optimal Estimation in Generalized Linear Models via Spatial Coupling. CoRR abs/2309.08404 (2023) - [i36]Nelvin Tan, Jonathan Scarlett, Ramji Venkataramanan:
Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing. CoRR abs/2309.15507 (2023) - 2022
- [j25]Marco Mondelli, Christos Thrampoulidis, Ramji Venkataramanan:
Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models. Found. Comput. Math. 22(5): 1513-1566 (2022) - [j24]Oliver Y. Feng
, Ramji Venkataramanan, Cynthia Rush
, Richard J. Samworth:
A Unifying Tutorial on Approximate Message Passing. Found. Trends Mach. Learn. 15(4): 335-536 (2022) - [j23]Kuan Hsieh
, Cynthia Rush, Ramji Venkataramanan
:
Near-Optimal Coding for Many-User Multiple Access Channels. IEEE J. Sel. Areas Inf. Theory 3(1): 21-36 (2022) - [c35]Ramji Venkataramanan, Kevin Kögler, Marco Mondelli:
Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passing. ICML 2022: 22120-22144 - [c34]Xiaoqi Liu, Ramji Venkataramanan:
Sketching sparse low-rank matrices with near-optimal sample- and time-complexity. ISIT 2022: 3138-3143 - [i35]Xiaoqi Liu, Ramji Venkataramanan:
Sketching sparse low-rank matrices with near-optimal sample- and time-complexity. CoRR abs/2205.06228 (2022) - [i34]Yihan Zhang, Marco Mondelli, Ramji Venkataramanan:
Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models. CoRR abs/2211.11368 (2022) - 2021
- [j22]Mahed Abroshan
, Ramji Venkataramanan
, Albert Guillén i Fàbregas
:
Multilayer Codes for Synchronization From Deletions and Insertions. IEEE Trans. Inf. Theory 67(6): 3342-3359 (2021) - [j21]Kuan Hsieh
, Ramji Venkataramanan
:
Modulated Sparse Superposition Codes for the Complex AWGN Channel. IEEE Trans. Inf. Theory 67(7): 4385-4404 (2021) - [j20]Cynthia Rush
, Kuan Hsieh
, Ramji Venkataramanan
:
Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding. IEEE Trans. Inf. Theory 67(7): 4446-4484 (2021) - [c33]Marco Mondelli, Ramji Venkataramanan:
Approximate Message Passing with Spectral Initialization for Generalized Linear Models. AISTATS 2021: 397-405 - [c32]Kuan Hsieh, Cynthia Rush, Ramji Venkataramanan:
Near-Optimal Coding for Massive Multiple Access. ISIT 2021: 2471-2476 - [c31]Marco Mondelli, Ramji Venkataramanan:
PCA Initialization for Approximate Message Passing in Rotationally Invariant Models. NeurIPS 2021: 29616-29629 - [i33]Kuan Hsieh, Cynthia Rush, Ramji Venkataramanan:
Near-Optimal Coding for Massive Multiple Access. CoRR abs/2102.04730 (2021) - [i32]Oliver Y. Feng, Ramji Venkataramanan, Cynthia Rush, Richard J. Samworth:
A unifying tutorial on Approximate Message Passing. CoRR abs/2105.02180 (2021) - [i31]Marco Mondelli, Ramji Venkataramanan:
PCA Initialization for Approximate Message Passing in Rotationally Invariant Models. CoRR abs/2106.02356 (2021) - [i30]Ramji Venkataramanan, Kevin Kögler, Marco Mondelli:
Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passing. CoRR abs/2112.04330 (2021) - 2020
- [c30]Kuan Hsieh, Ramji Venkataramanan:
Modulated Sparse Regression Codes. ISIT 2020: 1432-1437 - [i29]Cynthia Rush, Kuan Hsieh, Ramji Venkataramanan:
Capacity-achieving Spatially Coupled Sparse Superposition Codes with AMP Decoding. CoRR abs/2002.07844 (2020) - [i28]Kuan Hsieh, Ramji Venkataramanan:
Modulated Sparse Superposition Codes for the Complex AWGN Channel. CoRR abs/2004.09549 (2020) - [i27]Marco Mondelli, Christos Thrampoulidis, Ramji Venkataramanan:
Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models. CoRR abs/2008.03326 (2020) - [i26]Marco Mondelli, Ramji Venkataramanan:
Approximate Message Passing with Spectral Initialization for Generalized Linear Models. CoRR abs/2010.03460 (2020)
2010 – 2019
- 2019
- [j19]Ramji Venkataramanan, Sekhar Tatikonda, Andrew R. Barron:
Sparse Regression Codes. Found. Trends Commun. Inf. Theory 15(1-2): 1-195 (2019) - [j18]Cynthia Rush
, Ramji Venkataramanan
:
The Error Probability of Sparse Superposition Codes With Approximate Message Passing Decoding. IEEE Trans. Inf. Theory 65(5): 3278-3303 (2019) - [c29]Mohsen Heidari, S. Sandeep Pradhan, Ramji Venkataramanan:
Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity. ISIT 2019: 1192-1196 - [c28]Mahed Abroshan, Ramji Venkataramanan, Lara Dolecek, Albert Guillén i Fàbregas:
Coding for Deletion Channels with Multiple Traces. ISIT 2019: 1372-1376 - [c27]Cynthia Rush, Kuan Hsieh, Ramji Venkataramanan:
Spatially Coupled Sparse Regression Codes with Sliding Window AMP Decoding. ITW 2019: 1-5 - [i25]Mohsen Heidari, S. Sandeep Pradhan, Ramji Venkataramanan:
Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity. CoRR abs/1901.10576 (2019) - [i24]Mahed Abroshan, Ramji Venkataramanan, Lara Dolecek, Albert Guillén i Fàbregas:
Coding for Deletion Channels with Multiple Traces. CoRR abs/1905.08197 (2019) - [i23]Ramji Venkataramanan, Sekhar Tatikonda, Andrew R. Barron:
Sparse Regression Codes. CoRR abs/1911.00771 (2019) - 2018
- [j17]Adam Greig
, Ramji Venkataramanan
:
Techniques for Improving the Finite Length Performance of Sparse Superposition Codes. IEEE Trans. Commun. 66(3): 905-917 (2018) - [j16]K. Pavan Srinath
, Ramji Venkataramanan
:
Cluster-Seeking James-Stein Estimators. IEEE Trans. Inf. Theory 64(2): 853-874 (2018) - [j15]Mahed Abroshan
, Ramji Venkataramanan
, Albert Guillen i Fabregas
:
Coding for Segmented Edit Channels. IEEE Trans. Inf. Theory 64(4): 3086-3098 (2018) - [j14]Cynthia Rush
, Ramji Venkataramanan
:
Finite Sample Analysis of Approximate Message Passing Algorithms. IEEE Trans. Inf. Theory 64(11): 7264-7286 (2018) - [c26]Mahed Abroshan, Ramji Venkataramanan, Albert Guillén i Fàbregas:
Efficient Systematic Encoding of Non-binary VT Codes. ISIT 2018: 91-95 - [c25]K. Pavan Srinath, Ramji Venkataramanan:
Empirical Bayes Estimators for Sparse Sequences. ISIT 2018: 406-410 - [c24]Kuan Hsieh, Cynthia Rush
, Ramji Venkataramanan:
Spatially Coupled Sparse Regression Codes: Design and State Evolution Analysis. ISIT 2018: 1016-1020 - [c23]Cynthia Rush, Kuan Hsieh, Ramji Venkataramanan:
Capacity-achieving sparse regression codes via spatial coupling. ITW 2018: 1-5 - [i22]Kuan Hsieh, Cynthia Rush, Ramji Venkataramanan:
Spatially Coupled Sparse Regression Codes: Design and State Evolution Analysis. CoRR abs/1801.01796 (2018) - 2017
- [j13]Cynthia Rush
, Adam Greig
, Ramji Venkataramanan
:
Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding. IEEE Trans. Inf. Theory 63(3): 1476-1500 (2017) - [j12]Ramji Venkataramanan
, Sekhar Tatikonda:
The Rate-Distortion Function and Excess-Distortion Exponent of Sparse Regression Codes With Optimal Encoding. IEEE Trans. Inf. Theory 63(8): 5228-5243 (2017) - [c22]Mahed Abroshan, Ramji Venkataramanan, Albert Guillen i Fabregas:
Codes for channels with segmented edits. ISIT 2017: 1768-1772 - [c21]Cynthia Rush
, Ramji Venkataramanan:
The error exponent of sparse regression codes with AMP decoding. ISIT 2017: 2478-2482 - [c20]Mahed Abroshan, Ramji Venkataramanan, Albert Guillen i Fabregas:
Multilayer codes for synchronization from deletions. ITW 2017: 449-453 - [i21]Mahed Abroshan, Ramji Venkataramanan, Albert Guillen i Fabregas:
Codes for Channels With Segmented Edits. CoRR abs/1701.06341 (2017) - [i20]Adam Greig, Ramji Venkataramanan:
Optimizing the Finite Length Performance of Sparse Superposition Codes. CoRR abs/1705.02091 (2017) - [i19]Mahed Abroshan, Ramji Venkataramanan, Albert Guillen i Fabregas:
Multilayer Codes for Synchronization from Deletions. CoRR abs/1705.06670 (2017) - [i18]Ramji Venkataramanan, Oliver Johnson:
Strong converse bounds for high-dimensional estimation. CoRR abs/1706.04410 (2017) - [i17]Koteshwar Pavan Srinath, Ramji Venkataramanan:
Empirical Bayes Estimators for High-Dimensional Sparse Vectors. CoRR abs/1707.09161 (2017) - [i16]Mahed Abroshan, Ramji Venkataramanan, Albert Guillen i Fabregas:
Efficient Systematic Encoding of Non-binary VT Codes. CoRR abs/1708.04071 (2017) - [i15]Cynthia Rush, Ramji Venkataramanan:
The Error Probability of Sparse Superposition Codes with Approximate Message Passing Decoding. CoRR abs/1712.06866 (2017) - 2016
- [c19]Cynthia Rush
, Ramji Venkataramanan:
Finite-sample analysis of Approximate Message Passing. ISIT 2016: 755-759 - [c18]K. Pavan Srinath, Ramji Venkataramanan:
Cluster-seeking shrinkage estimators. ISIT 2016: 845-849 - [i14]K. Pavan Srinath, Ramji Venkataramanan:
Cluster-Seeking James-Stein Estimators. CoRR abs/1602.00542 (2016) - [i13]Cynthia Rush, Ramji Venkataramanan:
Finite Sample Analysis of Approximate Message Passing. CoRR abs/1606.01800 (2016) - 2015
- [j11]Ramji Venkataramanan, Vasuki Narasimha Swamy, Kannan Ramchandran:
Low-Complexity Interactive Algorithms for Synchronization From Deletions, Insertions, and Substitutions. IEEE Trans. Inf. Theory 61(10): 5670-5689 (2015) - [c17]Cynthia Rush
, Adam Greig, Ramji Venkataramanan:
Capacity-achieving Sparse Regression Codes via approximate message passing decoding. ISIT 2015: 2016-2020 - [i12]Cynthia Rush, Adam Greig, Ramji Venkataramanan:
Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding. CoRR abs/1501.05892 (2015) - 2014
- [j10]Ramji Venkataramanan, Sekhar Tatikonda, Luis Lastras-Monta, Michele Franceschini:
Rewritable Storage Channels with Hidden State. IEEE J. Sel. Areas Commun. 32(5): 815-824 (2014) - [j9]Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Lossy Compression via Sparse Linear Regression: Performance Under Minimum-Distance Encoding. IEEE Trans. Inf. Theory 60(6): 3254-3264 (2014) - [j8]Ramji Venkataramanan, Tuhin Sarkar, Sekhar Tatikonda:
Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding. IEEE Trans. Inf. Theory 60(6): 3265-3278 (2014) - [c16]Ramji Venkataramanan, Sekhar Tatikonda:
The Gaussian rate-distortion function of sparse regression codes with optimal encoding. ISIT 2014: 2844-2848 - [i11]Ramji Venkataramanan, Sekhar Tatikonda:
The Gaussian Rate-Distortion Function of Sparse Regression Codes with Optimal Encoding. CoRR abs/1401.5272 (2014) - 2013
- [j7]Ramji Venkataramanan, S. Sandeep Pradhan:
An Achievable Rate Region for the Broadcast Channel With Feedback. IEEE Trans. Inf. Theory 59(10): 6175-6191 (2013) - [j6]Ramji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran:
Achievable Rates for Channels With Deletions and Insertions. IEEE Trans. Inf. Theory 59(11): 6990-7013 (2013) - [c15]Ramji Venkataramanan, Vasuki Narasimha Swamy, Kannan Ramchandran:
Efficient interactive algorithms for file synchronization under general edits. Allerton 2013: 1226-1233 - [c14]Ramji Venkataramanan, Tuhin Sarkar, Sekhar Tatikonda:
Lossy compression via sparse linear regression: Computationally efficient encoding and decoding. ISIT 2013: 1182-1186 - [c13]Ramji Venkataramanan, Sekhar Tatikonda:
Sparse Regression codes: Recent results and future directions. ITW 2013: 1-5 - [c12]Ramji Venkataramanan, Sekhar Tatikonda:
Improved capacity lower bounds for channels with deletions and insertions. ITW 2013: 1-5 - [i10]Ramji Venkataramanan, Vasuki Narasimha Swamy, Kannan Ramchandran:
Efficient Interactive Algorithms for File Synchronization under General Edits. CoRR abs/1310.2026 (2013) - 2012
- [c11]Ramji Venkataramanan, Sekhar Tatikonda:
Sparse regression codes for multi-terminal source and channel coding. Allerton Conference 2012: 1966-1974 - [c10]Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Gaussian rate-distortion via sparse linear regression over compact dictionaries. ISIT 2012: 368-372 - [c9]Ramji Venkataramanan, Sekhar Tatikonda, Luis Alfonso Lastras-Montaño, Michele Franceschini:
Coding strategies for the uniform noise rewritable channel with hidden state. ISIT 2012: 1005-1009 - [i9]Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Gaussian Rate-Distortion via Sparse Regression over Compact Dictionaries. CoRR abs/1202.0840 (2012) - [i8]Ramji Venkataramanan, Sekhar Tatikonda, Luis A. Lastras, Michele Franceschini:
Coding strategies for the uniform noise rewritable channel with hidden state. CoRR abs/1206.2491 (2012) - [i7]Ramji Venkataramanan, Tuhin Sarkar, Sekhar Tatikonda:
Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding. CoRR abs/1212.1707 (2012) - [i6]Ramji Venkataramanan, Sekhar Tatikonda:
Sparse Regression Codes for Multi-terminal Source and Channel Coding. CoRR abs/1212.2125 (2012) - 2011
- [j5]Ramji Venkataramanan, S. Sandeep Pradhan:
Achievable Rates for Multiple Descriptions With Feed-Forward. IEEE Trans. Inf. Theory 57(4): 2270-2277 (2011) - [j4]Ramji Venkataramanan, S. Sandeep Pradhan:
A New Achievable Rate Region for the Multiple-Access Channel With Noiseless Feedback. IEEE Trans. Inf. Theory 57(12): 8038-8054 (2011) - [c8]Ramji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran:
Achievable rates for channels with deletions and insertions. ISIT 2011: 346-350 - [i5]Ramji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran:
Achievable Rates for Channels with Deletions and Insertions. CoRR abs/1102.5112 (2011) - [i4]Ramji Venkataramanan, S. Sandeep Pradhan:
An Achievable Rate Region for the Broadcast Channel with Feedback. CoRR abs/1105.2311 (2011) - 2010
- [j3]Ramji Venkataramanan, S. Sandeep Pradhan:
On Computing the Feedback Capacity of Channels and the Feed-Forward Rate-Distortion Function of Sources. IEEE Trans. Commun. 58(7): 1889-1896 (2010) - [c7]Ramji Venkataramanan, Hao Zhang, Kannan Ramchandran:
Interactive low-complexity codes for synchronization from deletions and insertions. Allerton 2010: 1412-1419 - [c6]Ramji Venkataramanan, S. Sandeep Pradhan:
Achievable rates for the broadcast channel with feedback. ISIT 2010: 455-459 - [c5]Ali Nazari
, Dinesh Krithivasan, S. Sandeep Pradhan, Achilleas Anastasopoulos, Ramji Venkataramanan:
Typicality graphs and their properties. ISIT 2010: 520-524 - [i3]Ali Nazari, Ramji Venkataramanan, Dinesh Krithivasan, S. Sandeep Pradhan, Achilleas Anastasopoulos:
Typicality Graphs:Large Deviation Analysis. CoRR abs/1010.1317 (2010)
2000 – 2009
- 2009
- [c4]Ramji Venkataramanan, S. Sandeep Pradhan:
A new achievable rate region for the discrete memoryless multiple-access channel with feedback. ISIT 2009: 2371-2375 - [i2]Ramji Venkataramanan, S. Sandeep Pradhan:
A New Achievable Rate Region for the Discrete Memoryless Multiple-Access Channel with Feedback. CoRR abs/0901.1892 (2009) - 2008
- [c3]Ramji Venkataramanan, S. Sandeep Pradhan:
Multiple descriptions with feed-forward: A single-letter achievable rate region. ISIT 2008: 692-696 - 2007
- [j2]Ramji Venkataramanan, S. Sandeep Pradhan:
Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source. IEEE Trans. Inf. Theory 53(6): 2154-2179 (2007) - [c2]Ramji Venkataramanan, S. Sandeep Pradhan:
On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback. ISIT 2007: 401-405 - [i1]Ramji Venkataramanan, S. Sandeep Pradhan:
On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback. CoRR abs/cs/0702009 (2007) - 2006
- [j1]Ramji Venkataramanan, K. M. M. Prabhu:
Estimation of frequency offset using warped discrete-Fourier transform. Signal Process. 86(2): 250-256 (2006) - 2004
- [c1]Ramji Venkataramanan, S. Sandeep Pradhan:
Source coding with feed-forward. ITW 2004: 330-335
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-23 21:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint