Optimal algorithms for sensitivity analysis in associative multiplication problems

DOI10.1016/0304-3975(81)90006-2MaRDI QIDQ1149785zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3501240 (Why is no real title available?)
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• A new shortest path updating algorithm
• Algorithms for updating minimal spanning trees
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• On Finding and Updating Spanning Trees and Shortest Paths
• Order- n correction for regular languages
• Parallel Prefix Computation
• Self-Organizing Binary Search Trees

Cited in

(2)

• A general class of resource tradeoffs
• Network Resilience

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

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