Solution of a Divide-and-Conquer Maximin Recurrence

This publication has 14 references indexed in Scilit:

• An efficient algorithm for finding the CSG representation of a simple polygon
  ACM SIGGRAPH Computer Graphics, 1988
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
  Algorithmica, 1987
• Fast Algorithms for Finding Nearest Common Ancestors
  SIAM Journal on Computing, 1984
• Data Structures and Algorithms 1
  Published by Springer Nature ,1984
• Some Maximal Solutions of the Generalized Subadditive Inequality
  SIAM Journal on Algebraic Discrete Methods, 1982
• Some Recurrence Relations of Recursive Minimization
  SIAM Journal on Algebraic Discrete Methods, 1982
• Tidier Drawings of Trees
  IEEE Transactions on Software Engineering, 1981
• Some equivalences between Shannon entropy and Kolmogorov complexity
  IEEE Transactions on Information Theory, 1978
• A note on the edges of the n-cube
  Discrete Mathematics, 1976
• The Number of 1’s in Binary Integers: Bounds and Extremal Properties
  SIAM Journal on Computing, 1974