SIAM Journal on Computing最新文献_第9页

ERROR-CORRECTING DATA STRUCTURES ∗ 纠错数据结构*

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 2013-01-10 DOI: 10.1137/110834949

Victor Chen, E. Grigorescu, Ronald de Wolf

引用次数: 0

Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits 有界深度算术电路的硬随机性权衡

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 2009-10-01 DOI: 10.5555/1957995.1957999

DvirZeev, ShpilkaAmir, YehudayoffAmir

引用次数: 21

Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms 随机分而治之:改进的路径、匹配和包装算法

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 2009-05-13 DOI: 10.1137/080716475

Jianer Chen, Joachim Kneis, Songjian Lu, D. Mölle, Stefan Richter, P. Rossmanith, S. Sze, Fenghui Zhang

引用次数: 67

Size-Space Tradeoffs for Resolution 分辨率的大小空间权衡

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 2009-02-01 DOI: 10.1137/080723880

Eli Ben-Sasson

引用次数: 10

Special Issue Dedicated to the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2005) 第37届ACM计算理论年会(STOC 2005)特刊

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 2008-05-01 DOI: 10.1137/SMJCAT000038000002000vii000001

Ronald Fagin, Anupam Gupta, Ravi Kumar, R. O'Donnell

{"title":"Special Issue Dedicated to the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2005)","authors":"Ronald Fagin, Anupam Gupta, Ravi Kumar, R. O'Donnell","doi":"10.1137/SMJCAT000038000002000vii000001","DOIUrl":"https://doi.org/10.1137/SMJCAT000038000002000vii000001","url":null,"abstract":"This volume comprises the polished and fully refereed versions of a selection of papers presented at the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2005), held in Baltimore, Maryland, May 22-24, 2005. Unrefereed preliminary versions of the papers presented at the symposium appeared in the proceedings of the meeting, published by ACM. The symposium was sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). \u0000 \u0000The STOC 2005 Program Committee consisted of Gerth Stolting Brodal, Harry Buhrman, Jin-Yi Cai, Cynthia Dwork, Ronald Fagin (chair), Martin Farach-Colton, Anupam Gupta, Sariel Har-Peled, Russell Impagliazzo, Kamal Jain, Adam Tauman Kalai, David Karger, Claire Kenyon, Subhash Khot, Ravi Kumar, Moni Naor, Ryan O'Donnell, Toniann Pitassi, Tim Roughgarden, Alistair Sinclair, and Amnon Ta-Shma. \u0000 \u0000Out of 290 “Extended Abstracts” submitted to the STOC 2005 Program Committee, 84 were selected for presentation at the symposium. The present volume includes 9 of these papers that were invited to this volume. All papers were refereed in accordance with the SIAM Journal on Computing's stringent standards, and these papers were substantially updated in the process. We take this opportunity to thank all the referees whose anonymous work has significantly contributed to the value of this volume. \u0000 \u0000Ronald Fagin, the Program Chair of the 2005 STOC Conference, invited three other members of the Program Committee (Anupam Gupta, Ravi Kumar, and Ryan O'Donnell) to assist in editing this special issue of the of the SIAM Journal on Computing, and all agreed. We feel that it was an honor to edit this issue.","PeriodicalId":49532,"journal":{"name":"SIAM Journal on Computing","volume":"205 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73370499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Chosen-Ciphertext Security from Identity-Based Encryption 从基于身份的加密中选择密文安全性

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 2006-12-01 DOI: 10.1137/S009753970544713X

D. Boneh, Ran Canetti, S. Halevi, Jonathan Katz

引用次数: 36

A Probabilistic Approach to the Dichotomy Problem 二分类问题的概率方法

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 2006-09-01 DOI: 10.1137/S0097539703435492

Tomasz Łuczak, J. N. caron, etr caron, il

引用次数: 15

A 2-Approximation Algorithm for the Directed Multiway Cut Problem 有向多路切割问题的2-逼近算法

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 2002-02-01 DOI: 10.1137/S009753979732147X

Siam Staff

引用次数: 19

Total Coloring With $Delta + mboxlowercasepoly(log Delta)$ Colors 总着色与$Delta + mboxlowercasepoly(log Delta)$颜色

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 1999-02-21 DOI: 10.1137/S0097539795294578

H. Hind, Michael Molloy, B. Reed

引用次数: 10

The Computational Power of Frictional Mechanical Systems 摩擦机械系统的计算能力

IF 1.6 3区计算机科学

SIAM Journal on Computing Pub Date : 1998-08-01 DOI: 10.1201/9781439863886-24

John Z. Sun

{"title":"The Computational Power of Frictional Mechanical Systems","authors":"John Z. Sun","doi":"10.1201/9781439863886-24","DOIUrl":"https://doi.org/10.1201/9781439863886-24","url":null,"abstract":"In this paper we deene a class of mechanical systems consisting of rigid objects (deened by linear or quadratic surface patches) connected by frictional contact linkages between surfaces. (This class of mechanisms is similar to the Analytical Engine developed by Babbage in 1800s except that we assume frictional surfaces instead of toothed gears.) We prove that a universal Turing Machine (TM) can be simulated by a (universal) frictional mechanical system in this class. Our universal frictional mechanical system has the property that it can reach a distinguished nal conngura-tion through a sequence of legal movements if and only if the universal TM accepts the input string encoded by its initial connguration. There are two implications from this result. First, the mover's problem is undecid-able when there are frictional linkages. Second, a mechanical computer can be constructed that has the computational power of any conventional electronic computer and yet has only a constant number of mechanical parts. Previous constructions for mechanical computing devices (such as Babbage's Analytical Engine) either provided no general construction for nite state control or the control was provided by electronic devices (as was common in electro-mechanical computers such as Mark I subsequent to Turing's result). Our result seems to be the rst to provide a general proof of the simulation of a universal TM via a purely mechanical mechanism. In addition, we discuss the universal frictional mechanical system in the context of an error model that allows error up to in each mechanical operation. First, we show that for a universal TM M, a frictional mechanical system of this-error model can be constructed such that, given any space bound S, the system can simulate the computation of M on any input string ! if M decides ! in space bound S, provided that < 2 ?cS for some constant c. Second, we show that, for any universal TM M and space bound S, if we let = O(S ?1), there exists a frictional mechanical system in the-error model that can simulate M on any input which M decides in space bound S.","PeriodicalId":49532,"journal":{"name":"SIAM Journal on Computing","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"1998-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88962007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3