View in EDS PDF Full Text

The Input/ Output Complexity of Sorting and Related Problems.

Saved in:
Bibliographic Details
Title: The Input/ Output Complexity of Sorting and Related Problems.
Authors: Aggarwal, Alok, Vitter, Jeffrey Scott
Source: Communications of the ACM. Sep88, Vol. 31 Issue 9, p1116-1127. 12p. 2 Diagrams.
Subjects: Dynamic storage allocation (Computer science), Sorting (Electronic computers), Algorithms, Mathematical optimization
Abstract: Provides tight upper and lower bounds, up to a constant factor, for the number of inputs and outputs between internal memory and secondary storage required for sorting-related problems. Secondary storage modeled as a magnetic disk; Optimal algorithms for the problems; Sorting algorithms using the same number of inputs and outputs.
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5562148
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The Input/ Output Complexity of Sorting and Related Problems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Aggarwal%2C+Alok%22">Aggarwal, Alok</searchLink><br /><searchLink fieldCode="AR" term="%22Vitter%2C+Jeffrey+Scott%22">Vitter, Jeffrey Scott</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Sep88, Vol. 31 Issue 9, p1116-1127. 12p. 2 Diagrams.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Dynamic+storage+allocation+%28Computer+science%29%22">Dynamic storage allocation (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Sorting+%28Electronic+computers%29%22">Sorting (Electronic computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Provides tight upper and lower bounds, up to a constant factor, for the number of inputs and outputs between internal memory and secondary storage required for sorting-related problems. Secondary storage modeled as a magnetic disk; Optimal algorithms for the problems; Sorting algorithms using the same number of inputs and outputs.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5562148
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/48529.48535
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 1116
    Subjects:
      – SubjectFull: Dynamic storage allocation (Computer science)
        Type: general
      – SubjectFull: Sorting (Electronic computers)
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Mathematical optimization
        Type: general
    Titles:
      – TitleFull: The Input/ Output Complexity of Sorting and Related Problems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Aggarwal, Alok
      – PersonEntity:
          Name:
            NameFull: Vitter, Jeffrey Scott
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep88
              Type: published
              Y: 1988
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 31
            – Type: issue
              Value: 9
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1