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

19th Annual Symposium on Foundations of Computer Science (sfcs 1978)最新文献

筛选
英文 中文
A fast algorithm for single processor scheduling 一种快速的单处理器调度算法
19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI: 10.1109/SFCS.1978.4
B. Simons
{"title":"A fast algorithm for single processor scheduling","authors":"B. Simons","doi":"10.1109/SFCS.1978.4","DOIUrl":"https://doi.org/10.1109/SFCS.1978.4","url":null,"abstract":"Suppose we are given a single processor and a set S of n jobs. For each job X there is a release time rx and a deadline dx , with rx and dx nonnegative real numbers. A schedule is feasible if there is no time at which more than one job is being run and if every job in the schedule is begun no earlier than its release time and is completed by its deadline. The problem is to find a feasible schedule in which each job is run for the same amount of time p. The processing is nonpreemptive in that once a job is started it continues executing until it has run for precisely p units of time.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127396113","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}
引用次数: 95
Consistent and complete proof rules for the total correctness of parallel programs 并行程序的全部正确性的一致和完整的证明规则
19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI: 10.1109/SFCS.1978.11
L. Flon, N. Suzuki
{"title":"Consistent and complete proof rules for the total correctness of parallel programs","authors":"L. Flon, N. Suzuki","doi":"10.1109/SFCS.1978.11","DOIUrl":"https://doi.org/10.1109/SFCS.1978.11","url":null,"abstract":"We describe a formal theory of the total correctness of parallel programs, including such heretofore theoretically incomplete properties as safety from deadlock and starvation. We present a consistent and complete set of proof rules for the total correctness of parallel programs expressed in nondeterministic form. The proof of consistency and completeness is novel in that we show that the weakest preconditions for each correctness criterion are actually fixed-points (least or greatest) of continuous functions over the complete lattice of total predicates. We have obtained proof rule schemata which can universally be applied to least or greatest fixed points of continuous functions. Therefore, our proof rules are a priori consistent and complete once it is shown that certain weakest preconditions are extremum fixed-points. The relationship between true parallelism and nondeterminism is also discussed.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133475411","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}
引用次数: 17
Limited subsets of a free monoid 自由单群的有限子集
19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI: 10.1109/SFCS.1978.21
Imre Simon
{"title":"Limited subsets of a free monoid","authors":"Imre Simon","doi":"10.1109/SFCS.1978.21","DOIUrl":"https://doi.org/10.1109/SFCS.1978.21","url":null,"abstract":"","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121856229","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}
引用次数: 139
Improved bounds on the problem of time-space trade-off in the pebble game 改进了鹅卵石博弈中时空权衡问题的边界
19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI: 10.1145/322217.322233
R. Reischuk
{"title":"Improved bounds on the problem of time-space trade-off in the pebble game","authors":"R. Reischuk","doi":"10.1145/322217.322233","DOIUrl":"https://doi.org/10.1145/322217.322233","url":null,"abstract":"Every family of graphs Gn with n nodes and bounded in-degree can be pebbled with o(n) pebbles in time o(n 1+c) for all c≫0. There is a family of graphs Gn such that pebbling Gn with O(n/log n) pebbles requires ω(n(log n)k) moves for all k. The n-node jellyfish-graph as defined in (1) can be pebbled with O((log n)2) pebbles and O(n) moves.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122283304","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}
引用次数: 17
Computable nondeterministic functions 可计算的不确定性函数
19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI: 10.1109/SFCS.1978.10
A. K. Chandra
{"title":"Computable nondeterministic functions","authors":"A. K. Chandra","doi":"10.1109/SFCS.1978.10","DOIUrl":"https://doi.org/10.1109/SFCS.1978.10","url":null,"abstract":"Functions computed on nondeterministic machines consist of two parts. The halting part which consists of outputs of halting computations, is, as expected, recursively enumerable. The divergence part, which consists of inputs for which diverging computations are possible, can however be any set in Σ11. Such highly noncomputable sets arise if one admits the \"finite delay property\". This implies that either we make a significant modification to our notion of \"computable\" as applied to nondeterministic machine models, or else that we ban the finite delay property for nondeterministic models.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131662096","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
One-way log-tape reductions 单向日志磁带缩减
19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI: 10.1109/SFCS.1978.31
J. Hartmanis, N. Immerman, Stephen R. Mahaney
{"title":"One-way log-tape reductions","authors":"J. Hartmanis, N. Immerman, Stephen R. Mahaney","doi":"10.1109/SFCS.1978.31","DOIUrl":"https://doi.org/10.1109/SFCS.1978.31","url":null,"abstract":"One-way log-tape (1-L) reductions are mappings defined by log-tape Turing machines whose read head on the input can only move to the right. The 1-L reductions provide a more refined tool for studying the feasible complexity classes than the P-time [2,7] or log-tape [4] reductions. Although the 1-L computations are provably weaker than the feasible classes L, NL, P and NP, the known complete sets for those classes are complete under 1-L reductions. However, using known techniques of counting arguments and recursion theory we show that certain log-tape reductions cannot be 1-L and we construct sets that are complete under log-tape reductions but not under 1-L reductions.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133438290","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}
引用次数: 68
A data structure for orthogonal range queries 正交范围查询的数据结构
19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI: 10.1109/SFCS.1978.1
G. S. Lueker
{"title":"A data structure for orthogonal range queries","authors":"G. S. Lueker","doi":"10.1109/SFCS.1978.1","DOIUrl":"https://doi.org/10.1109/SFCS.1978.1","url":null,"abstract":"Given a set of points in a d-dimensional space, an orthogonal range query is a request for the number of points in a specified d-dimensional box. We present a data structure and algorithm which enable one to insert and delete points and to perform orthogonal range queries. The worstcase time complexity for n operations is O(n logd n); the space usea is O(n logd-1 n). (O-notation here is with respect to n; the constant is allowed to depend on d.) Next we briefly discuss decision tree bounds on the complexity of orthogonal range queries. We show that a decision tree of height O(dn log n) (Where the implied constant does not depend on d or n) can be constructed to process n operations in d dimensions. This suggests that the standard decision tree model will not provide a useful method for investigating the complexity of such problems.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116087498","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
Selection and sorting with limited storage 有限存储的选择和排序
19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI: 10.1109/SFCS.1978.32
Graham Cormode, A. Mcgregor, Amit Chakrabarti
{"title":"Selection and sorting with limited storage","authors":"Graham Cormode, A. Mcgregor, Amit Chakrabarti","doi":"10.1109/SFCS.1978.32","DOIUrl":"https://doi.org/10.1109/SFCS.1978.32","url":null,"abstract":"When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required. We study the relation between the amount of internal storage available and the number of passes required to select the Kth highest of N inputs. We show, for example, that to find the median in two passes requires at least Ω(N1/2) and at most O(N1/2 log N) internal storage. For probabilistic methods, Θ(N1/2) internal storage is necessary and sufficient for a single pass method which finds the median with arbitrarily high probability.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124879103","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}
引用次数: 501
A new algorithm for the maximal flow problem 最大流问题的一种新算法
19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI: 10.1109/SFCS.1978.5
Z. Galil
{"title":"A new algorithm for the maximal flow problem","authors":"Z. Galil","doi":"10.1109/SFCS.1978.5","DOIUrl":"https://doi.org/10.1109/SFCS.1978.5","url":null,"abstract":"A new algorithm for finding the maximal flow in a given network is presented. The algorithm runs in time O(V5/3E2/3) or O(n2.33) where n = V + E is the length of the input.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122292614","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}
引用次数: 28
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信