Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima

DOI10.1137/S0097539791218275MaRDI QIDQ4302276zbMATH OpenOpenAlexFDO

Authors Omer Berkman, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin, Joseph Ja'Ja'

Publication date 14 August 1994

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539791218275

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima

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