Optimal algorithms for sensitivity analysis in associative multiplication problems

DOI10.1016/0304-3975(81)90006-2zbMath0454.68082OpenAlexW2067532490MaRDI QIDQ1149785

Arnon Rosenthal

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/24498

zbMATH Keywords

lower boundsbinary search treesHuffman treesdeterministic variation schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

Network Resilience ⋮ A general class of resource tradeoffs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for updating minimal spanning trees
• Parallel Prefix Computation
• On Finding and Updating Spanning Trees and Shortest Paths
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Self-Organizing Binary Search Trees
• A new shortest path updating algorithm
• Order- n correction for regular languages

This page was built for publication: Optimal algorithms for sensitivity analysis in associative multiplication problems