( en | de | ru )

 

Disambiguation of "Kannan, Sampath"

Author of the publication

copydeleteadd this publication to your clipboard
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed.

, and . SODA, page 595-603. ACM/SIAM, (1995)

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.

Prahladavaradan Sampath

Karuppaiah Kannan

Srinivasaraghavan Kannan

Somasundar Kannan

Kannan Alpadi

 

Other publications of authors with the same name

Communicating Hierarchical State Machines., , and . ICALP, volume 1644 of Lecture Notes in Computer Science, page 169-178. Springer, (1999)Hedging Bets in Markov Decision Processes., , , and . CSL, volume 62 of LIPIcs, page 29:1-29:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Optimal Provision-After-Wait in Healthcare., , and . CoRR, (2013)Quantifying the Burden of Exploration and the Unfairness of Free Riding., , and . SODA, page 1892-1904. SIAM, (2020)Reconstructing strings from random traces., , , and . SODA, page 910-918. SIAM, (2004)A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed., and . SODA, page 595-603. ACM/SIAM, (1995)An Approximate L1-Difference Algorithm for Massive Data Streams., , , and . SIAM J. Comput., 32 (1): 131-151 (2002)Lower Bounds on Random-Self-Reducibility., , and . SCT, page 100-109. IEEE Computer Society, (1990)Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply., , , and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 73-84. Springer, (2012)Spatio-temporal analysis of Wikipedia metadata and the STiki anti-vandalism tool., , and . Int. Sym. Wikis, ACM, (2010)