Author:
Leiserson Charles E.,Saxe James B.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference21 articles.
1. J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems,Journal of the Association for Computing Machinery, Vol. 19, No. 2, 1972, pp. 248–264.
2. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms,Proceedings of the 25th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, October 1984, pp. 338–346.
3. Z. Galil and É. Tardos, AnO(n 2(m +n logn) logn) min-cost flow algorithm,Proceedings of the 27th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, October 1986, pp. 1–9.
4. M. R. Garey and D. S. Johnson,Computers and Intractability, Freeman, San Francisco, 1979.
5. A. V. Goldberg, Efficient Parallel Algorithms for Sequential and Parallel Computers, Ph.D. dissertion, Department of Electrical Engineering and Computer Science, MIT, February 1987.
Cited by
430 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Mix & Latch: Comparison With State-of-the-Art Retiming on a RISC-V Benchmark;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2024-07
2. Efficient Pipelining of Synchronous Dataflow Graphs Via Graph Conversion;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2024-06
3. Energy-aware task scheduling for streaming applications on NoC-based MPSoCs;Journal of King Saud University - Computer and Information Sciences;2024-06
4. Improving Clock Frequencies in ASIC Designs through Semi-Automatic Register Placement and Advanced Retiming;2024 Panhellenic Conference on Electronics & Telecommunications (PACET);2024-03-28
5. Subgraph Extraction-Based Feedback-Guided Iterative Scheduling for HLS;2024 Design, Automation & Test in Europe Conference & Exhibition (DATE);2024-03-25