( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Combinatorial Family of Near Regular LDPC Codes.

, , , и . ISIT, стр. 761-765. IEEE, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Priti Patel

Anita Pritisanac

Priti Talwar

Priti Singh

Shankar Vembu

 

Другие публикации лиц с тем же именем

Compressing XML Documents Using Recursive Finite State Automata., и . CIAA, том 3845 из Lecture Notes in Computer Science, стр. 282-293. Springer, (2005)Optimal Regular Tree Pattern Matching Using Pushdown Automata., и . FSTTCS, том 1530 из Lecture Notes in Computer Science, стр. 122-133. Springer, (1998)A new algorithm for linear regular tree pattern matching., , , и . Theor. Comput. Sci., 242 (1-2): 125-142 (2000)On the complexity of exact maximum likelihood decoding on tail-biting trellises.. ISIT, стр. 104. IEEE, (2004)Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code., и . Comput. J., 46 (5): 476-486 (2003)Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds., и . ISIT, стр. 2245-2249. IEEE, (2006)Evaluating the Role of Context in Syntax Directed Compression of XML Documents., и . DCC, стр. 453. IEEE Computer Society, (2006)Algebraic Structure Theory of Tail-Biting Trellises.. AAECC, том 4851 из Lecture Notes in Computer Science, стр. 47. Springer, (2007)Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA., и . SAS, том 5079 из Lecture Notes in Computer Science, стр. 110-127. Springer, (2008)A Combinatorial Family of Near Regular LDPC Codes., , , и . ISIT, стр. 761-765. IEEE, (2007)