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

{"title":"Towards analysing sequences of operations for dynamic data structures","authors":"P. Flajolet, J. Françon, J. Vuillemin","doi":"10.1109/SFCS.1979.46","DOIUrl":"https://doi.org/10.1109/SFCS.1979.46","url":null,"abstract":"This paper presents the average case performance analysis of dynamic data structures subjected to arbitrary sequences of insert, delete and query operations. To such sequences of operations are associated, for each data type, a specific continued fraction and a familly of orthogonal polynomials : Tchebycheff for stacks, Laguerre for dictionaries, Hermite for priority queues, Meixner for linear lists and Charlier for symbol tables. We define a notion of integrated cost of a data structure as the average cost over all possible sequences of operations. Our main result is an explicit expression, for each of these data structures, of the generating function for integrated costs as a linear integral transform of the generating functions for individual operation costs. We use the result to explicitly compute integrated costs of various efficient data structure implementations.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"23 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":"124480688","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}

{"title":"Division is good","authors":"Janos Simon","doi":"10.1109/SFCS.1979.13","DOIUrl":"https://doi.org/10.1109/SFCS.1979.13","url":null,"abstract":"We study the power of RAM acceptors with several instruction sets. We exhibit several instances where the availability of the division operator increases the power of the acceptors. We also show that in certain situations parallelism and stochastic features ('distributed random choices') are provably more powerful than either parallelism or randomness alone. We relate the class of probabilistic Turing machine computations to random access machines with multiplication (but without boolean vector operations). Again, the availability of integer division seems to play a crucial role in these results.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"80 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":"121876521","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}

{"title":"Efficient computation of continuous skeletons","authors":"D. Kirkpatrick","doi":"10.1109/SFCS.1979.15","DOIUrl":"https://doi.org/10.1109/SFCS.1979.15","url":null,"abstract":"An O(n lgn) algorithm is presented for the construction of skeletons of arbitrary n-line polygonal figures. This algorithm is based on an O(n lgn) algorithm for the construction of generalized Voronoi diagrams (our generalization replaces point sets by sets of line segments constrained to intersect only at end points). The generalized Voronoi diagram algorithm employs a linear time algorithm for the merging of two arbitrary (standard) Voronoi diagrams.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"12 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":"115656251","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}

{"title":"Multiple-person alternation","authors":"G. Peterson, J. Reif","doi":"10.1109/SFCS.1979.25","DOIUrl":"https://doi.org/10.1109/SFCS.1979.25","url":null,"abstract":"We generalize the alternation machines of Chandra, Kozen and Stockmeyer [1] and the private alternation machines of Reif [14] to model multiple person (team) games of incomplete information. The resulting classes of machines are \"multiple person alternation machines\". The characterization of certain time and space bounded versions of these machines demonstrate interesting relationships between ordinary time and space hierarchies (Table 1). Our results are applied to relative succintness and power questions of finite state machines and to complexity questions of parallel finite state machines. Other machine variants, including private alternating pushdown store automata and Markovian alternation machines, are discussed.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"10 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":"132534126","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}

{"title":"On simultaneous resource bounds","authors":"N. Pippenger","doi":"10.1109/SFCS.1979.29","DOIUrl":"https://doi.org/10.1109/SFCS.1979.29","url":null,"abstract":"It is well known that time bounds for machines correspond closely to size bounds for networks, and that space bounds correspond to depth bounds. It is not known whether simultaneous time and space bounds correspond to simultaneous size and depth bounds. It is shown here that simultaneous time and \"reversal\" bounds correspond to simultaneous size and depth bounds, and that simultaneous time and space bounds correspond to simultaneous size and \"width\" bounds.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"82 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":"123828124","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}

{"title":"Reductions that lie","authors":"L. Adleman, Kenneth L. Manders","doi":"10.1109/SFCS.1979.35","DOIUrl":"https://doi.org/10.1109/SFCS.1979.35","url":null,"abstract":"All of the reductions currently used in complexity theory (≤p, ≤γ, ≤R) have the property that they are honest. If A ≤ B then whatever machine M reduces A to B is such that: if on input x, M outputs y then x ε A ↔ y ε B. It would appear that this membership preserving property is intrinsic to the notion of reduction. We will see that it is not. We introduce reductions that lie and sometimes produce outputs y ε B when x ? A. We will use these reductions to further clarify the computational complexity of some problems raised by Gauss.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"78 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":"114790659","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}

{"title":"The decidability of the equivalence of context-free grammar forms","authors":"Meera Blattner","doi":"10.1109/SFCS.1979.44","DOIUrl":"https://doi.org/10.1109/SFCS.1979.44","url":null,"abstract":"In 1975 Cremers and Cinsburg published a paper that described the notion of a \"grammar form\" or a master grammar [CG]. A grammar form enables one to group grammars into grammatical families with similar production rules. All grammars dnd grammar forms discussed both in this paper and in the work of Cremers and Ginsburg are restricted to the context free. In the publication mentioned above an open problem was posed: is the weak equivalence of grammar forms deciable'? In the 1977 Colloquium on Automata and Formal Languages in Szeged, Hungary,it was announced that Ginsburg, Goldstine and Spanier believe they have a solution to the decidability of the equivalence of grammar forms [Gi]. For the past two years they have been working on a complete manuscript of that proof. A number of years ago the author of this abstract began to work with certain constructs called \"matched languages\" which seemed to lend themselves to the solution of the equivalence problem. In the abs trac t \"Inheren t Amb ig ui ties in the solution to the equivalence problem is implicit in the results. The current abstract sununarizes the techniques and develops the specific results needed to probe the equivalence problem based on the material in \"Inherent Ambiguities.\" These ideas are summarized informally in the next paragraph. A context-free grammar form G is a context-free grammar tOgetller with a set of substitutions into ~he produc~ion rules of G or llinterpretations\" that replace terminal symbols by strings of terminals and nonterminals by nonterminals with the condition that distinct nonterminals replace distinct non-terminals. The results of such substitutions are grammars. The grammatical family of the grammar form is simply the family of languages generated by these interpretations. A grammar G = (V, ,P, S) is expansive if there is a nonterminal X in G such thatX;> llXVXW, where u, v, ware in V* and Xt>w for some WEL+. If a grammar is expansive then its grammatical family is the entire set of context-free grammars while if the grammar is not expansive its grammatical family must lie within the derivation bounded grammars. The ~erivation bounded grammars are structurally between the nonterminal bounded and the expansive grammars. Many problems which are un-decidable for arbitrary context-free grammars are decidable for the nonterminal bounded due to their underlying structure which can be characterized by scmilinear sets formed by the languages they generate [CS]. A similar type of characterization …","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"29 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":"123727417","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}

{"title":"Locking policies: Safety and freedom from deadlock","authors":"M. Yannakakis, C. Papadimitriou, H. T. Kung","doi":"10.1109/SFCS.1979.22","DOIUrl":"https://doi.org/10.1109/SFCS.1979.22","url":null,"abstract":"A database consists of ellliflc.' yvhich reLlte to each other in certain ways, i,e., they satisfy cerltlin cOllsistency constraints. Many tinles, when a user updates the database, he nlay have to update tcnlporarily these constraints in orde r tC) eventuaII y t I'an s1'0 I' 111 the database in to a new, consis ten t stat C . For this I'eas 0 n, at 0 nl ic act ion s by the sa nlC user arc grou ped toget her into un its of consistency called transactiolls. In practice. a transaction nlay be either an interactive session, or the execution of a user update progranl. When, however, nlan y' transactions access and update the SanlC database cOI1curTently, there rnust he sonle kind of coordination to ensure that the resulting sequence of interleaved atonlic actions (or schedule) is correct. This TlleanS that all transactions have a consistent view of the data. and furthernlore the database is Icft at the end in sonle consistent state, This required coordination is achiccd via the COIlcurrency cOlltrol,nechalllsfn ()f the database. ('onsiderahle research effort has heen devoted recently to the theoretical aspects or the design of such a systenl !ECiLTl. SLR, SK, KS, Pa, PBR, KPI. The theory of databasc concurrency control bears a superficial silllilarity to the () pe ra ting systenl Sinspi I'ed con cLI rrency 1he 0 I'Y [K [vI, (' [) 1. The difference is lhtl{ in operating systeIllS le have cooperating, Ill0nitoring. dnd 1110n itored. processes, and the goal is to prevent had cooperation or Tllanagenlent (e.g. indetcrnlinacy. deadlocks) In databases, we have a population of' users that arc una'are of each other's pres-","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121173485","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}

{"title":"Origins of recursive function theory","authors":"S. Kleene","doi":"10.1109/MAHC.1981.10004","DOIUrl":"https://doi.org/10.1109/MAHC.1981.10004","url":null,"abstract":"For over two millennia mathematicians have used particular examples of algorithms for determining the values of functions. The notion of \"λ-definability\" was the first of what are now accepted as equivalent exact mathematical descriptions of the class of all number-theoretic functions for which algorithms exist. This article explains the notion, and traces the investigation in 1931-3 by which quite unexpectedly it was so recognized. The Herbrand-Gödel notion of \"general recursiveness\" 1934, and the Turing notion of \"computability\" 1936 were the second and third of the equivalent notions. Techniques developed in the study of λ-definability were applied in the analysis of general recursiveness and Turing computability.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125652445","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}