S. Kannan

Publications
Influence

Designing programs that check their work

M. Blum, S. Kannan
Computer Science, Mathematics
STOC '89
1 February 1989

A program correctness checker is an algorithm for checking the output of a computation. Expand

On graph problems in a semi-streaming model

J. Feigenbaum, S. Kannan, A. Mcgregor, S. Suri, J. Zhang
Mathematics, Computer Science
Theor. Comput. Sci.
8 December 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 edge sets cannot be stored in memory. Expand

Checking the correctness of memories

M. Blum, W. S. Evans, P. Gemmell, S. Kannan, M. Naor
Computer Science
Algorithmica
1 September 1994

We extend the notion of program checking to include programs which alter their environment. Expand

Implicit Representation of Graphs

S. Kannan, M. Naor, S. Rudich
Mathematics, Computer Science
SIAM J. Discret. Math.
1 November 1992

How to represent a graph in memory is a fundamental data structuring question. Expand

Oracles and Queries That Are Sufficient for Exact Learning

N. Bshouty, R. Cleve, R. Gavaldà, S. Kannan, C. Tamon
Computer Science, Mathematics
J. Comput. Syst. Sci.
1 June 1996

We show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak superset queries. Expand

Spot-checkers

F. Ergün, S. Kannan, Ravi Kumar, R. Rubinfeld, M. Viswanathan
Computer Science
STOC '98
23 May 1998

On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectly. We explore a very… Expand

Implicit representation of graphs

S. Kannan, M. Naor, S. Rudich
Mathematics, Computer Science
STOC '88
1988

How to represent a graph in memory is a fundamental data structuring question. Expand

The relationship between public key encryption and oblivious transfer

Yael Gertner, S. Kannan, T. Malkin, O. Reingold, M. Viswanathan
Mathematics, Computer Science
Proceedings 41st Annual Symposium on Foundations…
12 November 2000

In this paper we study the relationships among some of the most fundamental primitives and protocols in cryptography: public-key encryption (which is equivalent to general secure multi-party computation), key agreement and trapdoor permutations. Expand

Randomized pursuit-evasion in a polygonal environment

Volkan Isler, S. Kannan, S. Khanna
Computer Science
IEEE Transactions on Robotics
1 October 2005

This paper contains two main results. First, we revisit the well-known visibility-based pursuit-evasion problem, and show that in contrast to deterministic strategies, a single pursuer can locate an… Expand

Java-MaC: A Run-Time Assurance Approach for Java Programs

Moonzoo Kim, M. Viswanathan, S. Kannan, I. Lee, O. Sokolsky
Computer Science
Formal Methods Syst. Des.
1 March 2004

We describe Java-MaC, a prototype implementation of the Monitoring and Checking (MaC) architecture for Java programs. Expand

Recommended Authors