发布求助
文献互助 智能选刊 最新文献

22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)最新文献

筛选
英文 中文
Unanimity in an unknown and unreliable environment 在未知和不可靠的环境中保持一致
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.53
D. Dolev
{"title":"Unanimity in an unknown and unreliable environment","authors":"D. Dolev","doi":"10.1109/SFCS.1981.53","DOIUrl":"https://doi.org/10.1109/SFCS.1981.53","url":null,"abstract":"Can unanimity be achieved in an unknown and unreliable distributed system? We analyze two extreme models of networks: one in which all the routes of communication are known, and the other in which not even the topology of the network is known. We prove that independently of the model, unanimity is achievable if and only if the number of faulty processors in the system is 1. less than one half of the connectivity of the system's network, and 2. less than one third of the total number of processors. In cases where unanimity is achievable, an algorithm to obtain it is given.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129552565","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}
引用次数: 56
Non-existence of one-dimensional expanding graphs 不存在一维展开图
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.23
M. Klawe
{"title":"Non-existence of one-dimensional expanding graphs","authors":"M. Klawe","doi":"10.1109/SFCS.1981.23","DOIUrl":"https://doi.org/10.1109/SFCS.1981.23","url":null,"abstract":"Expanding graphs are the basic building blocks used in constructions of graphs with special connectivity properties such as superconcentrators. The only known explicit method (Margulis[7], Gabber and Galil[5]) of constructing arbitrarily large expanding graphs with a linear number of edges, uses graphs whose edges are defined by a finite set of linear mappings restricted to a two-dimensional set, Zn × Zn, where Zn denotes the integers mod n. In this paper we prove that for any finite set of onedimensional linear mappings with rational coefficients, the graph they define by their restriction to Zn is not an expanding graph. We also show that shuffle exchange graphs can not be expanding graphs.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131499650","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}
引用次数: 13
Applying parallel computation algorithms in the design of serial algorithms 并行计算算法在串行算法设计中的应用
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1145/2157.322410
N. Megiddo
{"title":"Applying parallel computation algorithms in the design of serial algorithms","authors":"N. Megiddo","doi":"10.1145/2157.322410","DOIUrl":"https://doi.org/10.1145/2157.322410","url":null,"abstract":"The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multi-processor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing an efficient serial algorithm for another problem. A unified framework for cases like this is presented. Particular cases, which are discussed in this paper, provide motivation for examining parallelism in problems like sorting, selection, minimum-spanning-tree, shortest route, maxflow, matrix multiplication, as well as scheduling and locational problems.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123793814","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}
引用次数: 632
A complexity theory based on Boolean algebra 基于布尔代数的复杂性理论
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1145/3149.3158
Sven Skyum, L. Valiant
{"title":"A complexity theory based on Boolean algebra","authors":"Sven Skyum, L. Valiant","doi":"10.1145/3149.3158","DOIUrl":"https://doi.org/10.1145/3149.3158","url":null,"abstract":"A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday relevance in Turing-machine-based complexity theory can be replicated easily and naturally in this elementary framework. Finer distinctions about the computational relationships among natural problems can be made than in previous formulations and some negative results are proved.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128611880","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}
引用次数: 147
The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem 哈密顿路径数对顶点着色问题复杂度的影响
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1137/0213008
U. Manber, M. Tompa
{"title":"The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem","authors":"U. Manber, M. Tompa","doi":"10.1137/0213008","DOIUrl":"https://doi.org/10.1137/0213008","url":null,"abstract":"A generalization of Dobkin and Lipton's element uniqueness problem is introduced: for any fixed undirected graph G on vertex set {v1, v2, ..., vn}, the problem is to determine, given n real numbers x1, x2, ..., xn, whether xi ≠ xj for every edge {vi, vj} in G. This problem is shown to have upper and lower bounds of Θ(nlogn) linear comparisons if G is any dense graph. The proof of the lower bound involves showing that any dense graph must contain a subgraph with many Hamiltonian paths, and demonstrating the relevance of these Hamiltonian paths to a geometric argument. In addition, we exhibit relatively sparse graphs for which the same lower bound holds, and relatively dense graphs for which a linear upper bound holds.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127396035","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}
引用次数: 31
Computation of algebraic functions with root extractions 具有根提取的代数函数的计算
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.14
J. J. Ja'
{"title":"Computation of algebraic functions with root extractions","authors":"J. J. Ja'","doi":"10.1109/SFCS.1981.14","DOIUrl":"https://doi.org/10.1109/SFCS.1981.14","url":null,"abstract":"We consider the problem of computing a set of algebraic functions that involve extracting roots of various degrees. We show that the complexity of computing a large class of algebraic functions is determined by the Galois group G of the extension generated by the functions. We relate the minimum cost to decomposing G into a sequence of normal subgroups such that each factor group is cyclic. We derive an exact answer for the case when the cost is logarithmic, while we provide upper and lower bounds for all the other cases. On the other hand, we develop a reasonably fast algorithm for the abelian case which has been already solved by Pippenger.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114934532","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}
引用次数: 4
Implicit data structures for the weighted dictionary problem 加权字典问题的隐式数据结构
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.19
G. Frederickson
{"title":"Implicit data structures for the weighted dictionary problem","authors":"G. Frederickson","doi":"10.1109/SFCS.1981.19","DOIUrl":"https://doi.org/10.1109/SFCS.1981.19","url":null,"abstract":"Several new data structures are presented for dictionaries containing elements with different weights (access probabilities). The structures use just one location in addition to those required for the values of the elements, and support access times that are within a constant multiplicative factor of optimal, in terms of the rank of the weight of the desired element. Self-organizing heuristics are analyzed, in terms of both weights and \"near-ranks\" of weights. The benefits of additional space are investigated within the context of self-organization and unsuccessful search.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132879741","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}
引用次数: 5
The power of parallelism for automatic program synthesis 并行性在自动程序合成中的作用
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.48
Carl H. Smith
{"title":"The power of parallelism for automatic program synthesis","authors":"Carl H. Smith","doi":"10.1109/SFCS.1981.48","DOIUrl":"https://doi.org/10.1109/SFCS.1981.48","url":null,"abstract":"Inductive inference machines (IIMs) are algorithmic devices which accept as input the graph of a computable function, an ordered pair at a time, and which output a succession of programs each conjectured to compute the input function. IIMs synthesize programs given examples of their intended input-output behavior. Several different criterion for successful synthesis by IIMs are defined. A given criterion is said to be more general than some other criterion if the class of sets which can be inferred by some IIM with respect to the given criteria is larger than the class of sets which can be inferred by some IIM with respect to the other criterion. The tradeoffs between the number of IIMs involved in the learning process and the generality of the criteria of success are examined.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123629659","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}
引用次数: 4
Optimizing conjunctive queries when attribute domains are not disjoint 当属性域不不相交时，优化联合查询
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.33
David S. Johnson, Anthony C. Klug
{"title":"Optimizing conjunctive queries when attribute domains are not disjoint","authors":"David S. Johnson, Anthony C. Klug","doi":"10.1109/SFCS.1981.33","DOIUrl":"https://doi.org/10.1109/SFCS.1981.33","url":null,"abstract":"We present polynomial time algorithms for minimizing and testing equivalence of what we call \"fan-out free\" queries. The fan-out free queries form a more general and more powerful subclass of the conjunctive queries than those previously studied, as they can be used to express questions about transitive properties of databases, questions that are impossible to express if one operates under the \"disjoint domain assumption\" implicit in previous work. Our algorithms are graph-theoretic in nature, and the equivalence algorithm can be viewed as solving a special case of the graph isomorphism problem (by reducing it to a series of labelled forest isomorphism questions).","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121971318","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}
引用次数: 1
Symmetry breaking in distributive networks 分布网络中的对称性破缺
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.41
A. Itai, M. Rodeh
{"title":"Symmetry breaking in distributive networks","authors":"A. Itai, M. Rodeh","doi":"10.1109/SFCS.1981.41","DOIUrl":"https://doi.org/10.1109/SFCS.1981.41","url":null,"abstract":"Given a ring (cycle) of n processes it is required to design the processes so that they will be able to choose a leader (a uniquely designated process) by sending messages along the ring. If the processes are indistiguishable there is no deterministic algorithm, and therefore probabilistic algorithms are proposed. These algorithms need not terminate, but their expected complexity (time or number of bits of communication) is bounded by a function of n. If the processes work asynchronously then on the average O(n log2n) bits are transmitted. In the above cases the size n of the ring was assumed to be known. If n is not known it is suggested first to determine the value of n and then use the above algorithm. However, n may only be determined probabilistically and any algorithm may yield an incorrect value. In addition, it is shown that the size of the ring cannot be calculated by any probabilistic algorithm in which the processes can sense termination.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131593935","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}
引用次数: 100
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信