首页 > 最新文献

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science最新文献

英文 中文
Progress measures for complementation omega -automata with applications to temporal logic 在时间逻辑应用中补充omega -自动机的进展措施
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185391
Nils Klarlund
A new approach to complementing omega -automata, which are finite-state automata defining languages of infinite words, is given. Instead of using usual combinatorial or algebraic properties of transition relations, it is shown that a graph-theoretic approach based on the notion of progress measures is a potent tool for complementing omega -automata. Progress measures are applied to the classical problem of complementing Buchi automata, and a simple method is obtained. The technique applies to Streett automata, for which an optimal complementation method is also obtained. As a consequence, it is seen that the powerful temporal logic ETLs is much more tractable than previously thought.<>
给出了一种补充有限状态自动机的新方法,这些自动机定义了无限词的语言。代替使用通常的转换关系的组合或代数性质,显示了基于进度度量概念的图论方法是补充-自动机的有力工具。将进度措施应用于补齐自动机的经典问题,得到了一种简单的方法。该方法也适用于street自动机,得到了street自动机的最优互补方法。因此,可以看到强大的时间逻辑etl比以前认为的要容易处理得多。
{"title":"Progress measures for complementation omega -automata with applications to temporal logic","authors":"Nils Klarlund","doi":"10.1109/SFCS.1991.185391","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185391","url":null,"abstract":"A new approach to complementing omega -automata, which are finite-state automata defining languages of infinite words, is given. Instead of using usual combinatorial or algebraic properties of transition relations, it is shown that a graph-theoretic approach based on the notion of progress measures is a potent tool for complementing omega -automata. Progress measures are applied to the classical problem of complementing Buchi automata, and a simple method is obtained. The technique applies to Streett automata, for which an optimal complementation method is also obtained. As a consequence, it is seen that the powerful temporal logic ETLs is much more tractable than previously thought.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134167351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 83
How to pack better than best fit: tight bounds for average-case online bin packing 如何包装比最佳适合:平均情况下的紧密边界在线箱包装
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185444
P. Shor
An O(n log n)-time online algorithm is given for packing items i.i.d. uniform on (0, 1) into bins of size 1 with expected wasted space Theta (n/sup 1/2/ log /sup 1/2/n). This matches the lowest bound that no online algorithm can achieve O(n/sup 1/2/ log /sup 1/2/ n) wasted space. It is done by analyzing another algorithm which involves putting balls into buckets online. The analysis of this second algorithm also gives bound on the stochastic rightward matching problem, which arises in analyzing not only the above online bin packing problem, but also a 2-D problem of packing rectangles into a half-infinite strip. The bounds on rightward matching thus give good bounds for the 2-D strip packing problem.<>
给出了一种耗时O(n log n)的在线算法,用于将(0,1)上i.i.d uniform的物品打包到大小为1的箱子中,期望浪费空间为Theta (n/sup 1/2/ log /sup 1/2/n)。这与没有在线算法可以实现O(n/sup 1/2/ log /sup 1/2/ n)浪费空间的最低界限相匹配。它是通过分析另一种算法来完成的,该算法涉及将球在线放入桶中。第二种算法的分析还给出了随机向右匹配问题的界,该问题不仅在分析上述在线装箱问题时出现,而且在分析二维矩形装箱成半无限条问题时也会出现。因此,右匹配的边界为二维条形布局问题提供了良好的边界。
{"title":"How to pack better than best fit: tight bounds for average-case online bin packing","authors":"P. Shor","doi":"10.1109/SFCS.1991.185444","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185444","url":null,"abstract":"An O(n log n)-time online algorithm is given for packing items i.i.d. uniform on (0, 1) into bins of size 1 with expected wasted space Theta (n/sup 1/2/ log /sup 1/2/n). This matches the lowest bound that no online algorithm can achieve O(n/sup 1/2/ log /sup 1/2/ n) wasted space. It is done by analyzing another algorithm which involves putting balls into buckets online. The analysis of this second algorithm also gives bound on the stochastic rightward matching problem, which arises in analyzing not only the above online bin packing problem, but also a 2-D problem of packing rectangles into a half-infinite strip. The bounds on rightward matching thus give good bounds for the 2-D strip packing problem.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128972156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Lower bounds for the complexity of reliable Boolean circuits with noisy gates 带噪声门的可靠布尔电路复杂度的下界
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185424
A. Gál
It is proved that the reliable computation of any Boolean function with, sensitivity s requires Omega (s log s) gates if the gates of the circuit fail independently with a fixed positive probability. The Omega (s log s) bound holds even if s is the block sensitivity instead of the sensitivity of the Boolean function. Some open problems are mentioned.<>
证明了当电路的门以固定的正概率独立失效时,任何灵敏度为s的布尔函数的可靠计算都需要ω (s log s)门。即使s是块灵敏度而不是布尔函数的灵敏度,ω (s log s)边界也成立。文中还提到了一些尚未解决的问题。
{"title":"Lower bounds for the complexity of reliable Boolean circuits with noisy gates","authors":"A. Gál","doi":"10.1109/SFCS.1991.185424","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185424","url":null,"abstract":"It is proved that the reliable computation of any Boolean function with, sensitivity s requires Omega (s log s) gates if the gates of the circuit fail independently with a fixed positive probability. The Omega (s log s) bound holds even if s is the block sensitivity instead of the sensitivity of the Boolean function. Some open problems are mentioned.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116005970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
On-line scheduling in the presence of overload 过载情况下的在线调度
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185354
Sanjoy Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha
The preemptive scheduling of sporadic tasks on a uniprocessor is considered. A task may arrive at any time, and is characterized by a value that reflects its importance, an execution time that is the amount of processor time needed to completely execute the task, and a deadline by which the task is to complete execution. The goal is to maximize the sum of the values of the completed tasks. An online scheduling algorithm that achieves optimal performance when the system is underloaded and provides a nontrivial performance guarantee when the system is overloaded is designed. The algorithm is implemented using simple data structures to run at a cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant. Upper bounds on the best performance guarantee obtainable by an online algorithm in a variety of settings are derived.<>
研究了单处理机上零星任务的抢占调度问题。任务可以在任何时间到达,其特征包括反映其重要性的值、执行时间(即完全执行任务所需的处理器时间量)以及任务完成执行的截止日期。目标是最大化完成任务的价值总和。设计了一种在线调度算法,在系统欠载时实现最优性能,在系统过载时提供重要的性能保证。该算法使用简单的数据结构来实现,每个任务的运行成本为O(log n),其中n限制了系统中任何时刻的任务数量。导出了在线算法在各种设置下可获得的最佳性能保证的上界。
{"title":"On-line scheduling in the presence of overload","authors":"Sanjoy Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha","doi":"10.1109/SFCS.1991.185354","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185354","url":null,"abstract":"The preemptive scheduling of sporadic tasks on a uniprocessor is considered. A task may arrive at any time, and is characterized by a value that reflects its importance, an execution time that is the amount of processor time needed to completely execute the task, and a deadline by which the task is to complete execution. The goal is to maximize the sum of the values of the completed tasks. An online scheduling algorithm that achieves optimal performance when the system is underloaded and provides a nontrivial performance guarantee when the system is overloaded is designed. The algorithm is implemented using simple data structures to run at a cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant. Upper bounds on the best performance guarantee obtainable by an online algorithm in a variety of settings are derived.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115156911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 158
Explicit construction of natural bounded concentrators 自然有界集中器的显式构造
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185396
Moshe Morgenstern
The first known direct construction for linear families of bounded concentrators is given. The construction is explicit, and the results are simple natural bounded concentrators.<>
给出了有界集中器线性族的第一个已知的直接构造。构造是显式的,结果是简单的自然有界集中器
{"title":"Explicit construction of natural bounded concentrators","authors":"Moshe Morgenstern","doi":"10.1109/SFCS.1991.185396","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185396","url":null,"abstract":"The first known direct construction for linear families of bounded concentrators is given. The construction is explicit, and the results are simple natural bounded concentrators.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127236251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Using approximation algorithms to design parallel algorithms that may ignore processor allocation 使用近似算法设计并行算法,可以忽略处理器分配
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185439
M. Goodrich
A framework is presented for designing parallel algorithms that may ignore processor allocation. A number of fast approximation algorithms are developed, and it is shown how to use these algorithms to simulate any algorithm that fits this framework in a work-preserving fashion on a randomized CRCW PRAM. Several applications of the approach to parallel computational geometry are given.<>
提出了一个可以忽略处理器分配的并行算法设计框架。开发了许多快速近似算法,并展示了如何使用这些算法在随机CRCW PRAM上以保持工作的方式模拟适合该框架的任何算法。给出了该方法在并行计算几何中的几个应用。
{"title":"Using approximation algorithms to design parallel algorithms that may ignore processor allocation","authors":"M. Goodrich","doi":"10.1109/SFCS.1991.185439","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185439","url":null,"abstract":"A framework is presented for designing parallel algorithms that may ignore processor allocation. A number of fast approximation algorithms are developed, and it is shown how to use these algorithms to simulate any algorithm that fits this framework in a work-preserving fashion on a randomized CRCW PRAM. Several applications of the approach to parallel computational geometry are given.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125565043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 43
Better bounds for threshold formulas 更好的阈值公式边界
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185384
J. Radhakrishnan
The computation of threshold functions using formulas over the basis (AND, OR, NOT) is considered. It is shown that every monotone formula that computes the threshold function T/sub k//sup n/2>
考虑了在基(AND, OR, NOT)上使用公式计算阈值函数。证明了计算阈值函数T/下标k//sup n/2>的每一个单调公式
{"title":"Better bounds for threshold formulas","authors":"J. Radhakrishnan","doi":"10.1109/SFCS.1991.185384","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185384","url":null,"abstract":"The computation of threshold functions using formulas over the basis (AND, OR, NOT) is considered. It is shown that every monotone formula that computes the threshold function T/sub k//sup n/2<or=k<or=n/2, has size Omega (nk log (n/(k-1))). The same lower bound is shown to hold even in the stronger monotone contact networks model. Nearly optimal bounds on the size of Sigma Pi Sigma formulas computing T/sub k//sup n/ for small k are also shown.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127467916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM 连接组件在O(lg/sup 3/2 mod V/ mod)并联时间为CREW PRAM
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185437
Donald B. Johnson, P. Metaxas
Computing the connected components of an undirected graph G=(V, E) on mod V mod =n vertices and mod E mod =m edges is addressed. An efficient and simple algorithm that runs in O(lg/sup 3/2/ n) time using n+m CREW processors is presented.<>
计算无向图G=(V, E)在V mod =n个顶点和E mod =m条边上的连通分量。提出了一种使用n+m CREW处理器,运行时间为O(lg/sup 3/2/ n)的高效简单算法。
{"title":"Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM","authors":"Donald B. Johnson, P. Metaxas","doi":"10.1109/SFCS.1991.185437","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185437","url":null,"abstract":"Computing the connected components of an undirected graph G=(V, E) on mod V mod =n vertices and mod E mod =m edges is addressed. An efficient and simple algorithm that runs in O(lg/sup 3/2/ n) time using n+m CREW processors is presented.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121524316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Dynamic three-dimensional linear programming 动态三维线性规划
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185410
D. Eppstein
Linear programming optimizations on the intersection of k polyhedra in R/sup 3/, represented by their outer recursive decompositions, are performed in expected time O(k log k log n+ square root k log k log/sup 3/ n). This result is used to derive efficient algorithms for dynamic linear programming problems ill which constraints are inserted and deleted, and queries must optimize specified objective functions. As an application, an improved solution to the planar 2-center problem, is described.<>
在R/sup 3/中k个多面体的交点上,用它们的外部递归分解表示线性规划优化,在期望时间O(k log k log n+平方根k log k log/sup 3/ n)内完成了线性规划优化。这一结果用于导出动态线性规划问题的有效算法,这些问题需要插入和删除约束,查询必须优化指定的目标函数。作为应用,本文描述了平面二中心问题的一种改进解
{"title":"Dynamic three-dimensional linear programming","authors":"D. Eppstein","doi":"10.1109/SFCS.1991.185410","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185410","url":null,"abstract":"Linear programming optimizations on the intersection of k polyhedra in R/sup 3/, represented by their outer recursive decompositions, are performed in expected time O(k log k log n+ square root k log k log/sup 3/ n). This result is used to derive efficient algorithms for dynamic linear programming problems ill which constraints are inserted and deleted, and queries must optimize specified objective functions. As an application, an improved solution to the planar 2-center problem, is described.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125648995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 69
A unified geometric approach to graph separators 图形分隔符的统一几何方法
Pub Date : 1991-09-01 DOI: 10.1109/SFCS.1991.185417
G. Miller, S. Teng, S. Vavasis
A class of graphs called k-overlap graphs is proposed. Special cases of k-overlap graphs include planar graphs, k-nearest neighbor graphs, and earlier classes of graphs associated with finite element methods. A separator bound is proved for k-overlap graphs embedded in d dimensions. The result unifies several earlier separator results. All the arguments are based on geometric properties of embedding. The separator bounds come with randomized linear-time and randomized NC algorithms. Moreover, the bounds are the best possible up to the leading term.<>
提出了一类称为k重叠图的图。k重叠图的特殊情况包括平面图、k近邻图和与有限元方法相关的早期图类。证明了嵌入在d维的k重叠图的一个分隔界。结果统一了先前的几个分隔符结果。所有的参数都是基于嵌入的几何性质。分隔边界带有随机线性时间和随机NC算法。而且,在第一项之前,边界是最好的。
{"title":"A unified geometric approach to graph separators","authors":"G. Miller, S. Teng, S. Vavasis","doi":"10.1109/SFCS.1991.185417","DOIUrl":"https://doi.org/10.1109/SFCS.1991.185417","url":null,"abstract":"A class of graphs called k-overlap graphs is proposed. Special cases of k-overlap graphs include planar graphs, k-nearest neighbor graphs, and earlier classes of graphs associated with finite element methods. A separator bound is proved for k-overlap graphs embedded in d dimensions. The result unifies several earlier separator results. All the arguments are based on geometric properties of embedding. The separator bounds come with randomized linear-time and randomized NC algorithms. Moreover, the bounds are the best possible up to the leading term.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122229727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 209
期刊
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1