The complexity of searching in X + Y and other multisets-Reference-Cited by-同舟云学术

The complexity of searching in X + Y and other multisets

Published:1990-03 Issue:2 Volume:34 Page:103-109
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Cosnard Michel,Duprat Jean,Ferreira Afonso G.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference16 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1974

2. Complexity of selection in X + Y;Cosnard;Theoret. Comput. Sci.,1989

3. M. Cosnard, J. Duprat and A.G. Ferreira, Known and new results on selection, sorting and searching in X + Y and sorted matrices, Tech. Rept. LIP-IMAG, no. 89-10.

4. The knapsack problem on parallel architectures;Ferreira,1989

5. A.G. Ferreira, A parallel time/hardware tradeoff T.H = O(2n2) for the knapsack problem, IEEE Trans. Comput. to appear.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithmic complexity of protein identification: combinatorics of weighted strings;Discrete Applied Mathematics;2004-02

2. Sequencing from Compomers: Using Mass Spectrometry for DNA De-Novo Sequencing of 200+ nt;Lecture Notes in Computer Science;2003

3. Algorithmic Complexity of Protein Identification: Searching in Weighted Strings;Foundations of Information Technology in the Era of Network and Mobile Computing;2002

4. Optimal algorithms for generalized searching in sorted matrices;Theoretical Computer Science;1997-11

5. Time-optimal domain-specific querying on enhanced meshes;IEEE Transactions on Parallel and Distributed Systems;1997