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

46篇 您的检索式：期刊名="Journal of Experimental Algorithms"

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

	题名	作者	年代	出处	被引量
1	Better external memory suffix array construction 显示文摘	Dementiev R Karkkainen J Mehnert J	2008	Journal of Experimental Algorithmics2008，12，1：	1
2	SHARC:Fast and robust unidirectionalrouting显示文摘	BAUER R DELLING D	2009	ACM Journal of Experimental Algorithmics2009，14，12：	1
3	Shortest-path Feasibility Algorithms:An Experimental Evaluation显示文摘	Cherkassky B V Georgiadis L Goldberg A	2009	ACM Journal of Experimental Algorithmics2009，14，2：	1
4	Approximate minimum enclosing balls in high dimensions using core-sets显示文摘	KUMAR P MITCHELL J S B YILDIRIM E A	2003	The ACM Journal of Experimental Algorithmics2003，8，1：	1
5	Finding the chromatic number by means of critical graphs显示文摘	Herrmann F Hertz A	2002	ACM Journal of Experimental Algorithmics2002，7，：	1
6	Dijkstra's algorithm online: An empirical case study from public railroad transport显示文摘	Schulz F D Wagner K Weihe	2000	Journal of Experimental Algorithmics2000，，5：	1
7	Fast and flexible string matching by combining bit-parallelism and suffix automata显示文摘	Navarro G Raffinot M	2000	Journal of Experimental Algorithmics2000，5，4：	1
8	Fast and flexible string matching by combining bit-parallelism and suffix automata显示文摘	NAVARRO G RAFFINOT M	2000	ACM Journal of Experimental Algorithmics2000，5，4：	1
9	Shortest-path feasibility algorithm : an experimental evaluation 显示文摘	CHERKASSKY B V GEORGIADIS L GOLDBERG A V	2009	ACM Journal of Experimental Algorithmics2009，14，2：	1
10	Shortest path feasibility algorithms: an experimental evaluation 显示文摘	Cherkassky B V Georgiadis L Goldberg A V	2009	Journal of Experimental Algorithmics (lEA)2009，14，：	1
11	An experimental study of the basis for graph drawing algorithms显示文摘	Purchase H C Cohen R F James M I	1997	Journal of Experimental Algorithms1997，2，1：	1
12	Compressed text indexes: from theory to practice 显示文摘	Ferragina P Gonzalez R Navarro G	2009	Journal of Experimental Algorithmics2009，13，12：	1
13	Fast and flexible string matching by combining bit-parallelism and suffix automata显示文摘	G Navarro M Raffinot	2000	Journal of Experimental Algorithmics (JEA)2000，5，4：	1
14	A New String-Pattern Matching Algorithm Using Partitioning and Hashing Effectively显示文摘	Sun Kim	1999	Journal of Experimental Algorithmics1999，12，：	1
15	Fast and flexible string matching by combining bit-parallelism and suffix automata显示文摘	Navarro G Raffinot M	2000	ACM Journal of Experimental Algorithmics(JEA)2000，5，4：	1
16	Multi-pattern String Matching with q-grams显示文摘	Salmela L Tarhio J Kyt?joki J	2006	ACM Journal of Experimental Algorithmics2006，11，1：	1
17	Fast and Flexible String Matching by Combining Bit-parallelism and Suffix Automata 显示文摘	Navarro G Raffinot M	2000	ACM Journal of Experimental Algorithmics(JEA)2000，5，4：	1
18	Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem显示文摘	Frigioni D Ioffreda M Nanni U	1998	ACM Journal of Experimental Algorithms1998，3，5：	1
19	Augment or push? a computational study of bipartite matching and unit capacity maximum flow algorithms显示文摘	Cherkassky B V Goldberg A V Martin P	1998	ACM Journal of Experimental Algorithmics1998，38，：	1
20	Multipattem string matching with q-grams显示文摘	SALMELA L TARHIO J KYTOJOKI J	2006	Journal of Experimental Algorithmics2006，11，：	1

返回顶部每页显示：

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

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

用户提示