Bits and relative order from residues, space efficiently
For each k, let P k be the product of the first k primes. Each integer in the interval [0, P k ) is determined by its residues modulo these k primes. We address the problems of space-efficiently computing the bits and the relative order of such numbers from their residues.
Gespeichert in:
| Veröffentlicht in: | Information processing letters 1994-05, Vol.50 (3), p.123-127 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 127 |
|---|---|
| container_issue | 3 |
| container_start_page | 123 |
| container_title | Information processing letters |
| container_volume | 50 |
| creator | Dietz, Paul F. Macarie, Ioan I. Seiferas, Joel I. |
| description | For each
k, let
P
k
be the product of the first
k primes. Each integer in the interval [0,
P
k
) is determined by its residues modulo these
k primes. We address the problems of space-efficiently computing the bits and the relative order of such numbers from their residues. |
| doi_str_mv | 10.1016/0020-0190(94)00021-2 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237275013</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0020019094000212</els_id><sourcerecordid>878662</sourcerecordid><originalsourceid>FETCH-LOGICAL-c331t-442d3541416ef3ee34d3c0abb4e4eb433da919b503e99efdd1cef4f4c1b773933</originalsourceid><addsrcrecordid>eNp9kE9LAzEQxYMoWKvfwMPiScHVzM50t7kIWvwHBS96DtlkAilttybbgt_erBWPnoYZ3nszvxHiHOQNSKhvpaxkKUHJS0VXMndQVgdiBNOmKmsAdShGf5JjcZLSIotqwmYkpg-hT4VZuyLy0vRhx0UXHcfCx26VZym4LafrIm2M5YK9Dzbwul9-nYojb5aJz37rWHw8Pb7PXsr52_Pr7H5eWkToS6LK4YSAoGaPzEgOrTRtS0zcEqIzClQ7kchKsXcOLHvyZKFtGlSIY3Gxz93E7jOf0utFt43rvFJX2FTNRMIgor3Ixi6lyF5vYliZ-KVB6uFFeuDXA79WpH9elO1jcbe3cQbYBY46DXSWXYhse-268H_AN_DSbA8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237275013</pqid></control><display><type>article</type><title>Bits and relative order from residues, space efficiently</title><source>Elsevier ScienceDirect Journals</source><creator>Dietz, Paul F. ; Macarie, Ioan I. ; Seiferas, Joel I.</creator><creatorcontrib>Dietz, Paul F. ; Macarie, Ioan I. ; Seiferas, Joel I.</creatorcontrib><description>For each
k, let
P
k
be the product of the first
k primes. Each integer in the interval [0,
P
k
) is determined by its residues modulo these
k primes. We address the problems of space-efficiently computing the bits and the relative order of such numbers from their residues.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/0020-0190(94)00021-2</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Binary representation ; Chinese remainder theorem ; Computational complexity ; Computer programming ; Information processing ; Mathematical analysis ; Parity detection ; Residue number system ; Sign detection ; Space complexity ; Studies</subject><ispartof>Information processing letters, 1994-05, Vol.50 (3), p.123-127</ispartof><rights>1994</rights><rights>Copyright Elsevier Sequoia S.A. May 9, 1994</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c331t-442d3541416ef3ee34d3c0abb4e4eb433da919b503e99efdd1cef4f4c1b773933</citedby><cites>FETCH-LOGICAL-c331t-442d3541416ef3ee34d3c0abb4e4eb433da919b503e99efdd1cef4f4c1b773933</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/0020-0190(94)00021-2$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,777,781,3537,27905,27906,45976</link.rule.ids></links><search><creatorcontrib>Dietz, Paul F.</creatorcontrib><creatorcontrib>Macarie, Ioan I.</creatorcontrib><creatorcontrib>Seiferas, Joel I.</creatorcontrib><title>Bits and relative order from residues, space efficiently</title><title>Information processing letters</title><description>For each
k, let
P
k
be the product of the first
k primes. Each integer in the interval [0,
P
k
) is determined by its residues modulo these
k primes. We address the problems of space-efficiently computing the bits and the relative order of such numbers from their residues.</description><subject>Binary representation</subject><subject>Chinese remainder theorem</subject><subject>Computational complexity</subject><subject>Computer programming</subject><subject>Information processing</subject><subject>Mathematical analysis</subject><subject>Parity detection</subject><subject>Residue number system</subject><subject>Sign detection</subject><subject>Space complexity</subject><subject>Studies</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1994</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LAzEQxYMoWKvfwMPiScHVzM50t7kIWvwHBS96DtlkAilttybbgt_erBWPnoYZ3nszvxHiHOQNSKhvpaxkKUHJS0VXMndQVgdiBNOmKmsAdShGf5JjcZLSIotqwmYkpg-hT4VZuyLy0vRhx0UXHcfCx26VZym4LafrIm2M5YK9Dzbwul9-nYojb5aJz37rWHw8Pb7PXsr52_Pr7H5eWkToS6LK4YSAoGaPzEgOrTRtS0zcEqIzClQ7kchKsXcOLHvyZKFtGlSIY3Gxz93E7jOf0utFt43rvFJX2FTNRMIgor3Ixi6lyF5vYliZ-KVB6uFFeuDXA79WpH9elO1jcbe3cQbYBY46DXSWXYhse-268H_AN_DSbA8</recordid><startdate>19940509</startdate><enddate>19940509</enddate><creator>Dietz, Paul F.</creator><creator>Macarie, Ioan I.</creator><creator>Seiferas, Joel I.</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><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>19940509</creationdate><title>Bits and relative order from residues, space efficiently</title><author>Dietz, Paul F. ; Macarie, Ioan I. ; Seiferas, Joel I.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c331t-442d3541416ef3ee34d3c0abb4e4eb433da919b503e99efdd1cef4f4c1b773933</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1994</creationdate><topic>Binary representation</topic><topic>Chinese remainder theorem</topic><topic>Computational complexity</topic><topic>Computer programming</topic><topic>Information processing</topic><topic>Mathematical analysis</topic><topic>Parity detection</topic><topic>Residue number system</topic><topic>Sign detection</topic><topic>Space complexity</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dietz, Paul F.</creatorcontrib><creatorcontrib>Macarie, Ioan I.</creatorcontrib><creatorcontrib>Seiferas, Joel I.</creatorcontrib><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>Dietz, Paul F.</au><au>Macarie, Ioan I.</au><au>Seiferas, Joel I.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Bits and relative order from residues, space efficiently</atitle><jtitle>Information processing letters</jtitle><date>1994-05-09</date><risdate>1994</risdate><volume>50</volume><issue>3</issue><spage>123</spage><epage>127</epage><pages>123-127</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>For each
k, let
P
k
be the product of the first
k primes. Each integer in the interval [0,
P
k
) is determined by its residues modulo these
k primes. We address the problems of space-efficiently computing the bits and the relative order of such numbers from their residues.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0020-0190(94)00021-2</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 1994-05, Vol.50 (3), p.123-127 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_237275013 |
| source | Elsevier ScienceDirect Journals |
| subjects | Binary representation Chinese remainder theorem Computational complexity Computer programming Information processing Mathematical analysis Parity detection Residue number system Sign detection Space complexity Studies |
| title | Bits and relative order from residues, space efficiently |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T12%3A09%3A28IST&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=Bits%20and%20relative%20order%20from%20residues,%20space%20efficiently&rft.jtitle=Information%20processing%20letters&rft.au=Dietz,%20Paul%20F.&rft.date=1994-05-09&rft.volume=50&rft.issue=3&rft.spage=123&rft.epage=127&rft.pages=123-127&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/0020-0190(94)00021-2&rft_dat=%3Cproquest_cross%3E878662%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=237275013&rft_id=info:pmid/&rft_els_id=0020019094000212&rfr_iscdi=true |