维普期刊资源整合服务平台（V6.5）

806篇 您的检索式：期刊名="Algorithmica"

选中清除导出查看参考文献查看引证文献引用追踪共41页首页上一页第1页下一页末页 /41 跳转

	题名	作者	年代	出处	被引量
1	Optimal Search and One-Way Trading Online Algorithms显示文摘	R. El-Yaniv A. Fiat R. M. Karp G. Turpin	2001	Algorithmica2001，，1：	2
2	Competitive Optimal On-Line Leasing显示文摘	R. El-Yaniv R. Kaniel N. Linial	1999	Algorithmica1999，，1：	2
3	Approximation algorithms for connected dominating sets显示文摘	Guha S Khuller S	1998	Algorithmica1998，20，4：	2
4	Approximation algorithms for connected dominating sets显示文摘	Guha S Khuller S	1998	Algorithmica1998，20，4：	2
5	A Risk‐Reward Framework for the Competitive Analysis of Financial Games显示文摘	S. al-Binali	1999	Algorithmica1999，，1：	2
6	Semi -dynamic algorithms for maintaining singlesource shortest paths trees 显示文摘	FRIGIONI D MARCHETTI- S A NANNI U	1998	Algorithmica1998，，3：	1
7	Optimal search and one-way trading online algorithms显示文摘	Fiat A Karp R M	2001	Algorithmica2001，30，：	1
8	A risk-reward framework for the competitive analysis of financial games显示文摘	Al-Binali S	1999	Algorithmica1999，25，：	1
9	A Faster Divide-and-conquer Algo- rithm for Constructing Delaunay Triangulations显示文摘	Dwyer R A	1987	Algorithmica1987，2，2：	1
10	A (2-c/ N-) approximation algorithm for the stable marriage problem显示文摘	Iwama K Miyazaki S Yamauchi N	2008	Algorithmica2008，51，3：	1
11	Fast dynamic transitive closure lookahead显示文摘	Sankowski P Mucha M	2010	Algorithmica2010，56，2：	1
12	Approximation algorithms for quickest spanning tree problems显示文摘	Hassin R Levin A	2005	Algorithmica2005，41，1：	1
13	Competitive optimal on-line leasing 显示文摘	El-Yaniv R Kaniel R Linial N	1999	Algorithmica1999，25，：	1
14	(2002) Efficient bulk operations on dynamic R-trees显示文摘	Hinrichs K H Vahrenhold J	2002	Algorithmica2002，33，1：	1
15	Competitive optimal on-line leasing显示文摘	El-Yaniv R Kaniel R Linial N	1999	Algorithmica1999，25，：	1
16	Refinements to nearest-neighbor searching in k-dimensional trees显示文摘	SPROULL R F	1991	Algorithmica1991，6，：	1
17	An Iterative DisplacementMethod for Conflict Resolution in Map Generaliza-tion 显示文摘	LONERGAN M JONES C B	2001	Algorithmica2001，30，2：	1
18	A faster divide-and-conquer algorithm for constructing Delaunay Triangulations显示文摘	Dwyer R A	1987	Algorithmica1987，2，2：	1
19	A faster divide-and-conquer algorithm for constructing delaunay triangulations显示文摘	Rex A. Dwyer	1987	Algorithmica (-)1987，，1：	1
20	Bounded Space On-Line Bin Packing: Best Is Better than First显示文摘	J. Csirik D. S. Johnson	2001	Algorithmica2001，，2：	1

返回顶部每页显示：

共41页首页上一页第1页下一页末页 /41 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示