Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)最新文献_第6页

Which crossing number is it, anyway? [computational geometry] 到底是哪个十字路口的号码?(计算几何)

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743512

J. Pach, G. Tóth

引用次数: 1

Overcoming the memory bottleneck in suffix tree construction 克服后缀树结构中的内存瓶颈

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743441

Martín Farach-Colton, P. Ferragina, S. Muthukrishnan

{"title":"Overcoming the memory bottleneck in suffix tree construction","authors":"Martín Farach-Colton, P. Ferragina, S. Muthukrishnan","doi":"10.1109/SFCS.1998.743441","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743441","url":null,"abstract":"The suffix tree of a string is the fundamental data structure of string processing. Recent focus on massive data sets has sparked interest in overcoming the memory bottlenecks of known algorithms for building suffix trees. Our main contribution is a new algorithm for suffix tree construction in which we choreograph almost all disk accesses to be via the sort and scan primitives. This algorithm achieves optimal results in a variety of sequential and parallel computational models. Two of our results are: In the traditional external memory model, in which only the number of disk accesses is counted, we achieve an optimal algorithm, both for single and multiple disk cases. This is the first optimal algorithm known for either model. Traditional disk page access counting does not differentiate between random page accesses and block transfers involving several consecutive pages. This difference is routinely exploited by expert programmers to get fast algorithms on real machines. We adopt a simple accounting scheme and show that our algorithm achieves the same optimal tradeoff for block versus random page accesses as the one we establish for sorting.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132280883","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}

引用次数: 73

Decidability of bisimulation equivalence for equational graphs of finite out-degree 有限出次方程图双模拟等价的可判定性

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743435

Géraud Sénizergues

引用次数: 76

Geometric separator theorems and applications 几何分隔定理及其应用

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743449

Warren D. Smith, N. Wormald

引用次数: 84

Fast Monte-Carlo algorithms for finding low-rank approximations 寻找低秩近似的快速蒙特卡罗算法

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743487

A. Frieze, R. Kannan, S. Vempala

引用次数: 774

The complexity of the approximation of the bandwidth problem 复杂度近似的带宽问题

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743431

Walter Unger

引用次数: 53

Towards an optimal bit-reversal permutation program 一个最优的位反转排列程序

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743505

L. Carter, K. Gatlin

引用次数: 26

Jitter control in QoS networks QoS网络中的抖动控制

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743428

Y. Mansour, B. Patt-Shamir

{"title":"Jitter control in QoS networks","authors":"Y. Mansour, B. Patt-Shamir","doi":"10.1109/SFCS.1998.743428","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743428","url":null,"abstract":"We study jitter control in networks guaranteeing quality of service (QoS). Jitter measures variability of delivery times in packet streams. We propose on-line algorithms that control jitter and compare their performance to the best possible (by an off-line algorithm) for any given arrival sequence. For delay jitter, where the goal is to minimize the difference between delay times of different packets, we give an on-line algorithm using buffer size of 2B which guarantees the same delay-jitter as an off-line algorithm using buffer space B. We show that 2B space is the minimum space required by any on-line algorithm to provide delay-jitter related to the best possible delay-jitter using B buffer space. We also show that the guarantees made by our online algorithm hold even for distributed implementations, where the total buffer space is distributed along the path of the connection, provided that the input stream satisfies a certain simple property. For rate jitter, where the goal is to minimize the difference between inter-arrival times, we develop an on-line algorithm using a buffer of size 2B+h for any h/spl ges/1, and compare its jitter to the jitter of an optimal off-line algorithm using buffer size B. Our algorithm guarantees that the difference is bounded by a term proportional to B/h. We also prove that 2B space is necessary for on-line algorithms with non trivial guarantees for rate-jitter control.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130670493","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}

引用次数: 97

Algorithms to tile the infinite grid with finite clusters 用有限簇平铺无限网格的算法

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743437

M. Szegedy

引用次数: 47

Probabilistically checkable proofs with low amortized query complexity 具有低平摊查询复杂度的概率可检验证明

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743425

M. Sudan, L. Trevisan

{"title":"Probabilistically checkable proofs with low amortized query complexity","authors":"M. Sudan, L. Trevisan","doi":"10.1109/SFCS.1998.743425","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743425","url":null,"abstract":"The error probability of Probabilistically Checkable Proof (PCP) systems can be made exponentially small in the number of queries by using sequential repetition. In this paper we are interested in determining the precise rate at which the error goes down in an optimal protocol, and we make substantial progress toward a tight resolution of this question. A PCP verifier uses q~ amortized query bits if, for some t, it makes q~t queries and has error probability at most 2/sup -t/. A PCP characterization of NP using 2.5 amortized query bits is known, and, unless P=NP, no such characterization is possible using 1 amortized query bits. We present a PCP characterization of NP that uses roughly 1.5 amortized query bits. Our result has two main implications. Separating PCP from 2-Provers 1-Round: In the 2-Provers 1-Round (2P1R) model the verifier has access to two oracles (or provers) and can make one query to each oracle. Each answer is a string of l bits (l is called the answer size). A 2P1R protocol with answer size l can be simulated by a PCP that reads 21 bits; we show that the converse does not hold for l/spl ges/7, unless P=NP. No such separation was known before. The Max kCSP problem: The Boolean constraint satisfaction problem with constraints involving at most k variables, usually called Max kCSP, is known to be hard to approximate within a factor 2/sup -4k/, and a 2.2/sup -k/-approximation algorithm is also known. We prove that Max kCSP is NP-hard to approximate within a factor of roughly 2/sup -2k/3/.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131970049","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}

引用次数: 35