Two-Dimensional partitioning problems
From MaRDI portal
Publication:671423
DOI10.1016/0304-3975(95)00185-9zbMath0874.68148MaRDI QIDQ671423
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00185-9
68Q25: Analysis of algorithms and problem complexity
68R15: Combinatorics on words
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of finding uniform emulations on paths and ring networks
- One more polynomial complete consecutive retrieval problem
- More on the complexity of common superstring and supersequence problems
- Algorithms for parallel memory. II: Hierarchical multilevel memories
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- File organization: Consecutive storage of relevant records on drum-type storage