Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
- 1 August 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (4) , 777-791
- https://doi.org/10.1137/0218054
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Trie partitioning process: Limiting distributionsPublished by Springer Nature ,2005
- An analysis of a contention resolution algorithmActa Informatica, 1987
- Solution of a Linear Recurrence Equation Arising in the Analysis of Some AlgorithmsSIAM Journal on Algebraic Discrete Methods, 1987
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channelsJournal of the ACM, 1987
- Delay Analysis of 0.487 Contention Resolution AlgorithmsIEEE Transactions on Communications, 1986
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channelsJournal of the ACM, 1985
- Some Uses of the Mellin Integral Transform in the Analysis of AlgorithmsPublished by Springer Nature ,1985
- Integral Transforms and their ApplicationsPublished by Springer Nature ,1985
- Poisson multiple-access contention with binary feedbackIEEE Transactions on Information Theory, 1984
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979