[1993] The 2nd Israel Symposium on Theory and Computing Systems最新文献

Competitive algorithms for the weighted server problem 加权服务器问题的竞争算法

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253459

A. Fiat, Moty Ricklin

引用次数: 51

Optimal speedup of Las Vegas algorithms 拉斯维加斯算法的最佳加速

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253477

M. Luby, A. Sinclair, David Zuckerman

引用次数: 566

A well-characterized approximation problem 一个很好表征的近似问题

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253463

J. Håstad, S. Phillips, S. Safra

引用次数: 36

Efficient on-line call control algorithms 高效的在线呼叫控制算法

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253460

J. Garay, I. Gopal, S. Kutten, Y. Mansour, M. Yung

引用次数: 88

Zero-one permanent is not=P-complete, a simpler proof 0 - 1永久不= p完全，一个更简单的证明

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253457

A. Ben-Dor, S. Halevi

引用次数: 25

The Las-Vegas processor identity problem (how and when to be unique) 拉斯维加斯处理器标识问题(如何以及何时是唯一的)

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253474

S. Kutten, R. Ostrovsky, B. Patt-Shamir

引用次数: 23

On fixed-parameter tractability and approximability of NP-hard optimization problems NP-hard优化问题的定参数可跟踪性和近似性

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253478

L. Cai, Jianer Chen

引用次数: 116

Hot-potato worm routing is almost as easy as store-and-forward packet routing 热土豆蠕虫路由几乎和存储转发数据包路由一样简单

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253469

I. Newman, A. Schuster

{"title":"Hot-potato worm routing is almost as easy as store-and-forward packet routing","authors":"I. Newman, A. Schuster","doi":"10.1109/ISTCS.1993.253469","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253469","url":null,"abstract":"The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-potato style is a desired form of communication in high-speed optical interconnection networks. The authors develop a simple method for the design of parallel hot-potato worm routing algorithms. The basic approach is to simulate known packet routing algorithms, so that in each step worms are moved around instead of packets. For hot-potato permutation routing of worms of size k the authors have the following results. They get a O(k/sup 2.5/n) algorithm for the n*n mesh, and a O(k/sup 1.5/n) algorithm for the corresponding offline problem. For the 2/sup n/-nodes hypercube they get a O(k/sup 3/n log /sup 2/n) deterministic algorithm, and a O(k/sup 3/n) randomized algorithm. Although the results are given for permutation routing on the mesh and the hypercube, the general method can be applied to many other networks and to more general communication patterns as well. Moreover, once better routing algorithms are found for the underlying network, the worm routing algorithm improves, too.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122919250","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}

引用次数: 4

A formalization of superposition refinement 叠加细化的形式化

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253467

K. Sere

引用次数: 1

Using selective path-doubling for parallel shortest-path computations 使用选择性路径加倍并行最短路径计算

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253481

E. Cohen

{"title":"Using selective path-doubling for parallel shortest-path computations","authors":"E. Cohen","doi":"10.1109/ISTCS.1993.253481","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253481","url":null,"abstract":"The author considers parallel shortest-path computations in weighted undirected graphs G=(V,E), where n= mod V mod and m= mod E mod . The standard path-doubling algorithms consists of O(log n) phases, where in each phase, for every triple of vertices (u/sub 1/, u/sub 2/, u/sub 3/) in V/sup 3/, she updates the distance between u/sub 1/ and u/sub 3/ to be no more than the sum of the previous-phase distances between (u/sub 1/, u/sub 2/) and (u/sub 2/, u/sub 3/). The work performed in each phase, O(n/sup 3/) (linear in the number of triples), is currently the bottleneck in NC shortest-paths computations. She introduces a new algorithm that for delta =o(n), considers only O(n delta /sup 2/) triples. Roughly, the resulting NC algorithm performs O(n delta /sup 2/) work and augments E with O(n delta ) new weighted edges such that between every pair of vertices, there exists a minimum weight path of size (number of edges) O(n/ delta ) (where O(f) identical to O(f polylog n)). To compute shortest-paths, she applies work-efficient algorithms, where the time depends on the size of shortest paths, to the augmented graph. She obtains a O(t) time O( mod S mod n/sup 2/+n/sup 3//t/sup 2/) work deterministic PRAM algorithm for computing shortest-paths form mod S mod sources to all other vertices, where t<or=n is a parameter. When the ratio of the largest edge weight and the smallest edge weight is n/sup O(polylog/ /sup n)/, the algorithm computes shortest paths. When weights are arbitrary, it computes paths within a factor of 1+n/sup - Omega (polylog/ /sup n)/ of shortest. This improves over previous bounds. She achieves improved O( mod S mod (n/sup 2//t+m)+n/sup 3//t/sup 2/) work for computing approximate distances to within a factor of (1+ in ) (for any fixed in ).<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133157579","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}

引用次数: 41