default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSekhar Tatikonda
Sekhar Chandra Tatikonda
Person information
- affiliation: Yale University, New Haven, CT, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c54]Juntang Zhuang, Boqing Gong, Liangzhe Yuan, Yin Cui, Hartwig Adam, Nicha C. Dvornek, Sekhar Tatikonda, James S. Duncan, Ting Liu:
Surrogate Gap Minimization Improves Sharpness-Aware Training. ICLR 2022- [i27]Juntang Zhuang, Boqing Gong, Liangzhe Yuan, Yin Cui, Hartwig Adam, Nicha C. Dvornek, Sekhar Tatikonda, James S. Duncan, Ting Liu:
Surrogate Gap Minimization Improves Sharpness-Aware Training. CoRR abs/2203.08065 (2022) - 2021
- [c53]Juntang Zhuang, Nicha C. Dvornek, Sekhar Tatikonda, James S. Duncan:
MALI: A memory efficient and reverse accurate integrator for Neural ODEs. ICLR 2021 - [c52]Juntang Zhuang
, Nicha C. Dvornek, Sekhar Tatikonda, Xenophon Papademetris, Pamela Ventola, James S. Duncan:
Multiple-Shooting Adjoint Method for Whole-Brain Dynamic Causal Modeling. IPMI 2021: 58-70 - [c51]Juntang Zhuang, Yifan Ding, Tommy Tang, Nicha C. Dvornek, Sekhar Tatikonda, James S. Duncan:
Momentum Centering and Asynchronous Update for Adaptive Gradient Methods. NeurIPS 2021: 28249-28260 - [i26]Juntang Zhuang, Nicha C. Dvornek, Sekhar Tatikonda, James S. Duncan:
MALI: A memory efficient and reverse accurate integrator for Neural ODEs. CoRR abs/2102.04668 (2021) - [i25]Juntang Zhuang, Nicha C. Dvornek, Sekhar Tatikonda, Xenophon Papademetris, Pamela Ventola, James S. Duncan:
Multiple-shooting adjoint method for whole-brain dynamic causal modeling. CoRR abs/2102.11013 (2021) - [i24]Juntang Zhuang, Yifan Ding, Tommy Tang, Nicha C. Dvornek, Sekhar Tatikonda, James S. Duncan:
Momentum Centering and Asynchronous Update for Adaptive Gradient Methods. CoRR abs/2110.05454 (2021) - 2020
- [j32]Photios A. Stavrou, Takashi Tanaka, Sekhar Tatikonda:
The Time-Invariant Multidimensional Gaussian Sequential Rate-Distortion Problem Revisited. IEEE Trans. Autom. Control. 65(5): 2245-2249 (2020) - [c50]Juntang Zhuang, Nicha C. Dvornek, Xiaoxiao Li, Sekhar Tatikonda, Xenophon Papademetris, James S. Duncan:
Adaptive Checkpoint Adjoint Method for Gradient Estimation in Neural ODE. ICML 2020: 11639-11649 - [c49]Juntang Zhuang, Tommy Tang, Yifan Ding, Sekhar Tatikonda, Nicha C. Dvornek, Xenophon Papademetris, James S. Duncan:
AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradients. NeurIPS 2020 - [i23]Juntang Zhuang, Nicha C. Dvornek, Xiaoxiao Li, Sekhar Tatikonda, Xenophon Papademetris, James S. Duncan:
Adaptive Checkpoint Adjoint Method for Gradient Estimation in Neural ODE. CoRR abs/2006.02493 (2020) - [i22]Juntang Zhuang, Tommy Tang, Yifan Ding, Sekhar Tatikonda, Nicha C. Dvornek, Xenophon Papademetris, James S. Duncan:
AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradients. CoRR abs/2010.07468 (2020)
2010 – 2019
- 2019
- [j31]Ramji Venkataramanan, Sekhar Tatikonda, Andrew R. Barron:
Sparse Regression Codes. Found. Trends Commun. Inf. Theory 15(1-2): 1-195 (2019) - [j30]Patrick Rebeschini, Sekhar Tatikonda:
A New Approach to Laplacian Solvers and Flow Problems. J. Mach. Learn. Res. 20: 36:1-36:37 (2019) - [j29]De Wen Soh, Sekhar Tatikonda:
Learning Unfaithful $K$-separable Gaussian Graphical Models. J. Mach. Learn. Res. 20: 109:1-109:30 (2019) - [j28]Patrick Rebeschini, Sekhar Tatikonda:
Locality in Network Optimization. IEEE Trans. Control. Netw. Syst. 6(2): 487-500 (2019) - [i21]Ramji Venkataramanan, Sekhar Tatikonda, Andrew R. Barron:
Sparse Regression Codes. CoRR abs/1911.00771 (2019) - 2018
- [i20]Javid Dadashkarimi, Sekhar Tatikonda:
Sequence to Logic with Copy and Cache. CoRR abs/1807.07333 (2018) - [i19]Javid Dadashkarimi, Alexander R. Fabbri, Sekhar Tatikonda, Dragomir R. Radev:
Zero-shot Transfer Learning for Semantic Parsing. CoRR abs/1808.09889 (2018) - 2017
- [j27]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) - [c48]Patrick Rebeschini, Sekhar Tatikonda:
Accelerated consensus via Min-Sum Splitting. NIPS 2017: 1374-1384 - [i18]Photios A. Stavrou, Takashi Tanaka, Sekhar Tatikonda:
The Time-Invariant Multidimensional Gaussian Sequential Rate-Distortion Problem Revisited. CoRR abs/1711.09853 (2017) - 2016
- [j26]Michael J. Kane, Bryan Lewis, Sekhar Tatikonda, Simon Urbanek:
Scatter matrix concordance as a diagnostic for regressions on subsets of data. Stat. Anal. Data Min. 9(4): 249-259 (2016) - [c47]Patrick Rebeschini, Sekhar Tatikonda:
Decay of correlation in network flow problems. CISS 2016: 169-174 - [i17]Patrick Rebeschini, Sekhar Tatikonda:
A new approach to Laplacian solvers and flow problems. CoRR abs/1611.07138 (2016) - 2015
- [j25]Aditya Mahajan, Sekhar Tatikonda:
An algorithmic approach to identify irrelevant information in sequential teams. Autom. 61: 178-191 (2015) - [j24]Jialing Liu, Nicola Elia, Sekhar Tatikonda:
Capacity-Achieving Feedback Schemes for Gaussian Finite-State Markov Channels With Channel State Information. IEEE Trans. Inf. Theory 61(7): 3632-3650 (2015) - 2014
- [j23]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) - [j22]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) - [j21]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) - [c46]Ramji Venkataramanan, Sekhar Tatikonda:
The Gaussian rate-distortion function of sparse regression codes with optimal encoding. ISIT 2014: 2844-2848 - [c45]De Wen Soh, Sekhar Tatikonda:
Testing Unfaithful Gaussian Graphical Models. NIPS 2014: 2681-2689 - [i16]Ramji Venkataramanan, Sekhar Tatikonda:
The Gaussian Rate-Distortion Function of Sparse Regression Codes with Optimal Encoding. CoRR abs/1401.5272 (2014) - 2013
- [j20]Nicholas Ruozzi, Sekhar Tatikonda:
Message-passing algorithms for quadratic minimization. J. Mach. Learn. Res. 14(1): 2287-2314 (2013) - [j19]Nicholas Ruozzi, Sekhar Tatikonda:
Message-Passing Algorithms: Reparameterizations and Splittings. IEEE Trans. Inf. Theory 59(9): 5860-5881 (2013) - [j18]Ramji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran:
Achievable Rates for Channels With Deletions and Insertions. IEEE Trans. Inf. Theory 59(11): 6990-7013 (2013) - [c44]Ramji Venkataramanan, Tuhin Sarkar, Sekhar Tatikonda:
Lossy compression via sparse linear regression: Computationally efficient encoding and decoding. ISIT 2013: 1182-1186 - [c43]Ramji Venkataramanan, Sekhar Tatikonda:
Sparse Regression codes: Recent results and future directions. ITW 2013: 1-5 - [c42]Ramji Venkataramanan, Sekhar Tatikonda:
Improved capacity lower bounds for channels with deletions and insertions. ITW 2013: 1-5 - [i15]Sekhar Tatikonda, Michael I. Jordan:
Loopy Belief Propogation and Gibbs Measures. CoRR abs/1301.0605 (2013) - 2012
- [j17]Aditya Mahajan, Sekhar Tatikonda:
Opportunistic Capacity and Error Exponent Region for the Compound Channel With Feedback. IEEE Trans. Inf. Theory 58(7): 4331-4341 (2012) - [c41]Ramji Venkataramanan, Sekhar Tatikonda:
Sparse regression codes for multi-terminal source and channel coding. Allerton Conference 2012: 1966-1974 - [c40]Ji Liu, Navid Hassanpour, Sekhar Tatikonda, A. Stephen Morse:
Dynamic threshold models of collective action in social networks. CDC 2012: 3991-3996 - [c39]Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Gaussian rate-distortion via sparse linear regression over compact dictionaries. ISIT 2012: 368-372 - [c38]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 - [i14]Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Gaussian Rate-Distortion via Sparse Regression over Compact Dictionaries. CoRR abs/1202.0840 (2012) - [i13]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) - [i12]Nicholas Ruozzi, Sekhar Tatikonda:
Message-Passing Algorithms for Quadratic Minimization. CoRR abs/1212.0171 (2012) - [i11]Ramji Venkataramanan, Tuhin Sarkar, Sekhar Tatikonda:
Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding. CoRR abs/1212.1707 (2012) - [i10]Ramji Venkataramanan, Sekhar Tatikonda:
Sparse Regression Codes for Multi-terminal Source and Channel Coding. CoRR abs/1212.2125 (2012) - 2011
- [j16]Steven Jaslar, Sekhar Tatikonda:
Maximum Weight Partial Colorings on Sparse Random Graphs. SIAM J. Discret. Math. 25(2): 934-955 (2011) - [j15]Jian Ni, Sekhar Tatikonda:
Network Tomography Based on Additive Metrics. IEEE Trans. Inf. Theory 57(12): 7798-7809 (2011) - [c37]Ramji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran:
Achievable rates for channels with deletions and insertions. ISIT 2011: 346-350 - [i9]Ramji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran:
Achievable Rates for Channels with Deletions and Insertions. CoRR abs/1102.5112 (2011) - [i8]John Hartigan, David Pollard, Sekhar Tatikonda:
Conditioned Poisson distributions and the concentration of chromatic numbers. CoRR abs/1107.3818 (2011) - 2010
- [j14]Jian Ni, Haiyong Xie, Sekhar Tatikonda, Yang Richard Yang:
Efficient and dynamic routing topology inference from end-to-end measurements. IEEE/ACM Trans. Netw. 18(1): 123-135 (2010) - [c36]Tung Le, Sekhar Tatikonda, Christoforos N. Hadjicostis:
Performance analysis of sum-product algorithms for multiple fault diagnosis applications. CDC 2010: 1627-1632 - [c35]Aditya Mahajan, Sekhar Tatikonda:
Opportunistic capacity and error exponent regions for variable length communication over compound channel with feedback. CISS 2010: 1-6 - [c34]Nicholas Ruozzi, Sekhar Tatikonda:
Unconstrained minimization of quadratic functions via min-sum. CISS 2010: 1-5 - [c33]Aditya Mahajan, Sekhar Tatikonda:
Opportunistic capacity and error exponent regions for compound channel with feedback. ISIT 2010: 236-240 - [c32]Nicholas Ruozzi, Sekhar Tatikonda:
Convergent and Correct Message Passing Schemes for Optimization Problems over Graphical Models. UAI 2010: 500 - [i7]Nicholas Ruozzi, Sekhar Tatikonda:
Convergent and Correct Message Passing Schemes for Optimization Problems over Graphical Models. CoRR abs/1002.3239 (2010)
2000 – 2009
- 2009
- [j13]Serdar Yüksel, Sekhar Tatikonda:
A Counterexample in Distributed Optimal Sensing and Control. IEEE Trans. Autom. Control. 54(4): 841-844 (2009) - [j12]Sekhar Tatikonda, Sanjoy K. Mitter:
The Capacity of Channels With Feedback. IEEE Trans. Inf. Theory 55(1): 323-349 (2009) - [j11]Giacomo Como, Serdar Yüksel, Sekhar Tatikonda:
The error exponent of variable-length codes over Markov channels with feedback. IEEE Trans. Inf. Theory 55(5): 2139-2160 (2009) - [c31]Aditya Mahajan, Sekhar Tatikonda:
Sequential team form and its simplification using graphical models. Allerton 2009: 330-339 - [c30]Aditya Mahajan, Sekhar Tatikonda:
A training based scheme for communicating over unknown channels with feedback. Allerton 2009: 1549-1553 - [c29]Nicholas Ruozzi, Justin Thaler, Sekhar Tatikonda:
Graph covers and quadratic minimization. Allerton 2009: 1590-1596 - [c28]Sekhar Tatikonda:
Clustering phenomena in message-passing schemes. ITW 2009: 10-12 - [c27]Aditya Mahajan, Sekhar Tatikonda:
A Graphical modeling approach to simplifying sequential teams. WiOpt 2009: 1-8 - [i6]Aditya Mahajan, Sekhar Tatikonda:
A training-based scheme for communicating over unknown channels with feedback. CoRR abs/0911.2023 (2009) - 2008
- [c26]Nicholas Ruozzi, Sekhar Tatikonda:
s-t paths using the min-sum algorithm. Allerton 2008: 918-921 - [c25]Steven Jaslar, Sekhar Tatikonda:
Convergence of optimal values past critical threshold. Allerton 2008: 945-951 - [c24]Jian Ni, Sekhar Tatikonda:
Network tomography based on additive metrics. CISS 2008: 1149-1154 - [c23]Jian Ni, Haiyong Xie, Sekhar Tatikonda, Yang Richard Yang:
Network Routing Topology Inference from End-to-End Measurements. INFOCOM 2008: 36-40 - [c22]Sekhar Tatikonda:
The structure of encoders for channels with feedback. ISIT 2008: 722-726 - [c21]Sekhar Tatikonda:
Cooperative control under communication constraints. ITW 2008: 243-246 - [i5]Jialing Liu, Nicola Elia, Sekhar Tatikonda:
Capacity-achieving Feedback Scheme for Gaussian Finite-State Markov Channels with Channel State Information. CoRR abs/0808.2089 (2008) - [i4]Jian Ni, Sekhar Tatikonda:
Network Tomography Based on Additive Metrics. CoRR abs/0809.0158 (2008) - 2007
- [j10]Jian Ni, Danny H. K. Tsang, Sekhar Tatikonda, Brahim Bensaou:
Optimal and Structured Call Admission Control Policies for Resource-Sharing Systems. IEEE Trans. Commun. 55(1): 158-170 (2007) - [j9]Jian Ni, Sekhar Tatikonda:
Analyzing Product-Form Stochastic Networks Via Factor Graphs and the Sum-Product Algorithm. IEEE Trans. Commun. 55(8): 1588-1597 (2007) - [j8]Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda:
On the Feedback Capacity of Power-Constrained Gaussian Noise Channels With Memory. IEEE Trans. Inf. Theory 53(3): 929-954 (2007) - [c20]Jian Ni, Sekhar Tatikonda:
Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm. INFOCOM 2007: 409-417 - [c19]Serdar Yüksel, Sekhar Tatikonda:
Capacity of Markov Channels with Partial State Feedback. ISIT 2007: 1861-1865 - [c18]Giacomo Como, Serdar Yüksel, Sekhar Tatikonda:
On the Burnashev exponent for Markov channels. ISIT 2007: 1871-1875 - [i3]Giacomo Como, Serdar Yüksel, Sekhar Tatikonda:
On the error exponent of variable-length block-coding schemes over finite-state Markov channels with feedback. CoRR abs/0707.2014 (2007) - [i2]Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda:
On the Feedback Capacity of Power Constrained Gaussian Noise Channels with Memory. CoRR abs/cs/0701099 (2007) - 2006
- [c17]Jian Ni, Sekhar Tatikonda, Edmund M. Yeh:
A Large-Scale Distributed Traffic Matrix Estimation Algorithm. GLOBECOM 2006 - [c16]Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda:
Feedback Capacity of Stationary Sources over Gaussian Intersymbol Interference Channels. GLOBECOM 2006 - [c15]Stephan Winkler, Sekhar Tatikonda, David Pollard:
Analysis of Max-Product via Local Maxifiers. ISIT 2006: 2689-2693 - [c14]Jian Ni, Sekhar Tatikonda:
A Markov Random Field Approach to Multicast-Based Network Inference Problems. ISIT 2006: 2769-2773 - [i1]Sekhar Tatikonda, Sanjoy K. Mitter:
The Capacity of Channels with Feedback. CoRR abs/cs/0609139 (2006) - 2005
- [j7]Sekhar Tatikonda, Sanjoy K. Mitter:
Authors' reply [to comments on "control over noisy channels" by S. Tatikonda and S. Mitter]. IEEE Trans. Autom. Control. 50(12) (2005) - [j6]Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda:
Feedback capacity of finite-state machine channels. IEEE Trans. Inf. Theory 51(3): 799-810 (2005) - [c13]Vivek S. Borkar, Sanjoy K. Mitter, Anant Sahai, Sekhar Tatikonda:
Sequential Source Coding: An optimization viewpoint. CDC/ECC 2005: 1035-1042 - [c12]Sekhar Tatikonda:
A Markov Decision Approach to Feedback Channel Capacity. CDC/ECC 2005: 3213-3218 - [c11]Jian Ni, Sekhar Tatikonda:
Revenue optimization via call admission control and pricing for mobile cellular systems. ICC 2005: 3359-3364 - [c10]Jian Ni, Danny H. K. Tsang, Sekhar Tatikonda, Brahim Bensaou:
Threshold and reservation based call admission control policies for multiservice resource-sharing systems. INFOCOM 2005: 773-783 - [c9]Jian Ni, Sekhar Tatikonda:
Calculating blocking probabilities for loss networks based on probabilistic graphical models. ISIT 2005: 568-572 - 2004
- [j5]Sekhar Tatikonda, Sanjoy K. Mitter:
Control under communication constraints. IEEE Trans. Autom. Control. 49(7): 1056-1068 (2004) - [j4]Sekhar Tatikonda, Sanjoy K. Mitter:
Control over noisy channels. IEEE Trans. Autom. Control. 49(7): 1196-1201 (2004) - [j3]Sekhar Tatikonda, Anant Sahai, Sanjoy K. Mitter:
Stochastic linear control over a communication channel. IEEE Trans. Autom. Control. 49(9): 1549-1561 (2004) - [c8]Jialing Liu, Nicola Elia, Sekhar Tatikonda:
Capacity-achieving feedback scheme for flat fading channels with channel state information. ACC 2004: 3593-3598 - [c7]Jialing Liu, Nicola Elia, Sekhar Tatikonda:
Capacity-achieving feedback scheme for Markov channels with channel state information. ISIT 2004: 71 - [c6]Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda:
Linear Gaussian channels: feedback capacity under power constraints. ISIT 2004: 72 - [c5]Sekhar Tatikonda, Kannan Ramchandran:
Coding and routing complexity in sensor networks. ISIT 2004: 117 - 2003
- [c4]Sekhar Tatikonda:
Some scaling properties of large distributed control systems. CDC 2003: 3142-3147 - [c3]Sekhar Chandra Tatikonda:
Convergence of the sum-product algorithm. ITW 2003: 222-225 - 2002
- [c2]Sekhar Tatikonda, Michael I. Jordan:
Loopy Belief Propogation and Gibbs Measures. UAI 2002: 493-500 - 2001
- [j2]Vivek S. Borkar, Sanjoy K. Mitter, Sekhar Tatikonda:
Markov control problems under communication constraints. Commun. Inf. Syst. 1(1): 15-32 (2001) - [j1]Vivek S. Borkar, Sanjoy K. Mitter, Sekhar Tatikonda:
Optimal Sequential Vector Quantization of Markov Sources. SIAM J. Control. Optim. 40(1): 135-148 (2001) - [c1]Vivek S. Borkar, Sanjoy K. Mitter, Sekhar Tatikonda:
Optimal sequential vector quantization of Markov sources. CDC 2001: 205-210 - 2000
- [b1]Sekhar Chandra Tatikonda:
Control under communication constraints. Massachusetts Institute of Technology, Cambridge, MA, USA, 2000
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:25 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:
