Facile cleavage of the molybdenum.tplbond.molybdenum bond in reactions between Mo2(OBut)6 and aryl azides and molecular oxygen

Citations Over TimeTop 14% of 1981 papers

Abstract

ADVERTISEMENT RETURN TO ISSUEPREVArticleNEXTFacile cleavage of the molybdenum.tplbond.molybdenum bond in reactions between Mo2(OBut)6 and aryl azides and molecular oxygenMalcolm H. Chisholm, Kirsten Folting, John C. Huffman, Charles C. Kirkpatrick, and Andrew L. RatermannCite this: J. Am. Chem. Soc. 1981, 103, 5, 1305–1306Publication Date (Print):March 1, 1981Publication History Published online1 May 2002Published inissue 1 March 1981https://pubs.acs.org/doi/10.1021/ja00395a092https://doi.org/10.1021/ja00395a092research-articleACS PublicationsRequest reuse permissionsArticle Views86Altmetric-Citations15LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InRedditEmail Other access optionsGet e-AlertscloseSupporting Info (1)»Supporting Information Supporting Information Get e-Alerts

Related Papers

• → Burst Error Recovery for Huffman Coding(2005)5 cited
• → Reduced code transmission and high speed reconstruction of Huffman tables(2002)1 cited
• → Improving Chinese Storing Text Retrieval Systems' Security via a Novel Maximal Prefix Coding(2002)
• An algorithm to achieve adaptive Huffman coding with C language(2011)
• → N-ary Huffman Encoding using High-Degree Trees - A Performance Comparison(2021)