Analysis of a Recurrence Arising from a Construction for Nonblocking Networks

DOI10.1137/S0895480193255694zbMATH Open0862.90060MaRDI QIDQ4837656FDOQ4837656

Authors: Nicholas Pippenger 

Publication date: 25 May 1997

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Solution of a Divide-and-Conquer Maximin Recurrence
• Exact solution of a minimal recurrence
• An asymptotic theory for recurrence relations based on minimization and maximization.
• Recurrence relations based on minimization and maximization
• Exact and asymptotic solutions of a divide-and-conquer recurrence dividing at half: theory and applications

zbMATH Keywords

asymptotic analysisrecurrence relationnonblocking networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Rate of growth of functions, orders of infinity, slowly varying functions (26A12)

Cited In (3)

• An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
• Recurrence method of teletraffic evaluation in series-parallel telecommunication nets
• Title not available (Why is that?)

This page was built for publication: Analysis of a Recurrence Arising from a Construction for Nonblocking Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4837656)