View in EDS

Approximate counting with counters: A detailed analysis

Saved in:
Bibliographic Details
Title: Approximate counting with counters: A detailed analysis
Authors: Prodinger, Helmut1 hproding@sun.ac.za
Source: Theoretical Computer Science. Jun2012, Vol. 439, p58-68. 11p.
Subjects: Approximation algorithms, Counters (Computer science), Parameter estimation, Conditional expectations, Analysis of variance, Mathematical formulas
Abstract: Abstract: The classical algorithm approximate counting has been recently modified by Cichoń and Macyna: instead of one counter, counters are used, and the assignment of an incoming item to one of the counters is random. The parameter of interest is the sum of the values of all the counters. We analyse expectation and variance, getting explicit and asymptotic formulæ. [Copyright &y& Elsevier]
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 75472343
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Approximate counting with counters: A detailed analysis
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Prodinger%2C+Helmut%22">Prodinger, Helmut</searchLink><relatesTo>1</relatesTo><i> hproding@sun.ac.za</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Jun2012, Vol. 439, p58-68. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Approximation+algorithms%22">Approximation algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Counters+%28Computer+science%29%22">Counters (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Parameter+estimation%22">Parameter estimation</searchLink><br /><searchLink fieldCode="DE" term="%22Conditional+expectations%22">Conditional expectations</searchLink><br /><searchLink fieldCode="DE" term="%22Analysis+of+variance%22">Analysis of variance</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+formulas%22">Mathematical formulas</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: The classical algorithm approximate counting has been recently modified by Cichoń and Macyna: instead of one counter, counters are used, and the assignment of an incoming item to one of the counters is random. The parameter of interest is the sum of the values of all the counters. We analyse expectation and variance, getting explicit and asymptotic formulæ. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=75472343
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.tcs.2012.03.016
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 58
    Subjects:
      – SubjectFull: Approximation algorithms
        Type: general
      – SubjectFull: Counters (Computer science)
        Type: general
      – SubjectFull: Parameter estimation
        Type: general
      – SubjectFull: Conditional expectations
        Type: general
      – SubjectFull: Analysis of variance
        Type: general
      – SubjectFull: Mathematical formulas
        Type: general
    Titles:
      – TitleFull: Approximate counting with counters: A detailed analysis
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Prodinger, Helmut
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 29
              M: 06
              Text: Jun2012
              Type: published
              Y: 2012
          Identifiers:
            – Type: issn-print
              Value: 03043975
          Numbering:
            – Type: volume
              Value: 439
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1