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

26th Annual Symposium on Foundations of Computer Science (sfcs 1985)最新文献

筛选
英文 中文
Visibility-polygon search and euclidean shortest paths 可见多边形搜索和欧氏最短路径
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.65
Takao Asano, T. Asano, L. Guibas, J. Hershberger, H. Imai
{"title":"Visibility-polygon search and euclidean shortest paths","authors":"Takao Asano, T. Asano, L. Guibas, J. Hershberger, H. Imai","doi":"10.1109/SFCS.1985.65","DOIUrl":"https://doi.org/10.1109/SFCS.1985.65","url":null,"abstract":"Consider a collection of disjoint polygons in the plane containing a total of n edges. We show how to build, in O(n2) time and space, a data structure from which in O(n) time we can compute the visibility polygon of a given point with respect to the polygon collection. As an application of this structure, the visibility graph of the given polygons can be constructed in O(n2) time and space. This implies that the shortest path that connects two points in the plane and avoids the polygons in our collection can be computed in O(n2) time, improving earlier O(n2 log n) results.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127099255","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}
引用次数: 132
Efficient string matching in the presence of errors 在存在错误的情况下进行有效的字符串匹配
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.22
G. M. Landau, U. Vishkin
{"title":"Efficient string matching in the presence of errors","authors":"G. M. Landau, U. Vishkin","doi":"10.1109/SFCS.1985.22","DOIUrl":"https://doi.org/10.1109/SFCS.1985.22","url":null,"abstract":"Consider the string matching problem where differences between characters of the pattern and characters of the text are allowed. Each difference is due to either a mismatch between a character of the text and a character of the pattern or a superfluous character in the text or a superfluous character in the pattern. Given a text of length n, a pattern of length m and an integer k, we present an algorithm for finding all occurrences of the pattern in the text, each with at most k differences. The algorithm runs in O(m2 + k2n) time. Given the same input we also present an algorithm for finding all occurrences of the pattern in the text, each with at most k mismatches (superfluous characters in either the text or the pattern are not allowed). This algorithm runs in O(k(m logm + n)) time.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131806821","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}
引用次数: 76
Inferring the structure of a Markov Chain from its output 从马尔可夫链的输出推断其结构
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.34
S. Rudich
{"title":"Inferring the structure of a Markov Chain from its output","authors":"S. Rudich","doi":"10.1109/SFCS.1985.34","DOIUrl":"https://doi.org/10.1109/SFCS.1985.34","url":null,"abstract":"To make matters simpler, assume an upper bound n is known on the number of states in the Markov Chain. Fortunately, there are only a finite number of finite state machines with at most n states. For each such finite state machine, one can hypothesize that it underlies the Markov Chain. Then for any finite string of outputs from the Markov Chain, one can estimate probabilities on the transitions. These probabilities are asymptotically equal to the true probabilities (if the underlying finite state machine is the correct one) with probability 1. We attach these probabilities to the transitions and from these determine the entropy of each n-state machine. We show that with probability 1, any machine that has maximum entropy (in the limit as the length of the output string goes to infinity) is a correct guess.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131005605","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}
引用次数: 34
Verifiable secret sharing and achieving simultaneity in the presence of faults 可验证的秘密共享和在存在错误的情况下实现同时性
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.64
B. Chor, S. Goldwasser, S. Micali, B. Awerbuch
{"title":"Verifiable secret sharing and achieving simultaneity in the presence of faults","authors":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch","doi":"10.1109/SFCS.1985.64","DOIUrl":"https://doi.org/10.1109/SFCS.1985.64","url":null,"abstract":"Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given only sufficiently many pieces. 'rhe novelty is that everyone can verify that all received a \"valid\" piece of the secret without having any idea of what the secret is. One application of this tool is the simulation of simultaneous-broadcast networks on semi-synchronous broadcast networks.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132408270","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}
引用次数: 907
On information flow and sorting : New upper and lower bounds for VLSI circuits 关于信息流和排序:VLSI电路的新上下限
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.39
R. Cole, A. Siegel
{"title":"On information flow and sorting : New upper and lower bounds for VLSI circuits","authors":"R. Cole, A. Siegel","doi":"10.1109/SFCS.1985.39","DOIUrl":"https://doi.org/10.1109/SFCS.1985.39","url":null,"abstract":"This work comprises two parts: lower bounds and upper bounds in VLSI circuits. The upper bounds are for the sorting problem: we describe a large number of constructions for sorting N numbers in the range [0,M] for the standard VLSI bit model. Among other results, we attain: • VLSI sorter constructions that are within a constant factor of optimal size for almost all number ranges M (including M = N), and running times T. • A fundamentally new merging network for sorting numbers in a bit model. • New organizational approaches for optimal tuning of merging networks and the proper management of data flow. The lower bounds apply to a variety of problems. We present two new techniques for establishing lower bounds on the information flow in VLSI circuits. They are: • An averaging technique, which is easy to apply to a variety of problems, including a long standing question regarding the AT2 complexity for sorting. • A technique for constructing fooling sets in instances where our averaging method is unlikely to provide an adequate bound.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"88 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120864761","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
Automatic verification of probabilistic concurrent finite state programs 概率并发有限状态程序的自动验证
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.12
Moshe Y. Vardi
{"title":"Automatic verification of probabilistic concurrent finite state programs","authors":"Moshe Y. Vardi","doi":"10.1109/SFCS.1985.12","DOIUrl":"https://doi.org/10.1109/SFCS.1985.12","url":null,"abstract":"The verification problem for probabilistic concurrent finite-state program is to decide whether such a program satisfies its linear temporal logic specification. We describe an automata-theoretic approach, whereby probabilistic quantification over sets of computations is reduced to standard quantification over individual computations. Using new determinization construction for ω-automata, we manage to improve the time complexity of the algorithm by two exponentials. The time complexity of the final algorithm is polynomial in the size of the program and doubly exponential in the size of the specification.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121207977","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}
引用次数: 747
An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees 最小权值生成树的几乎线性时间和O(nlogn+e)消息分布算法
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.7
F. Chin, H. Ting
{"title":"An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees","authors":"F. Chin, H. Ting","doi":"10.1109/SFCS.1985.7","DOIUrl":"https://doi.org/10.1109/SFCS.1985.7","url":null,"abstract":"A distributed algorithm is presented that constructs the minimum-weight spanning tree of an undirected connected graph with distinct edge weights and distinct node identities. Initially each node knows only the weight of each of its adjacent edges. When the algorithm terminates, each node knows which of its adjacent edges are edges of the tree. For a graph with n nodes and e edges, the total number of messages required by our algorithm is at most 5nlogn+2e, and each message contains at most one edge weight or one node identity plus 3+logn bits. Although our algorithm has the same message complexity as the previously known algorithm by Gallager et al., the time complexity of our algorithm takes at most O(nG(n))+ time units, an improvement from Gallager's O(nlogn)+. A worst case O(nG(n)) is also possible.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127437590","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}
引用次数: 85
Equivalences and transformations of recursive definitions 递归定义的等价与变换
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.23
B. Courcelle
{"title":"Equivalences and transformations of recursive definitions","authors":"B. Courcelle","doi":"10.1109/SFCS.1985.23","DOIUrl":"https://doi.org/10.1109/SFCS.1985.23","url":null,"abstract":"This work presents a unified theory of recursive program schemes, context-free grammars, grammars on arbitrary algebraic structures (and actually of recursive definitions of all kind) in terms of regular systems of equations. Several equivalence relations on regular systems (depending on sets of equational axioms) are defined. They are systematically investigated and characterized (in some cases) in terms of system transformations by folding, unfolding and rewriting according to the equational algebraic laws.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124653481","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
An all pairs shortest path algorithm with expected running time O(n 2logn) 期望运行时间为O(n 2logn)的全对最短路径算法
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.6
Alistair Moffat, T. Takaoka
{"title":"An all pairs shortest path algorithm with expected running time O(n 2logn)","authors":"Alistair Moffat, T. Takaoka","doi":"10.1109/SFCS.1985.6","DOIUrl":"https://doi.org/10.1109/SFCS.1985.6","url":null,"abstract":"An algorithm is described that solves the all pairs shortest path problem for a nonnegatively weighted graph. The algorithm has an average requirement on quite general classes of random graphs of O(n2logn) time, where n is the number of vertices in the graph.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132081484","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}
引用次数: 23
Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks 在树状网格网络中求解一些具有最优或接近最优加速的图问题
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.52
Ming-Deh A. Huang
{"title":"Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks","authors":"Ming-Deh A. Huang","doi":"10.1109/SFCS.1985.52","DOIUrl":"https://doi.org/10.1109/SFCS.1985.52","url":null,"abstract":"We present a systematic approach for solving graph problems under the network models. We illustrate this approach on the mesh-of-trees networks. It is known that under the CREW PRAM model, when a undirected graph of n nodes is given by an n by n adjacency matrix, the problems of finding minimum spanning forest, connected components, and biconnected components can all be solved with optimal speedup when the number of processors p ≤ n2/log2n. We show that for these problems, the same optimal speedup can be achieved even under the much more restrictive mesh-of-trees network. We also show that for the problem of finding directed spanning forest of arbitrary digraphs and the problem of testing strong connectivity of 1-reachable digraphs, near-optimal speedup can be achieved.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125336807","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}
引用次数: 27
首页 上一页 下一页 尾页
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学术官方微信