Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDSreeram Kannan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j13]Songze Li
, Mingchao Yu, Chien-Sheng Yang, Amir Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously. IEEE Trans. Inf. Forensics Secur. 16: 249-261 (2021)- [i46]Mahimna Kelkar, Soubhik Deb, Sreeram Kannan:
Order-Fair Consensus in the Permissionless Setting. IACR Cryptol. ePrint Arch. 2021: 139 (2021) - 2020
- [j12]Eugene Lin, Sudipto Mukherjee, Sreeram Kannan:
A deep adversarial variational autoencoder model for dimensionality reduction in single-cell RNA sequencing analysis. BMC Bioinform. 21(1): 64 (2020) - [j11]Hyeji Kim, Yihan Jiang, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Deepcode: Feedback Codes via Deep Learning. IEEE J. Sel. Areas Inf. Theory 1(1): 194-206 (2020) - [j10]Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
LEARN Codes: Inventing Low-Latency Codes via Recurrent Neural Networks. IEEE J. Sel. Areas Inf. Theory 1(1): 207-216 (2020) - [c42]Ashok Vardhan Makkuva, Sewoong Oh, Sreeram Kannan, Pramod Viswanath:
Learning in Gated Neural Networks. AISTATS 2020: 3338-3348 - [c41]Shunfu Mao, Yihan Jiang, Edwin Basil Mathew, Sreeram Kannan:
BOAssembler: A Bayesian Optimization Framework to Improve RNA-Seq Assembly Performance. AlCoB 2020: 188-197 - [c40]Amir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse, Pramod Viswanath, Xuechao Wang, Ofer Zeitouni:
Everything is a Race and Nakamoto Always Wins. CCS 2020: 859-878 - [c39]Mingchao Yu, Saeid Sahraei, Songze Li, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains. Financial Cryptography 2020: 114-134 - [c38]Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sewoong Oh, Sreeram Kannan, Pramod Viswanath:
Feedback Turbo Autoencoder. ICASSP 2020: 8559-8563 - [c37]Songze Li, Mingchao Yu, Chien-Sheng Yang, Amir Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously. ISIT 2020: 203-208 - [c36]Yifan Mao, Soubhik Deb, Shaileshh Bojja Venkatakrishnan, Sreeram Kannan, Kannan Srinivasan:
Perigee: Efficient Peer-to-Peer Network Design for Blockchains. PODC 2020: 428-437 - [c35]Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Joint Channel Coding and Modulation via Deep Learning. SPAWC 2020: 1-5 - [c34]Arnab Kumar Mondal, Arnab Bhattacharjee, Sudipto Mukherjee, Himanshu Asnani, Sreeram Kannan, Prathosh A. P.:
C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation. UAI 2020: 849-858 - [i45]Arnab Kumar Mondal, Arnab Bhattacharya, Sudipto Mukherjee, Sreeram Kannan, Himanshu Asnani, Prathosh AP:
C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation. CoRR abs/2005.08226 (2020) - [i44]Ranvir Rana, Sreeram Kannan, David Tse, Pramod Viswanath:
Free2Shard: Adaptive-adversary-resistant sharding via Dynamic Self Allocation. CoRR abs/2005.09610 (2020) - [i43]Amir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse, Pramod Viswanath, Xuechao Wang, Ofer Zeitouni:
Everything is a Race and Nakamoto Always Wins. CoRR abs/2005.10484 (2020) - [i42]Yifan Mao, Soubhik Deb, Shaileshh Bojja Venkatakrishnan, Sreeram Kannan, Kannan Srinivasan:
Perigee: Efficient Peer-to-Peer Network Design for Blockchains. CoRR abs/2006.14186 (2020) - [i41]Hyeji Kim, Yihan Jiang, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Deepcode and Modulo-SK are Designed for Different Settings. CoRR abs/2008.07997 (2020) - [i40]Peiyao Sheng, Gerui Wang, Kartik Nayak, Sreeram Kannan, Pramod Viswanath:
BFT Protocol Forensics. CoRR abs/2010.06785 (2020) - [i39]Soubhik Deb, Sreeram Kannan, David Tse:
PoSAT: Proof-of-Work Availability andUnpredictability, without the Work. CoRR abs/2010.08154 (2020) - [i38]Suryanarayana Sankagiri, Xuechao Wang, Sreeram Kannan, Pramod Viswanath:
The Checkpointed Longest Chain: User-dependent Adaptivity and Finality. CoRR abs/2010.13711 (2020) - [i37]Peiyao Sheng, Bowen Xue, Sreeram Kannan, Pramod Viswanath:
ACeD: Scalable Data Availability Oracle. CoRR abs/2011.00102 (2020) - [i36]Amir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse, Pramod Viswanath, Xuechao Wang, Ofer Zeitouni:
Everything is a Race and Nakamoto Always Wins. IACR Cryptol. ePrint Arch. 2020: 601 (2020)
2010 – 2019
- 2019
- [c33]Sudipto Mukherjee, Himanshu Asnani, Eugene Lin, Sreeram Kannan:
ClusterGAN: Latent Space Clustering in Generative Adversarial Networks. AAAI 2019: 4610-4617 - [c32]Vivek Kumar Bagaria, Sreeram Kannan, David Tse, Giulia C. Fanti, Pramod Viswanath:
Prism: Deconstructing the Blockchain to Approach Physical Limits. CCS 2019: 585-602 - [c31]Hossein Hosseini, Sreeram Kannan, Radha Poovendran:
Dropping Pixels for Adversarial Robustness. CVPR Workshops 2019: 91-97 - [c30]Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
LEARN Codes: Inventing Low-Latency Codes via Recurrent Neural Networks. ICC 2019: 1-7 - [c29]Ashok Vardhan Makkuva, Pramod Viswanath, Sreeram Kannan, Sewoong Oh:
Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithms. ICML 2019: 4304-4313 - [c28]Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels. NeurIPS 2019: 2754-2764 - [c27]Songze Li, Saeid Sahraei, Mingchao Yu, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded State Machine - Scaling State Machine Execution under Byzantine Faults. PODC 2019: 150-152 - [c26]Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sreeram Kannan:
MIND: Model Independent Neural Decoder. SPAWC 2019: 1-5 - [c25]Yihan Jiang, Sreeram Kannan, Hyeji Kim, Sewoong Oh, Himanshu Asnani, Pramod Viswanath:
DEEPTURBO: Deep Turbo Decoder. SPAWC 2019: 1-5 - [c24]Sudipto Mukherjee, Himanshu Asnani, Sreeram Kannan:
CCMI : Classifier based Conditional Mutual Information Estimation. UAI 2019: 1083-1093 - [i35]Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
DeepTurbo: Deep Turbo Decoder. CoRR abs/1903.02295 (2019) - [i34]Hossein Hosseini, Sreeram Kannan, Radha Poovendran:
Dropping Pixels for Adversarial Robustness. CoRR abs/1905.00180 (2019) - [i33]Sudipto Mukherjee, Himanshu Asnani, Sreeram Kannan:
CCMI : Classifier based Conditional Mutual Information Estimation. CoRR abs/1906.01824 (2019) - [i32]Ashok Vardhan Makkuva, Sewoong Oh, Sreeram Kannan, Pramod Viswanath:
Learning in Gated Neural Networks. CoRR abs/1906.02777 (2019) - [i31]Songze Li, Saeid Sahraei, Mingchao Yu, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded State Machine - Scaling State Machine Execution under Byzantine Faults. CoRR abs/1906.10817 (2019) - [i30]Hossein Hosseini, Sreeram Kannan, Radha Poovendran:
Are Odds Really Odd? Bypassing Statistical Detection of Adversarial Examples. CoRR abs/1907.12138 (2019) - [i29]Yihan Jiang, Jakub Konecný, Keith Rush, Sreeram Kannan:
Improving Federated Learning Personalization via Model Agnostic Meta Learning. CoRR abs/1909.12488 (2019) - [i28]Mingchao Yu, Saeid Sahraei, Songze Li, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains. CoRR abs/1910.01247 (2019) - [i27]Xuechao Wang, Govinda M. Kamath, Vivek Kumar Bagaria, Sreeram Kannan, Sewoong Oh, David Tse, Pramod Viswanath:
Proof-of-Stake Longest Chain Protocols Revisited. CoRR abs/1910.02218 (2019) - [i26]Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels. CoRR abs/1911.03038 (2019) - [i25]Mingchao Yu, Saeid Sahraei, Songze Li, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains. IACR Cryptol. ePrint Arch. 2019: 1139 (2019) - 2018
- [j9]Sumit Mukherjee, Yue Zhang, Joshua Fan, Georg Seelig, Sreeram Kannan:
Scalable preprocessing for sparse scRNA-seq data exploiting prior knowledge. Bioinform. 34(13): i124-i132 (2018) - [j8]Wei Mao, Suhas N. Diggavi, Sreeram Kannan:
Models and Information-Theoretic Bounds for Nanopore Sequencing. IEEE Trans. Inf. Theory 64(4): 3216-3236 (2018) - [c23]Hyeji Kim, Yihan Jiang, Ranvir Rana, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Communication Algorithms via Deep Learning. ICLR (Poster) 2018 - [c22]Arman Rahimzamani, Himanshu Asnani, Pramod Viswanath, Sreeram Kannan:
Estimators for Multivariate Information Measures in General Probability Spaces. NeurIPS 2018: 8678-8689 - [c21]Hyeji Kim, Yihan Jiang, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Deepcode: Feedback Codes via Deep Learning. NeurIPS 2018: 9458-9468 - [i24]Ashok Vardhan Makkuva, Sreeram Kannan, Pramod Viswanath:
Globally Consistent Algorithms for Mixture of Experts. CoRR abs/1802.07417 (2018) - [i23]Hyeji Kim, Yihan Jiang, Ranvir Rana, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Communication Algorithms via Deep Learning. CoRR abs/1805.09317 (2018) - [i22]Rajat Sen, Karthikeyan Shanmugam, Himanshu Asnani, Arman Rahimzamani, Sreeram Kannan:
Mimic and Classify : A meta-algorithm for Conditional Independence Testing. CoRR abs/1806.09708 (2018) - [i21]Hyeji Kim, Yihan Jiang, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Deepcode: Feedback Codes via Deep Learning. CoRR abs/1807.00801 (2018) - [i20]Sudipto Mukherjee, Himanshu Asnani, Eugene Lin, Sreeram Kannan:
ClusterGAN : Latent Space Clustering in Generative Adversarial Networks. CoRR abs/1809.03627 (2018) - [i19]Songze Li, Mingchao Yu, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously. CoRR abs/1809.10361 (2018) - [i18]Vivek Kumar Bagaria, Sreeram Kannan, David Tse, Giulia C. Fanti, Pramod Viswanath:
Deconstructing the Blockchain to Approach Physical Limits. CoRR abs/1810.08092 (2018) - [i17]Arman Rahimzamani, Himanshu Asnani, Pramod Viswanath, Sreeram Kannan:
Estimators for Multivariate Information Measures in General Probability Spaces. CoRR abs/1810.11551 (2018) - [i16]Yihan Jiang, Hyeji Kim, Himanshu Asnani, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
LEARN Codes: Inventing Low-latency Codes via Recurrent Neural Networks. CoRR abs/1811.12707 (2018) - [i15]Songze Li, Mingchao Yu, Amir Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously. IACR Cryptol. ePrint Arch. 2018: 925 (2018) - [i14]Vivek Kumar Bagaria, Sreeram Kannan, David Tse, Giulia C. Fanti, Pramod Viswanath:
Deconstructing the Blockchain to Approach Physical Limits. IACR Cryptol. ePrint Arch. 2018: 992 (2018) - 2017
- [j7]Hyeji Kim, Weihao Gao, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Discovering Potential Correlations via Hypercontractivity. Entropy 19(11): 586 (2017) - [c20]Arman Rahimzamani, Sreeram Kannan:
Potential conditional mutual information: Estimators and properties. Allerton 2017: 1228-1235 - [c19]Wei Mao, Suhas N. Diggavi, Sreeram Kannan:
Models and information-theoretic bounds for nanopore sequencing. ISIT 2017: 2458-2462 - [c18]Hyeji Kim, Weihao Gao, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Discovering Potential Correlations via Hypercontractivity. NIPS 2017: 4577-4587 - [c17]Weihao Gao, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Estimating Mutual Information for Discrete-Continuous Mixtures. NIPS 2017: 5986-5997 - [c16]Mark Chaisson, Sudipto Mukherjee, Sreeram Kannan, Evan E. Eichler:
Resolving Multicopy Duplications de novo Using Polyploid Phasing. RECOMB 2017: 117-133 - [c15]Shunfu Mao, Soheil Mohajer, Kannan Ramchandran, David Tse, Sreeram Kannan:
abSNP: RNA-Seq SNP Calling in Repetitive Regions via Abundance Estimation. WABI 2017: 15:1-15:14 - [i13]Hossein Hosseini, Sreeram Kannan, Baosen Zhang, Radha Poovendran:
Deceiving Google's Perspective API Built for Detecting Toxic Comments. CoRR abs/1702.08138 (2017) - [i12]Hossein Hosseini, Yize Chen, Sreeram Kannan, Baosen Zhang, Radha Poovendran:
Blocking Transferability of Adversarial Examples in Black-Box Learning Systems. CoRR abs/1703.04318 (2017) - [i11]Wei Mao, Suhas N. Diggavi, Sreeram Kannan:
Models and information-theoretic bounds for nanopore sequencing. CoRR abs/1705.11154 (2017) - [i10]Weihao Gao, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Estimating Mutual Information for Discrete-Continuous Mixtures. CoRR abs/1709.06212 (2017) - [i9]Arman Rahimzamani, Sreeram Kannan:
Potential Conditional Mutual Information: Estimators, Properties and Applications. CoRR abs/1710.05012 (2017) - [i8]Arman Rahimzamani, Sreeram Kannan:
Potential conditional mutual information: Estimators and properties. PeerJ Prepr. 5: e3345 (2017) - 2016
- [c14]Arman Rahimzamani, Sreeram Kannan:
Network inference using directed information: The deterministic limit. Allerton 2016: 156-163 - [c13]Hossein Hosseini, Sreeram Kannan, Baosen Zhang, Radha Poovendran:
Learning Temporal Dependence from Time-Series Data with Latent Variables. DSAA 2016: 253-262 - [c12]Weihao Gao, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Conditional Dependence via Shannon Capacity: Axioms, Estimators and Applications. ICML 2016: 2780-2789 - [i7]Weihao Gao, Sreeram Kannan, Sewoong Oh, Pramod Viswanath:
Causal Strength via Shannon Capacity: Axioms, Estimators and Applications. CoRR abs/1602.03476 (2016) - [i6]Hossein Hosseini, Sreeram Kannan, Baosen Zhang, Radha Poovendran:
Learning Temporal Dependence from Time-Series Data with Latent Variables. CoRR abs/1608.07636 (2016) - 2015
- [j6]Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity Flows and Cuts in Polymatroidal Networks. SIAM J. Comput. 44(4): 912-943 (2015) - [c11]Rahul Kidambi, Sreeram Kannan:
On Shannon capacity and causal estimation. Allerton 2015: 988-992 - [c10]Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Delay-constrained unicast and the triangle-cast problem. ISIT 2015: 804-808 - [c9]Farzan Farnia, Meisam Razaviyayn, Sreeram Kannan, David Tse:
Minimum HGR correlation principle: From marginals to joint distribution. ISIT 2015: 1377-1381 - [i5]Farzan Farnia, Meisam Razaviyayn, Sreeram Kannan, David Tse:
Minimum HGR Correlation Principle: From Marginals to Joint Distribution. CoRR abs/1504.06010 (2015) - 2014
- [j5]Quan Geng, Sreeram Kannan, Pramod Viswanath:
Interactive Interference Alignment. IEEE J. Sel. Areas Commun. 32(9): 1699-1706 (2014) - [j4]Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Network Capacity Under Traffic Symmetry: Wireline and Wireless Networks. IEEE Trans. Inf. Theory 60(9): 5457-5469 (2014) - [j3]Sreeram Kannan, Pramod Viswanath:
Capacity of Multiple Unicast in Wireless Networks: A Polymatroidal Approach. IEEE Trans. Inf. Theory 60(10): 6303-6328 (2014) - [c8]Shaileshh Bojja Venkatakrishnan, Pramod Viswanath, Sreeram Kannan:
Degrees of Freedom for multiple-multicast traffic. ISIT 2014: 836-840 - 2013
- [j2]Sreeram Kannan, Pramod Viswanath:
Multi-Session Function Computation and Multicasting in Undirected Graphs. IEEE J. Sel. Areas Commun. 31(4): 702-713 (2013) - [c7]Quan Geng, Sreeram Kannan, Pramod Viswanath:
Interactive interference alignment. ISIT 2013: 31-35 - [c6]Sreeram Kannan, Pramod Viswanath:
Multi-terminal function multicasting in undirected graphs. ISIT 2013: 2334-2338 - 2012
- [j1]Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Approximately Optimal Wireless Broadcasting. IEEE Trans. Inf. Theory 58(12): 7154-7167 (2012) - [c5]Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity flows and cuts in polymatroidal networks. ITCS 2012: 399-408 - [c4]Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Wireless networks with symmetric demands. ISIT 2012: 2621-2625 - [i4]Quan Geng, Sreeram Kannan, Pramod Viswanath:
Interactive Interference Alignment. CoRR abs/1211.0985 (2012) - 2011
- [c3]Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Local phy + global flow: A layering principle for wireless networks. ISIT 2011: 1633-1637 - [c2]Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Approximately optimal broadcasting-cum-multicasting in wireless networks. ISIT 2011: 1911-1915 - [c1]Sreeram Kannan, Pramod Viswanath:
Multiple-unicast in fading wireless networks: A separation scheme is approximately optimal. ISIT 2011: 2617-2621 - [i3]Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity Flows and Cuts in Polymatroidal Networks. CoRR abs/1110.6832 (2011) - [i2]Sreeram Kannan, Pramod Viswanath:
Capacity of Multiple Unicast in Wireless Networks: A Polymatroidal Approach. CoRR abs/1111.4768 (2011) - 2010
- [i1]Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Approximately Optimal Wireless Broadcasting. CoRR abs/1011.2835 (2010)
Coauthor Index
[j13] [j11] [j10] [c42] [c40] [c39] [c38] [c37] [c35] [i44] [i43] [i41] [i40] [i38] [i37] [i36] [c32] [c30] [c29] [c28] [c27] [c25] [i35] [i32] [i31] [i28] [i27] [i26] [i25] [c23] [c22] [c21] [i24] [i23] [i21] [i19] [i18] [i17] [i16] [i15] [i14] [j7] [c18] [c17] [i10] [c12] [i7] [j6] [c10] [j5] [j4] [j3] [c8] [j2] [c7] [c6] [j1] [c5] [c4] [i4] [c3] [c2] [c1] [i3] [i2] [i1]
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 2021-04-07 23:49 CEST 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:
