#### Filter Results:

- Full text PDF available (56)

#### Publication Year

1985

2019

- This year (2)
- Last 5 years (32)
- Last 10 years (67)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Joan Feigenbaum, Sampath Kannan, Andrew Mcgregor, Siddharth Suri, Jian Zhang
- Theor. Comput. Sci.
- 2005

We formalize a potentially rich new streaming model, the semi-streaming model, that we believe is necessary for the fruitful study of efficient algorithms for solving problems on massive graphs whose… (More)

- Manuel Blum, Sampath Kannan
- J. ACM
- 1995

A program correctness checker is an algorithm for checking the output of a computation. That is, given a program and an instance on which the program is run, the checker certifies whether the output… (More)

- Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
- Algorithmica
- 1994

We extend the notion of program checking to include programs which alter their environment. In particular, we consider programs which store and retrieve data from memory. The model we consider allows… (More)

- Sampath Kannan, Moni Naor, Steven Rudich
- SIAM J. Discrete Math.
- 1992

How to represent a graph in memory is a fundamental data structuring question. In the usual representations of an n-vertex graph, the names of the vertices (i.e., integers from 1 to n) betray nothing… (More)

- Martin Farach-Colton, Sampath Kannan, Tandy J. Warnow
- Algorithmica
- 1995

Constructing evolutionary trees for species sets is a fundamental problem in computational biology. One of the standard models assumes the ability to compute distances between every pair of species,… (More)

- Moonzoo Kim, Mahesh Viswanathan, Sampath Kannan, Insup Lee, Oleg Sokolsky
- Formal Methods in System Design
- 2004

We describe Java-MaC, a prototype implementation of the Monitoring and Checking (MaC) architecture for Java programs. The MaC architecture provides assurance that the target program is running… (More)

- Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
- Electronic Colloquium on Computational Complexity
- 1995

We show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak superset queries. This is a consequence of the following result which we… (More)

- Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan
- Proceedings 41st Annual Symposium on Foundations…
- 2000

In this paper we study the relationships among some of the most fundamental primitives and protocols in cryptography: public-key encryption (i.e. trapdoor predicates), oblivious transfer (which is… (More)

- Insup Lee, Sampath Kannan, Moonjoo Kim, Oleg Sokolsky, Mahesh Viswanathan
- PDPTA
- 1999

We describe the Monitoring and Checking (MaC) framework which assures the correctness of the current execution at run-time. Monitoring is performed based on a formal specification of system… (More)

- Sampath Kannan, Tandy J. Warnow
- Proceedings [] 31st Annual Symposium on…
- 1990

Two related problems are considered. The first is determining whether it is possible to triangulate a vertex-colored graph without introducing edges between vertices of the same color. This is… (More)