How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems (Q5204318): Difference between revisions

Latest revision as of 04:01, 21 July 2024

scientific article; zbMATH DE number 7139632

Language	Label	Description	Also known as
English	How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems	scientific article; zbMATH DE number 7139632

Statements

instance of

scholarly article

0 references

title

How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems (English)

0 references

0 references

0 references

0 references

Automata, Languages and Programming

0 references

publication date

4 December 2019

0 references

full work available at URL

https://docs.lib.purdue.edu/cstech/918

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4040055

0 references

Probabilistic counting algorithms for data base applications

0 references

Singularity Analysis of Generating Functions

0 references

Generalized Digital Trees and Their Difference—Differential Equations

0 references

Q3704890

0 references

Estimating the multiplicities of conflicts to speed their resolution in multiple access channels

0 references

Q4137395

0 references

Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation

0 references

Q4124106

0 references

Q3489457

0 references

Approximate counting : an alternative approach

0 references

Q4057549

0 references

Counting large numbers of events in small registers

0 references

How many random questions are necessary to identify \(n\) distinct objects?

0 references

How to select a loser

0 references

Limiting Distribution for the Depth in PATRICIA Tries

0 references

The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects

0 references

Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms

0 references

Patricia tries again revisited

0 references

Yet another application of a binomial recurrence. Order statistics

0 references

Identifiers

zbMATH Open document ID

1425.68474

0 references

DOI

10.1007/3-540-55719-9_75

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5204318

@@ Property / OpenAlex ID @@
+W2164983825
@@ Property / OpenAlex ID: W2164983825 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040055
@@ Property / cites work: Q4040055 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic counting algorithms for data base applications
+Normal rank
@@ Property / cites work @@
+Singularity Analysis of Generating Functions
@@ Property / cites work: Singularity Analysis of Generating Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Digital Trees and Their Difference—Differential Equations
+Normal rank
@@ Property / cites work @@
+Q3704890
@@ Property / cites work: Q3704890 / rank @@
+Normal rank
@@ Property / cites work @@
+Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
+Normal rank
@@ Property / cites work @@
+Q4137395
@@ Property / cites work: Q4137395 / rank @@
+Normal rank
@@ Property / cites work @@
+Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
+Normal rank
@@ Property / cites work @@
+Q4124106
@@ Property / cites work: Q4124106 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3489457
@@ Property / cites work: Q3489457 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate counting : an alternative approach
@@ Property / cites work: Approximate counting : an alternative approach / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting large numbers of events in small registers
+Normal rank
@@ Property / cites work @@
+How many random questions are necessary to identify \(n\) distinct objects?
+Normal rank
@@ Property / cites work @@
+How to select a loser
@@ Property / cites work: How to select a loser / rank @@
+Normal rank
@@ Property / cites work @@
+Limiting Distribution for the Depth in PATRICIA Tries
+Normal rank
@@ Property / cites work @@
+The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
+Normal rank
@@ Property / cites work @@
+Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms
+Normal rank
@@ Property / cites work @@
+Patricia tries again revisited
@@ Property / cites work: Patricia tries again revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Yet another application of a binomial recurrence. Order statistics
+Normal rank