Parallel PROFIT/COST algorithms through fast derandomization

Saved in:
Bibliographic Details
Published in:Acta informatica 1999-03, Vol.36 (3), p.215-232
Main Authors: YIJIE HAN, IGARASHI, Y
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Information retrieval. Graph
Theoretical computing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 232
container_issue 3
container_start_page 215
container_title Acta informatica
container_volume 36
creator YIJIE HAN
IGARASHI, Y
description
doi_str_mv 10.1007/s002360050158
format article
fullrecord <record><control><sourceid>pascalfrancis_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1007_s002360050158</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1729443</sourcerecordid><originalsourceid>FETCH-LOGICAL-c220t-a1118740e5119106e405402e87d6a40c7dd6eb8b66945bc10bce023add1dab53</originalsourceid><addsrcrecordid>eNpVj81Lw0AUxBdRMFaP3nPwGvvefmQT8CLFaqGQormHl91NE0mashsP-tcbqSCehoGZYX6M3SLcI4BeBgAuUgAFqLIzFqEUPAHF1TmLAAATlYO4ZFchvM9Wc4ERe9iRp753fbx7Ldabcrkq3sqY-v3ou6kdQjy1fvzYt3FDYYqt83Sw49B90dSNh2t20VAf3M2vLli5fipXL8m2eN6sHreJ4RymhBAx0xKcQswRUidBSeAu0zYlCUZbm7o6q9M0l6o2CLVxMwlZi5ZqJRYsOc0aP4bgXVMdfTeQ_6wQqh_y6h_5nL875Y8UDPXN_Nl04a-keS6lEN8s31bJ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Parallel PROFIT/COST algorithms through fast derandomization</title><source>Springer Link</source><creator>YIJIE HAN ; IGARASHI, Y</creator><creatorcontrib>YIJIE HAN ; IGARASHI, Y</creatorcontrib><identifier>ISSN: 0001-5903</identifier><identifier>EISSN: 1432-0525</identifier><identifier>DOI: 10.1007/s002360050158</identifier><identifier>CODEN: AINFA2</identifier><language>eng</language><publisher>Berlin: Springer</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Information retrieval. Graph ; Theoretical computing</subject><ispartof>Acta informatica, 1999-03, Vol.36 (3), p.215-232</ispartof><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=1729443$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>YIJIE HAN</creatorcontrib><creatorcontrib>IGARASHI, Y</creatorcontrib><title>Parallel PROFIT/COST algorithms through fast derandomization</title><title>Acta informatica</title><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information retrieval. Graph</subject><subject>Theoretical computing</subject><issn>0001-5903</issn><issn>1432-0525</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><recordid>eNpVj81Lw0AUxBdRMFaP3nPwGvvefmQT8CLFaqGQormHl91NE0mashsP-tcbqSCehoGZYX6M3SLcI4BeBgAuUgAFqLIzFqEUPAHF1TmLAAATlYO4ZFchvM9Wc4ERe9iRp753fbx7Ldabcrkq3sqY-v3ou6kdQjy1fvzYt3FDYYqt83Sw49B90dSNh2t20VAf3M2vLli5fipXL8m2eN6sHreJ4RymhBAx0xKcQswRUidBSeAu0zYlCUZbm7o6q9M0l6o2CLVxMwlZi5ZqJRYsOc0aP4bgXVMdfTeQ_6wQqh_y6h_5nL875Y8UDPXN_Nl04a-keS6lEN8s31bJ</recordid><startdate>19990301</startdate><enddate>19990301</enddate><creator>YIJIE HAN</creator><creator>IGARASHI, Y</creator><general>Springer</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19990301</creationdate><title>Parallel PROFIT/COST algorithms through fast derandomization</title><author>YIJIE HAN ; IGARASHI, Y</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c220t-a1118740e5119106e405402e87d6a40c7dd6eb8b66945bc10bce023add1dab53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information retrieval. Graph</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>YIJIE HAN</creatorcontrib><creatorcontrib>IGARASHI, Y</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Acta informatica</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>YIJIE HAN</au><au>IGARASHI, Y</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Parallel PROFIT/COST algorithms through fast derandomization</atitle><jtitle>Acta informatica</jtitle><date>1999-03-01</date><risdate>1999</risdate><volume>36</volume><issue>3</issue><spage>215</spage><epage>232</epage><pages>215-232</pages><issn>0001-5903</issn><eissn>1432-0525</eissn><coden>AINFA2</coden><cop>Berlin</cop><pub>Springer</pub><doi>10.1007/s002360050158</doi><tpages>18</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0001-5903
ispartof Acta informatica, 1999-03, Vol.36 (3), p.215-232
issn 0001-5903
1432-0525
language eng
recordid cdi_crossref_primary_10_1007_s002360050158
source Springer Link
subjects Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Information retrieval. Graph
Theoretical computing
title Parallel PROFIT/COST algorithms through fast derandomization
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T22%3A46%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Parallel%20PROFIT/COST%20algorithms%20through%20fast%20derandomization&rft.jtitle=Acta%20informatica&rft.au=YIJIE%20HAN&rft.date=1999-03-01&rft.volume=36&rft.issue=3&rft.spage=215&rft.epage=232&rft.pages=215-232&rft.issn=0001-5903&rft.eissn=1432-0525&rft.coden=AINFA2&rft_id=info:doi/10.1007/s002360050158&rft_dat=%3Cpascalfrancis_cross%3E1729443%3C/pascalfrancis_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c220t-a1118740e5119106e405402e87d6a40c7dd6eb8b66945bc10bce023add1dab53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true