The DOI matches its Crossref record.
Average Case Analysis of Algorithms on Sequences
Abstract
From the Publisher: While most algorithm designs are finalized toward worst case scenarios where they have to cope efficiently with unrealistic inputs, the average case solution is a probabilistic approach that allows for the possibility that a simple algorithm would suffice. This book provides a unique overview of the tools and techniques used in average case analysis of algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
Flajolet, P., Fusy, É., Gandouet, O., & Meunier, F. (2007) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.3545 · Cited by 695
Falkon: a Fast and Light-weight tasK executiON framework
Raicu, I., Zhao, Y., Dumitrescu, C., Foster, I., & Wilde, M. (2007) · Proceedings of the 2007 ACM/IEEE conference on Supercomputing · doi:10.1145/1362622.1362680 · Cited by 299
Exploring the characteristics of sequence elements in proximal promoters of human genes
Bina, M., Wyss, P., Ren, W., Szpankowski, W., Thomas, E., Randhawa, R., Reddy, S., John, P. M., Pares-Matos, E. I., Stein, A., et al. (2004) · Genomics · doi:10.1016/j.ygeno.2004.08.013 · Cited by 34
Self-citation
Metadata
- Authors
- Szpankowski, W.
- Venue
- Wiley eBooks
- Publisher
- Wiley
- Published
- 2001-04-02
- OpenAlex
- W1597723816
- Cited by
- 482
- References
- 0
- FWCI
- 6.57
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Average Case Analysis of Algorithms on Sequences. https://app.cochat.ai/papers/10.1002/9781118032770
- The paper
- Szpankowski, W. (2001). Average Case Analysis of Algorithms on Sequences. Wiley eBooks. https://doi.org/10.1002/9781118032770
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
