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

A robust and verifiable cryptographically secure election scheme 一个健壮且可验证的加密安全选举方案

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.2

Josh Benaloh, M. Fischer

引用次数: 513

Fixed-point extensions of first-order logic 一阶逻辑的不动点扩展

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.27

Y. Gurevich, S. Shelah

引用次数: 292

Slimming down search structures: A functional approach to algorithm design 精简搜索结构:算法设计的功能方法

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.51

B. Chazelle

引用次数: 14

Collective coin flipping, robust voting schemes and minima of Banzhaf values 集体抛硬币，强大的投票方案和最小的班扎夫值

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.15

M. Ben-Or, N. Linial

{"title":"Collective coin flipping, robust voting schemes and minima of Banzhaf values","authors":"M. Ben-Or, N. Linial","doi":"10.1109/SFCS.1985.15","DOIUrl":"https://doi.org/10.1109/SFCS.1985.15","url":null,"abstract":"The power of players in a collective decision process is a central issue in Mathematical Economics and Game Theory. Similar issues arise in Computer Science in the study of distributed, fault tolerant computations when several processes, some perhaps faulty, have to reach agreement. In the present article we study voting schemes which are relatively immune to the presence of unfair players. In particular, we discuss how to perform collective coin flipping which is only slightly biased despite the presence of unfair players. Mathematically this corresponds to problems concerning the minima of Banzhaf values in certain n -person games. These are measures of power studied in Game Theory. It is quite remarkable that while dictatorial voting games are, of course, the most sensitive to the presence of unfair players, some voting schemes that we propose here are significantly more robust than majority voting. Coin flipping was selected as a study case because of its simplicity and because collective coin flipping is widely used in randomized algorithms for distributed computations. It is our feeling that Game Theory has much to contribute to Computer Science and we are sure that further applications will be found.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"31 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":"117091644","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}

引用次数: 146

Unbiased bits from sources of weak randomness and probabilistic communication complexity 来自弱随机性和概率通信复杂性来源的无偏比特

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.62

B. Chor, Oded Goldreich

引用次数: 652

Multi-layer grid embeddings 多层网格嵌入

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.37

A. Aggarwal, M. Klawe, David Lichtenstein, N. Linial, A. Wigderson

{"title":"Multi-layer grid embeddings","authors":"A. Aggarwal, M. Klawe, David Lichtenstein, N. Linial, A. Wigderson","doi":"10.1109/SFCS.1985.37","DOIUrl":"https://doi.org/10.1109/SFCS.1985.37","url":null,"abstract":"In this paper we propose two new multi-layer grid models for VLSI layout, both of which take into account the number of contact cuts used. For the first model in which nodes \"exist\" only on one layer, we prove a tight area x (number of contact cuts) = Θ(n2) trade-off for embedding any degree 4 n-node planar graph in two layers. For the second model in which nodes \"exist\" simultaneously on all layers, we prove a number of bounds on the area needed to embed graphs using no contact cuts. For example we prove that any n-node graph which is the union of two planar subgraphs can be embedded on two layers in O(n2) area without contact cuts. This bound is tight even if more layers and an unbounded number of contact cuts are allowed. We also show that planar graphs of bounded degree can be embedded on two layers in O(n1.6) area without contact cuts. These results use some interesting new results on embedding graphs in a single layer. In particular we give an O(n2) area embedding of planar graphs such that each edge makes a constant number of turns, and each exterior vertex has a path to the perimeter of the grid making a constant number of turns. We also prove a tight Ω(n3) lower bound on the area of grid n-permutation networks.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"5 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":"123628238","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

Improved processor bounds for algebraic and combinatorial problems in RNC RNC中代数和组合问题的改进处理器界

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.33

Z. Galil, V. Pan

引用次数: 26

On minima of function, intersection patterns of curves, and davenport-schinzel sequences 函数的极小值，曲线的相交模式，和davenport-schinzel序列

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.40

M. Sharir, R. Livne

引用次数: 18

Nondeterministic versus probabilistic linear search algorithms 不确定性与概率线性搜索算法

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.38

F. Heide

{"title":"Nondeterministic versus probabilistic linear search algorithms","authors":"F. Heide","doi":"10.1109/SFCS.1985.38","DOIUrl":"https://doi.org/10.1109/SFCS.1985.38","url":null,"abstract":"The \"component counting lower bound\" known for deterministic linear search algorithms (LSA's) also holds for their probabilistic versions (PLSA's) for many problems, even if two-sided error is allowed, and if one does not charge for probabilistic choice. This implies lower bounds on PLSA's for e.g. the element distinctness problem (n log n) or the knapsack problem (n2). These results yield the first separations between probabilistic and non-deterministic LSA's, because the above problems are non-deterministically much easier. Previous lower bounds for PLSA's either only worked for one-sided error \"on the nice side\", i.e. on the side where the problems are even non-deterministically hard, or only for probabilistic comparison trees. The proof of the lower bound differs fundamentally from all known lower bounds for LSA's or PLSA's, because it does not reduce the problem to a combinatorial one but argues extensively about e.g. a non-discrete measure for similarity of sets in Rn. This lower bound result solves an open problem posed by Manber and Tompa as well as by Snir. Furthermore, a PLSA for n input variables with two-sided error and expected runtime T can be simulated by a (deterministic) LSA in T2n steps. This proves that the gaps between probabilistic and deterministic LSA's shown by Snir cannot be too large. As this simulation even holds for algebraic computation trees we show that probabilistic and deterministic versions of this model are polynomially related. This is a weaker version of a result due to the author which shows that in case of LSA's, even the non-deterministic and deterministic versions are polynomially related.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"32 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":"132876595","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}

引用次数: 14

Geometrical realization of set systems and probabilistic communication complexity 集合系统的几何实现与概率通信复杂度

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI: 10.1109/SFCS.1985.30

N. Alon, P. Frankl, V. Rödl

引用次数: 106