Pascal and Francis Bibliographic Databases


Search results

Your search

au.\*:("MANDOIU, I")

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 6 of 6

  • Page / 1

Selection :

  • and

Optimum extensions of prefix codesMANDOIU, I. I.Information processing letters. 1998, Vol 66, Num 1, pp 35-40, issn 0020-0190Article

A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner pointsMANDOIU, I. I; ZELIKOVSKY, A. Z.Information processing letters. 2000, Vol 75, Num 4, pp 165-167, issn 0020-0190Article

The art of trellis decoding is computationally hard : for large fieldsJAIN, K; MANDOIU, I; VAZIRANI, V. V et al.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 13Conference Paper

DNA-BAR : distinguisher selection for DNA barcodingDASGUPTA, B; KONWAR, K. M; MANDOIU, I. I et al.Bioinformatics (Oxford. Print). 2005, Vol 21, Num 16, pp 3424-3426, issn 1367-4803, 3 p.Article

Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population HaplotypingHAJIAGHAYI, M. T; JAIN, K; LAU, L. C et al.Lecture notes in computer science. 2006, pp 758-766, issn 0302-9743, isbn 3-540-34379-2, 9 p.Conference Paper

Highly scalable algorithms for robust string barcodingDASGUPTA, B; KONWAR, K. M; MANDOIU, I. I et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part II, 1020-1028Conference Paper

  • Page / 1