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

20th Annual Symposium on Foundations of Computer Science (sfcs 1979)最新文献

筛选
英文 中文
Toward self-organizing linear search 走向自组织线性搜索
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1109/SFCS.1979.45
G. Gonnet, J. Munro, Hendra Suwanda
{"title":"Toward self-organizing linear search","authors":"G. Gonnet, J. Munro, Hendra Suwanda","doi":"10.1109/SFCS.1979.45","DOIUrl":"https://doi.org/10.1109/SFCS.1979.45","url":null,"abstract":"We consider techniques for adapting linear lists so that the more frequently accessed elements are found near the front, even though we are not told the probabilities of various elements being accessed. The main results are discussed in two sections. Perhaps the most interesting deals with techniques which move an element toward the front only after it has been requested k times in a row. The other, technically more difficult, section deals with the analysis of the heuristic which moves an element to the head of the list each time it is accessed. The behaviour of this scheme under a number of interesting probability distributions is discussed. Two basic approaches to the technique of moving an element forward after it has been accessed k times in a row are discussed. The first performs the transformation after any k identical requests. The second essentially groups requests into batches of at least k, and performs the action only if the last k requests of a batch are the same. Adopting as the transformation, the moving of the requested element to the front of the list, the second approach is shown to lead to faster average search time under all nontrivial probability distributions for k ≥2. It is also shown that the \"periodic\" approach, with k = 2, never leads to an average search time greater than 1.21.. times that of the optimal ordering. For the more direct approach, a ratio of 1.36.. is shown under the same constraints. In studying the simple move to front heuristic (i.e. k = 1), it is shown that for a particular distribution this scheme can lead to an average number of probes π/2 times that of the optimal order. Within an interesting class of distributions, this is shown to be the worst average behaviour.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129255838","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}
引用次数: 44
A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality 求解每个不等式有两个变量的线性不等式系统的多项式时间算法
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1137/0209063
Bengt Aspvall, Y. Shiloach
{"title":"A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality","authors":"Bengt Aspvall, Y. Shiloach","doi":"10.1137/0209063","DOIUrl":"https://doi.org/10.1137/0209063","url":null,"abstract":"We present a constructive algorithm for solving systems of linear inequalities (LI) with at most two variables per inequality. The algorithm is polynomial in the size of the input. The LI problem is of importance in complexity theory since it is polynomial time (Turing) equivalent to linear programming. The subclass of LI treated in this paper is also of practical interest in mechanical verification systems, and we believe that the ideas presented can be extended to the general LI problem.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":" 376","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120826653","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}
引用次数: 112
On time versus space II 论时间与空间2
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1109/SFCS.1979.30
W. Paul, R. Reischuk
{"title":"On time versus space II","authors":"W. Paul, R. Reischuk","doi":"10.1109/SFCS.1979.30","DOIUrl":"https://doi.org/10.1109/SFCS.1979.30","url":null,"abstract":"Logarithmically t(n)-time bounded RAMs can be simulated by t(n)/log t(n)-tape bounded Turing machines, t(n)-time bounded multidimensional multitape Turing machines can be simulated by t(n) loglog t(n)/log t(n)-tape bounded Turing machines.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"346 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132440052","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}
引用次数: 29
Models of program logics 程序逻辑模型
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1109/SFCS.1979.24
V. Pratt
{"title":"Models of program logics","authors":"V. Pratt","doi":"10.1109/SFCS.1979.24","DOIUrl":"https://doi.org/10.1109/SFCS.1979.24","url":null,"abstract":"We briefly survey the major proposals for models of programs and show that they all lead to the same propositional theory of programs. Methods of algebraic logic dominate in the proofs. One of the connections made between the models, that involving language models, is quite counterintuitive. The common theory has already been shown to be complete in deterministic exponential time; we give here a simpler proof of the upper bound.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124012815","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}
引用次数: 227
The cube-connected-cycles: A versatile network for parallel computation 立方连接循环:并行计算的通用网络
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1145/358645.358660
F. Preparata, J. Vuillemin
{"title":"The cube-connected-cycles: A versatile network for parallel computation","authors":"F. Preparata, J. Vuillemin","doi":"10.1145/358645.358660","DOIUrl":"https://doi.org/10.1145/358645.358660","url":null,"abstract":"We introduce a network of processing elements, the cube-connected-cycles (CCC), complying with the present technological constraints of VLSI design. By combining the principles of parallelism and pipelining, the CCC can emulate the cube-connected machine with no significant degradation of performance but with a much more compact structure. We describe in detail how to program the CCC for efficiently solving a large class of problems, which includes Fast-Fourier-Transform, sorting, permutations, and derived algorithms. The CCC can also be used as a general purpose parallel processor.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124948328","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}
引用次数: 1120
Complexity of the mover's problem and generalizations 搬运工问题的复杂性和归纳
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1109/SFCS.1979.10
J. Reif
{"title":"Complexity of the mover's problem and generalizations","authors":"J. Reif","doi":"10.1109/SFCS.1979.10","DOIUrl":"https://doi.org/10.1109/SFCS.1979.10","url":null,"abstract":"This paper concerns the problem of moving a polyhedron through Euclidean space while avoiding polyhedral obstacles.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127629827","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}
引用次数: 943
Succinct certificates for the solvability of binary quadratic Diophantine equations 二元二次丢番图方程可解性的简明证明
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1109/SFCS.1979.40
J. Lagarias
{"title":"Succinct certificates for the solvability of binary quadratic Diophantine equations","authors":"J. Lagarias","doi":"10.1109/SFCS.1979.40","DOIUrl":"https://doi.org/10.1109/SFCS.1979.40","url":null,"abstract":"Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. This class of equations includes as special cases many of the known examples of natural problems apparently occupying intermediate stages in the P − NP hierarchy, i.e., problems not known to be solvable in polynomial time nor to be NP-complete, for example the problem of factoring integers. Let L(F) denote the length of the binary encoding of the binary quadratic Diophantine equation F given by ax 2 +bx1x2+cx 2 +dx1+ex2+f = 0. Suppose F is such an equation having a nonnegative integer solution. This paper shows that there is a proof (i.e., “certificate”) that F has such a solution which can be checked in O(L(F) 5 logL(F)log logL(F)) bit operations. A corollary of this result is that the set � = {F : F has a nonnegative integer solution} is in","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116402218","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}
引用次数: 20
Resource allocation with immunity to limited process failure 对有限进程故障具有免疫力的资源分配
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1109/SFCS.1979.37
M. Fischer, N. Lynch, J. Burns, A. Borodin
{"title":"Resource allocation with immunity to limited process failure","authors":"M. Fischer, N. Lynch, J. Burns, A. Borodin","doi":"10.1109/SFCS.1979.37","DOIUrl":"https://doi.org/10.1109/SFCS.1979.37","url":null,"abstract":"Upper and lower bounds are proved for the shared space requirements for solution of several problems involving resource allocation among asynchronous processes. Controlling the degradation of performance when a limited number of processes fail is of particular interest.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125168558","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}
引用次数: 111
Succinctness, verifiability and determinism in representations of polynomial-time languages 多项式时间语言表示的简洁性、可验证性和决定论
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1109/SFCS.1979.41
T. Baker, J. Hartmanis
{"title":"Succinctness, verifiability and determinism in representations of polynomial-time languages","authors":"T. Baker, J. Hartmanis","doi":"10.1109/SFCS.1979.41","DOIUrl":"https://doi.org/10.1109/SFCS.1979.41","url":null,"abstract":"Several representations of P, the class of deterministic polynomial time acceptable languages, are compared with respect to succinctness. It is shown that requirements such as polynomial running time, verifiability of running time, and verifiability of accepting a set in P can be causes for differences in succinctness that are not recursively bounded. Relating succinctness to nondeterminism, it is shown that P ≠ NP if and only if the relative succinctness of representing languages in P by deterministic and nondeterministic clocked polynomial time machines is not recursively bounded. questions are posed, concerning the implications of P = NP, with respect to translatability and succinctness between other pairs of deterministic and nondeterministic representations for P.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127281660","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
Canonical labelling of graphs in linear average time 线性平均时间图的正则标记
20th Annual Symposium on Foundations of Computer Science (sfcs 1979) Pub Date : 1979-10-29 DOI: 10.1109/SFCS.1979.8
L. Babai, L. Kucera
{"title":"Canonical labelling of graphs in linear average time","authors":"L. Babai, L. Kucera","doi":"10.1109/SFCS.1979.8","DOIUrl":"https://doi.org/10.1109/SFCS.1979.8","url":null,"abstract":"Canonical labelling of graphs (CL, for short) can be used, e.g., to test isomorphism. We prove that a simple vertex classification procedure results after only two refinement steps in a CL of random graphs with probability 1 - exp(-cn). With a slight modification we obtain a linear time CL algorithm with only exp(-cn log n/log log n) probability of failure. An additional depth-first search yields a CL of all graphs in linear average time.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121380037","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}
引用次数: 210
首页 上一页 下一页 尾页
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学术官方微信