A plan-based approach to Prolog recursion
- 期刊名称ACM SIGCSE Bulletin
- 作者Newmarch, Jan
- 卷第25卷
- 期第2期
- 印刷ISSN0097-8418
- 文件大小424.47KB
- 发表时间1993-06-01
- DOI10.1145/152751.152755
- 页码12-18
Multiplierless multiple constant multiplicationVoronenko, Yevgen; Püschel, Markus · ACM Transactions on Algorithms · 2007
Skip graphsAspnes, James; Shah, Gauri · ACM Transactions on Algorithms · 2007
Rank-maximal matchingsIrving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E. · ACM Transactions on Algorithms · 2006
Fast sparse matrix multiplicationYuster, Raphael; Zwick, Uri · ACM Transactions on Algorithms · 2005
Generic quantum Fourier transformsMoore, Cristopher; Rockmore, Daniel; Russell, Alexander · ACM Transactions on Algorithms · 2006
Dynamic Ray StabbingTao, Yufei · ACM Transactions on Algorithms · 2014
When indexing equals compressionFoschini, Luca; Grossi, Roberto; Gupta, Ankur; Vitter, Jeffrey Scott · ACM Transactions on Algorithms · 2006
Approximating Rooted Steiner NetworksCheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian · ACM Transactions on Algorithms · 2014