An asymptotic theory for recurrence relations based on minimization and maximization.
type: Item
instance of: scholarly article
title: An asymptotic theory for recurrence relations based on minimization and maximization.
zbMATH Open document ID: 1044.68168
DOI: 10.1016/S0304-3975(02)00066-X
author: Hsien-Kuei Hwang
author: Tsung-Hsi Tsai
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05A20
Mathematics Subject Classification ID: 11B37
zbMATH DE Number: 1965221
zbMATH Keywords: Divide-and-conquer
zbMATH Keywords: Recurrence relations
zbMATH Keywords: Slowly varying functions
zbMATH Keywords: Power-of-two rules
zbMATH Keywords: Optimal algorithms
MaRDI profile type: Publication
cites work: Q4065051
cites work: Multidimensional Divide-and-Conquer Maximin Recurrences
cites work: Some Maximal Solutions of the Generalized Subadditive Inequality
cites work: Q3992980
cites work: Q5812361
cites work: A sorting function
cites work: Huffman algebras for independent random variables
cites work: The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules
cites work: Q3619797
cites work: Sur la fonction sommatoire de la fonction 'somme des chiffres'
cites work: Moment inequalities for random variables in computational geometry
cites work: Q4868264
cites work: Mellin transforms and asymptotics. The mergesort recurrence
cites work: Mellin transforms and asymptotics: Digital sums
cites work: A calculus for the random generation of labelled combinatorial structures
cites work: Recurrence relations based on minimization
cites work: A Discrete Search Game
cites work: On the Optimality of Huffman Trees
cites work: Queue-mergesort
cites work: Mathematics for the Analysis of Algorithms.
cites work: Q5732774
cites work: Q4042466
cites work: The probabilities of rooted tree-shapes generated by random bifurcation
cites work: A note on the edges of the n-cube
cites work: Dichotomous Search for Random Objects on an Interval
cites work: Asymptotic analysis of dichotomous search with search and travel costs
cites work: On dichotomous search with direction-dependent costs for a uniformly hidden object
cites work: On polychotomous search problems
cites work: Q4888166
cites work: New primal and dual matching heuristics
cites work: Recurrence relations based on minimization and maximization
cites work: Optimum lopsided binary trees
cites work: Q5671622
cites work: Q4344097
cites work: Binary trees and uniform distribution of traffic cutback
cites work: Solution of a Divide-and-Conquer Maximin Recurrence
cites work: The Number of 1’s in Binary Integers: Bounds and Extremal Properties
cites work: Some Theorems on Sorting
cites work: Q5181076
cites work: Search
cites work: Bottom-up mergesort -- A detailed analysis
cites work: Q4154886
cites work: A combinatorial problem in the design of electrical circuits
cites work: An Elementary Approach to Some Analytic Asymptotics
cites work: A sorting problem and its complexity
cites work: On a Greedy Heuristic for Complete Matching
cites work: Improved master theorems for divide-and-conquer recurrences
cites work: Exact balancing is not always good
cites work: Q5691080
cites work: How evenly should one divide to conquer quickly?
cites work: Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
cites work: A Linear Search Problem
cites work: Probability theory of classical Euclidean optimization problems
description: scientific article; zbMATH DE number 1965221