( en | de | ru )

 

Disambiguation of "Tetali, Prasad"

Author of the publication

copydeleteadd this publication to your clipboard
Minimal Completely Separating Systems of k-Sets.

, , and . J. Comb. Theory A, 93 (1): 192-198 (2001)

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. You can also use the button next to the name to display some publications already assigned to the person.

Sharad Prasad

Kumkum Prasad

Athul Prasad

Prasad Samarakoon

Manika Prasad

 

Other publications of authors with the same name

Mutation, Sexual Reproduction and Survival in Dynamic Environments., , , , and . ITCS, volume 67 of LIPIcs, page 16:1-16:29. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Simple Markov-chain Algorithms for Generating Bipartite Graphs and Tournaments, , , , and . Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, page 193--200. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (1997)Running Time Predictions for Factoring Algorithms., , , and . ANTS, volume 5011 of Lecture Notes in Computer Science, page 1-36. Springer, (2008)Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets., , , , and . FOCS, page 140-149. IEEE Computer Society, (2011)Multi Purpose Routing: New Perspectives and Approximation Algorithms., , , and . CoRR, (2022)Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover., , , and . SODA, page 998-1005. SIAM, (2021)Reconstruction Threshold for the Hardcore Model., , and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 434-447. Springer, (2010)Limits on the Efficiency of One-Way Permutation-Based Hash Functions., , and . FOCS, page 535-542. IEEE Computer Society, (1999)A note on expected hitting times for birth and death chains, and . Statistics & Probability Letters, 30 (2): 119--125 (Oct 15, 1996)Determinant Maximization via Matroid Intersection Algorithms., , , , and . FOCS, page 255-266. IEEE, (2022)