Loading…

Transforming comparison model lower bounds to the parallel-random-access-machine

We provide general transformations of lower bounds in Valiant's parallel-comparison-decision-tree model to lower bounds in the priority concurrent-read concurrent-write parallel-random-access-machine model. The proofs rely on standard Ramsey-theoretic arguments that simplify the structure of th...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters 1997-04, Vol.62 (2), p.103-110
Main Authors:	Breslauer, Dany, Czumaj, Artur, Dubhashi, Devdatt P., der Heide, Friedhelm Meyer auf
Format:	Article
Language:	English
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Automata. Abstract machines. Turing machines Comparative analysis Comparison model Computer science control theory systems Exact sciences and technology Information processing Lower bounds Mathematical models PRAM model Ramsey theory Studies Theoretical computing
Citations:	Items that this one cites Items that cite this one
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

cited_by	cdi_FETCH-LOGICAL-c363t-f1ab0f6f82026008899179c7122ef3c381a8b7530937b91a812bd9e756c10d113
cites	cdi_FETCH-LOGICAL-c363t-f1ab0f6f82026008899179c7122ef3c381a8b7530937b91a812bd9e756c10d113
container_end_page	110
container_issue	2
container_start_page	103
container_title	Information processing letters
container_volume	62
creator	Breslauer, Dany Czumaj, Artur Dubhashi, Devdatt P. der Heide, Friedhelm Meyer auf
description	We provide general transformations of lower bounds in Valiant's parallel-comparison-decision-tree model to lower bounds in the priority concurrent-read concurrent-write parallel-random-access-machine model. The proofs rely on standard Ramsey-theoretic arguments that simplify the structure of the computation by restricting the input domain. The transformation of comparison model lower bounds, which are usually easier to obtain, to the parallel-random-access-machine, unifies some known lower bounds and gives new lower bounds for several problems.
doi_str_mv	10.1016/S0020-0190(97)00032-X
format	article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237279502</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S002001909700032X</els_id><sourcerecordid>12687386</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-f1ab0f6f82026008899179c7122ef3c381a8b7530937b91a812bd9e756c10d113</originalsourceid><addsrcrecordid>eNqFkEtLAzEUhYMoWKs_QRjEhS6iN0lnMlmJFF9QULBCdyGTSWzKzKQmU8V_b_qgW1eXC985h3MQOidwQ4AUt-8AFDAQAVeCXwMAo3h2gAak5BQXhIhDNNgjx-gkxkWCihHjA_Q2DaqL1ofWdZ-Z9u1SBRd9l7W-Nk3W-B8Tssqvujpmvc_6uckSoZrGNDgpa99ipbWJEbdKz11nTtGRVU00Z7s7RB-PD9PxM568Pr2M7ydYs4L12BJVgS1sSYEWAGUpBOFCc0KpsUyzkqiy4jkDwXgl0kNoVQvD80ITqAlhQ3Sx9V0G_7UysZcLvwpdipSUccpFDjRB-RbSwccYjJXL4FoVfiUBud5ObraT62Gk4HKznZwl3eXOXEWtGpuaahf3YsoBOBsl7G6LmVT025kgo3am06Z2wehe1t79E_QHNUaCGw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237279502</pqid></control><display><type>article</type><title>Transforming comparison model lower bounds to the parallel-random-access-machine</title><source>ScienceDirect Freedom Collection</source><source>Backfile Package - Computer Science (Legacy) [YCS]</source><source>Backfile Package - Mathematics (Legacy) [YMT]</source><creator>Breslauer, Dany ; Czumaj, Artur ; Dubhashi, Devdatt P. ; der Heide, Friedhelm Meyer auf</creator><creatorcontrib>Breslauer, Dany ; Czumaj, Artur ; Dubhashi, Devdatt P. ; der Heide, Friedhelm Meyer auf</creatorcontrib><description>We provide general transformations of lower bounds in Valiant's parallel-comparison-decision-tree model to lower bounds in the priority concurrent-read concurrent-write parallel-random-access-machine model. The proofs rely on standard Ramsey-theoretic arguments that simplify the structure of the computation by restricting the input domain. The transformation of comparison model lower bounds, which are usually easier to obtain, to the parallel-random-access-machine, unifies some known lower bounds and gives new lower bounds for several problems.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/S0020-0190(97)00032-X</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Automata. Abstract machines. Turing machines ; Comparative analysis ; Comparison model ; Computer science; control theory; systems ; Exact sciences and technology ; Information processing ; Lower bounds ; Mathematical models ; PRAM model ; Ramsey theory ; Studies ; Theoretical computing</subject><ispartof>Information processing letters, 1997-04, Vol.62 (2), p.103-110</ispartof><rights>1997</rights><rights>1997 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Apr 28, 1997</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-f1ab0f6f82026008899179c7122ef3c381a8b7530937b91a812bd9e756c10d113</citedby><cites>FETCH-LOGICAL-c363t-f1ab0f6f82026008899179c7122ef3c381a8b7530937b91a812bd9e756c10d113</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S002001909700032X$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>315,783,787,3436,3571,27936,27937,45984,46015</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2700734$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Breslauer, Dany</creatorcontrib><creatorcontrib>Czumaj, Artur</creatorcontrib><creatorcontrib>Dubhashi, Devdatt P.</creatorcontrib><creatorcontrib>der Heide, Friedhelm Meyer auf</creatorcontrib><title>Transforming comparison model lower bounds to the parallel-random-access-machine</title><title>Information processing letters</title><description>We provide general transformations of lower bounds in Valiant's parallel-comparison-decision-tree model to lower bounds in the priority concurrent-read concurrent-write parallel-random-access-machine model. The proofs rely on standard Ramsey-theoretic arguments that simplify the structure of the computation by restricting the input domain. The transformation of comparison model lower bounds, which are usually easier to obtain, to the parallel-random-access-machine, unifies some known lower bounds and gives new lower bounds for several problems.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Comparative analysis</subject><subject>Comparison model</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information processing</subject><subject>Lower bounds</subject><subject>Mathematical models</subject><subject>PRAM model</subject><subject>Ramsey theory</subject><subject>Studies</subject><subject>Theoretical computing</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNqFkEtLAzEUhYMoWKs_QRjEhS6iN0lnMlmJFF9QULBCdyGTSWzKzKQmU8V_b_qgW1eXC985h3MQOidwQ4AUt-8AFDAQAVeCXwMAo3h2gAak5BQXhIhDNNgjx-gkxkWCihHjA_Q2DaqL1ofWdZ-Z9u1SBRd9l7W-Nk3W-B8Tssqvujpmvc_6uckSoZrGNDgpa99ipbWJEbdKz11nTtGRVU00Z7s7RB-PD9PxM568Pr2M7ydYs4L12BJVgS1sSYEWAGUpBOFCc0KpsUyzkqiy4jkDwXgl0kNoVQvD80ITqAlhQ3Sx9V0G_7UysZcLvwpdipSUccpFDjRB-RbSwccYjJXL4FoVfiUBud5ObraT62Gk4HKznZwl3eXOXEWtGpuaahf3YsoBOBsl7G6LmVT025kgo3am06Z2wehe1t79E_QHNUaCGw</recordid><startdate>19970428</startdate><enddate>19970428</enddate><creator>Breslauer, Dany</creator><creator>Czumaj, Artur</creator><creator>Dubhashi, Devdatt P.</creator><creator>der Heide, Friedhelm Meyer auf</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19970428</creationdate><title>Transforming comparison model lower bounds to the parallel-random-access-machine</title><author>Breslauer, Dany ; Czumaj, Artur ; Dubhashi, Devdatt P. ; der Heide, Friedhelm Meyer auf</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-f1ab0f6f82026008899179c7122ef3c381a8b7530937b91a812bd9e756c10d113</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Comparative analysis</topic><topic>Comparison model</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information processing</topic><topic>Lower bounds</topic><topic>Mathematical models</topic><topic>PRAM model</topic><topic>Ramsey theory</topic><topic>Studies</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Breslauer, Dany</creatorcontrib><creatorcontrib>Czumaj, Artur</creatorcontrib><creatorcontrib>Dubhashi, Devdatt P.</creatorcontrib><creatorcontrib>der Heide, Friedhelm Meyer auf</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Breslauer, Dany</au><au>Czumaj, Artur</au><au>Dubhashi, Devdatt P.</au><au>der Heide, Friedhelm Meyer auf</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Transforming comparison model lower bounds to the parallel-random-access-machine</atitle><jtitle>Information processing letters</jtitle><date>1997-04-28</date><risdate>1997</risdate><volume>62</volume><issue>2</issue><spage>103</spage><epage>110</epage><pages>103-110</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>We provide general transformations of lower bounds in Valiant's parallel-comparison-decision-tree model to lower bounds in the priority concurrent-read concurrent-write parallel-random-access-machine model. The proofs rely on standard Ramsey-theoretic arguments that simplify the structure of the computation by restricting the input domain. The transformation of comparison model lower bounds, which are usually easier to obtain, to the parallel-random-access-machine, unifies some known lower bounds and gives new lower bounds for several problems.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0020-0190(97)00032-X</doi><tpages>8</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0020-0190
ispartof	Information processing letters, 1997-04, Vol.62 (2), p.103-110
issn	0020-0190 1872-6119
language	eng
recordid	cdi_proquest_journals_237279502
source	ScienceDirect Freedom Collection; Backfile Package - Computer Science (Legacy) [YCS]; Backfile Package - Mathematics (Legacy) [YMT]
subjects	Algorithmics. Computability. Computer arithmetics Applied sciences Automata. Abstract machines. Turing machines Comparative analysis Comparison model Computer science control theory systems Exact sciences and technology Information processing Lower bounds Mathematical models PRAM model Ramsey theory Studies Theoretical computing
title	Transforming comparison model lower bounds to the parallel-random-access-machine
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-11-13T19%3A44%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Transforming%20comparison%20model%20lower%20bounds%20to%20the%20parallel-random-access-machine&rft.jtitle=Information%20processing%20letters&rft.au=Breslauer,%20Dany&rft.date=1997-04-28&rft.volume=62&rft.issue=2&rft.spage=103&rft.epage=110&rft.pages=103-110&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/S0020-0190(97)00032-X&rft_dat=%3Cproquest_cross%3E12687386%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c363t-f1ab0f6f82026008899179c7122ef3c381a8b7530937b91a812bd9e756c10d113%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=237279502&rft_id=info:pmid/&rfr_iscdi=true