Time and space efficient net extractor

DOI10.1016/0010-4485(88)90137-6zbMATH Open0661.68117OpenAlexW2012926304MaRDI QIDQ1113701

Surendra Nahar, Sartaj Sahni

Publication date: 1988

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4485(88)90137-6

zbMATH Keywords

computational geometrytime and space complexitylayoutsnet extractionoverlap detectionVLSI artwork analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Recommendations

• Title not available (Why is that?) 👍 👎
• Nets, time and space 👍 👎
• Space-Bounded Kolmogorov Extractors 👍 👎
• Finding proper time intervals for dynamic network extraction 👍 👎
• Extractor-based time-space lower bounds for learning 👍 👎
• Deterministic extractors for small-space sources 👍 👎
• Cascade heap: towards time-optimal extractions 👍 👎
• Cascade heap: towards time-optimal extractions 👍 👎

This page was built for publication: Time and space efficient net extractor

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