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

35篇 您的检索式：期刊名="SIAMJ Compute"

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

	题名	作者	年代	出处	被引量
1	Genetic algorithms and the optimal allocations of trials显示文摘	Holland J H	1973	SIAMJ of Computing1973，2，：	1
2	A note on antireflective boundary conditions and fast deblurring models显示文摘	Serra-Capizzano S	2003	SIAMJ Sci Comput2003，25，：	1
3	On the complexity of timetable and multiconnodity flow problems显示文摘	Even Sitai Shamir A	1976	SIAMJ Compute1976，，5：	1
4	A graph-theoretic game and its application to the k-server problem 显示文摘	Alon N Karp P M Peleg D	1995	SIAMJ Comput1995，24，1：	1
5	Computing Sequences with Addition Chains显示文摘	Downey P Leony B Sethi R	1981	SIAMJ Comput1981，10，3：	1
6	Finding all the elementary circuit of a directed graph显示文摘	DONALD B Johnson	1975	SIAMJ COMPUT1975，4，1：	1
7	A nine point scheme for the approximation of diffusion operators on distorted quadrilateral meshes显示文摘	Sheng Z Q Yuan G W	2008	SIAMJ Sci Comput2008，30，3：	1
8	On th complexity of timetable and multiconnodity flow problems显示文摘	Even S Itai Shamir A	1976	SIAMJ Compute1976，，5：	1
9	Discretization on unstructured grids for inhomogeneous, anisotropic media显示文摘	Aavatsmark I Barkve T Bgge O	1998	SIAMJ Sci Comput1998，19，：	1
10	Group action graphs and parallel architectures显示文摘	Annexstein F Baumslag M Rosenberg A	1990	SIAMJ Comput1990，19，：	1
11	Fast pattern matching in strings显示文摘	Knuth D E MorrisJ H	1977	SIAMJ on Computing1977，6，2：	1
12	Polynomial-time Algorithm for Prime Factorization and Discrete Logarithms on a Quantum Computer显示文摘	Shor P	1997	SIAMJ J Comput1997，26，5：	1
13	Wavelet Galerkin algorithms for boundary integral equations显示文摘	Lage C Schwab C	1999	SIAMJ Sci Comput1999，20，6：	1
14	Atomic decomposition by basis pursuit 显示文摘	S Chen D Donoho M Saunders	1999	SIAMJ Sci Comput1999，20，：	1
15	Wavelet-like bases for the fast solution of second-kind integral equations显示文摘	Alpert B Beylkin G Coifman R	1993	SIAMJ Sci Comput1993，14，1：	1
16	Fast nonsymmetrie iteration and preconditioning for Navier-Stokes equations显示文摘	Elman H Silvester D	1996	SIAMJ Sci Comput1996，17，1：	1
17	Faster approxima tion algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts显示文摘	Plotkin S Stein C	1994	SIAMJ Comput1994，23，：	1
18	Polynomial-tim algorithm for prime factorization and discrete logarithms on a quantum显示文摘	SHOR P	1997	SIAMJ J Comput1997，26，5：	1
19	Efficient Matlab computations with sparse and factored tensors显示文摘	Bader B W Kolda T G	2007	SIAMJ Sci Comput2007，30，1：	1
20	Finding the K Shortest Paths显示文摘	Eppstein D	1998	SIAMJ Computing1998，28，2：	1

返回顶部每页显示：

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

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

用户提示