40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)最新文献_第3页

On counting independent sets in sparse graphs 稀疏图中独立集的计数

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814593

M. Dyer, A. Frieze, M. Jerrum

引用次数: 182

A study of proof search algorithms for resolution and polynomial calculus 分辨率和多项式微积分的证明搜索算法研究

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814614

Maria Luisa Bonet, Nicola Galesi

引用次数: 70

Fairness in routing and load balancing 路由和负载均衡的公平性

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814631

J. Kleinberg, Y. Rabani, É. Tardos

{"title":"Fairness in routing and load balancing","authors":"J. Kleinberg, Y. Rabani, É. Tardos","doi":"10.1109/SFFCS.1999.814631","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814631","url":null,"abstract":"We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria interacts in a complex fashion with the optimization of network utilization and throughput; in this work, we undertake an investigation of this relationship through the framework of approximation algorithms. In this work we consider the problem of selecting paths for routing so as to provide a bandwidth allocation that is as fair as possible (in the max-min sense). We obtain the first approximation algorithms for this basic optimization problem, for single-source unsplittable routings in an arbitrary directed graph. Special cases of our model include several fundamental load balancing problems, endowing them with a natural fairness criterion to which our approach can be applied. Our results form an interesting counterpart to the work of Megiddo (1974), who considered max-min fairness for single-source fractional flow. The optimization problems in our setting become NP-complete, and require the development of new techniques for relating fractional relaxations of routing to the equilibrium constraints imposed by the fairness criterion.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114305535","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}

引用次数: 239

Noncryptographic selection protocols 非加密选择协议

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814586

U. Feige

引用次数: 100

Finding maximal repetitions in a word in linear time 在线性时间内找出单词中最大的重复次数

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814634

R. Kolpakov, G. Kucherov

引用次数: 334

Cache-oblivious algorithms 缓存无关算法

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814600

Matteo Frigo, C. Leiserson, H. Prokop, S. Ramachandran

{"title":"Cache-oblivious algorithms","authors":"Matteo Frigo, C. Leiserson, H. Prokop, S. Ramachandran","doi":"10.1109/SFFCS.1999.814600","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814600","url":null,"abstract":"This paper presents asymptotically optimal algorithms for rectangular matrix transpose, FFT, and sorting on computers with multiple levels of caching. Unlike previous optimal algorithms, these algorithms are cache oblivious: no variables dependent on hardware parameters, such as cache size and cache-line length, need to be tuned to achieve optimality. Nevertheless, these algorithms use an optimal amount of work and move data optimally among multiple levels of cache. For a cache with size Z and cache-line length L where Z=/spl Omega/(L/sup 2/) the number of cache misses for an m/spl times/n matrix transpose is /spl Theta/(1+mn/L). The number of cache misses for either an n-point FFT or the sorting of n numbers is /spl Theta/(1+(n/L)(1+log/sub Z/n)). We also give an /spl Theta/(mnp)-work algorithm to multiply an m/spl times/n matrix by an n/spl times/p matrix that incurs /spl Theta/(1+(mn+np+mp)/L+mnp/L/spl radic/Z) cache faults. We introduce an \"ideal-cache\" model to analyze our algorithms. We prove that an optimal cache-oblivious algorithm designed for two levels of memory is also optimal for multiple levels and that the assumption of optimal replacement in the ideal-cache model. Can be simulated efficiently by LRU replacement. We also provide preliminary empirical results on the effectiveness of cache-oblivious algorithms in practice.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128813170","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}

引用次数: 1106

All pairs shortest paths in undirected graphs with integer weights 权值为整数的无向图中的所有对最短路径

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814635

Avi Shoshan, Uri Zwick

引用次数: 142

On quantum and classical space-bounded processes with algebraic transition amplitudes 关于具有代数跃迁振幅的量子和经典空间有界过程

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814605

John Watrous

{"title":"On quantum and classical space-bounded processes with algebraic transition amplitudes","authors":"John Watrous","doi":"10.1109/SFFCS.1999.814605","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814605","url":null,"abstract":"We define a class of stochastic processes based on evolutions and measurements of quantum systems, and consider the complexity of predicting their long term behavior. It is shown that a very general class of decision problems regarding these stochastic processes can be efficiently solved classically in the space-bounded case. The following corollaries are implied by our main result for any space-constructible space bound s satisfying s(n)=/spl Omega/(log n): (i) any space O(s) uniform family of quantum circuit acting on s qubits and consisting of unitary gates and measurement gates defined in a typical way by matrices of algebraic numbers can be simulated by an unbounded error space O(s) ordinary (i.e., fair-coin flipping) probabilistic Turing machine, and hence by space O(s) uniform classical (deterministic) circuits of depth O(s/sup 2/) and size 2/sup 0/(s); (2) any quantum Turing machine running in space s, having arbitrary algebraic transition amplitudes, allowing unrestricted measurements during its computation, and having no restrictions on running time can be simulated by a space O(s) ordinary probabilistic Turing machine in the unbounded error setting. We also obtain the following classical result: any unbounded error probabilistic Turing machine running in space s that allows algebraic probabilities and algebraic cut-point can be simulated by a space O(s) ordinarily probabilistic Turing machine with cut-point 1/2. Our technique for handling algebraic numbers in the above simulations may be of independent interest. It is shown that any real algebraic number can be accurately approximated by a ratio of GapL functions.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132091205","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}

引用次数: 15

Improved bounds for sampling colorings 改进了采样着色的边界

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814577

Eric Vigoda

引用次数: 240

A 5/2n/sup 2/-lower bound for the rank of n/spl times/n-matrix multiplication over arbitrary fields 一个5/2n/sup 2/-下界n/spl乘以任意域上的/n矩阵乘法的秩

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814576

M. Blaser

引用次数: 34