Sampath Kannan
University of Pennsylvania
188 Papers
3.6K Citations
Sampath Kannan is an academic researcher from University of Pennsylvania. The author has contributed to research in topics: Computer science & Approximation algorithm. The author has an hindex of 47, co-authored 185 publications. Previous affiliations of Sampath Kannan include University of California & AT&T.
Chat about Author
Papers
Java-MaC: A Run-Time Assurance Approach for Java Programs
Moonzoo Kim,Mahesh Viswanathan,Sampath Kannan,Insup Lee,Oleg Sokolsky +4 more
- 01 Mar 2004
TL;DR: Java-MaC as discussed by the authors is a prototype implementation of the Monitoring and Checking (MaC) architecture for Java programs, which is a lightweight formal method solution which works as a viable complement to the current heavyweight formal methods.
Detecting Wikipedia vandalism via spatio-temporal analysis of revision metadata?
Andrew G. West,Sampath Kannan,Insup Lee +2 more
- 13 Apr 2010
TL;DR: A classifier is produced which flags vandalism at performance comparable to the natural-language efforts the authors intend to complement, and has been used to locate over 5,000 manually-confirmed incidents of vandalism outside their labeled set.
Java-MaC: A Run-time Assurance Tool for Java Programs
Moonjoo Kim,Sampath Kannan,Insup Lee,Oleg Sokolsky,Mahesh Viswanathan +4 more
- 01 Oct 2001
TL;DR: The paper presents an overview of the MaC architecture and a prototype implementation of the Monitoring and Checking (MaC) architecture, a lightweight formal method solution as a viable complement to the current heavyweight formal methods.
Algorithms for the Generalized Sorting Problem
Zhiyi Huang,Sampath Kannan,Sanjeev Khanna +2 more
- 22 Oct 2011
TL;DR: A randomized algorithm that sorts any allowed comparison graph using O(n^{3/2}) comparisons with high probability (provided the input is sortable) is presented.
Determining the Evolutionary Tree Using Experiments
TL;DR: A new model of computation is presented which assumes that it is possible to determine the true evolutionary tree for each three species, perhaps through the use of Ahlquist?Sibley experimental techniques and presents tight upper and lower bounds for constructing evolutionary trees using experiments.