Searching for authors named "Sampath Kannan" – sorted by Relevance.
-
Anchors in Tournaments
- We define and study the graph-theoretic notion of an anchor in a tournament. An anchor in a tournament is a subset of the nodes of the tournament such that every pair of nodes outside the anchor is `distinguished' at one of the nodes in the anchor. We show that every n-node tournament has an anchor
- Add To MetaCart
-
Dynamic Graph Algorithms
- INTRODUCTION Dynamic graph algorithms are algorithms that maintain properties of a (possibly edgeweighted) graph while the graph is changing. These algorithms are potentially useful in a number of application areas, including communication networks, VLSI design, distributed computing, and graphics,
- Cited by 9 (0 self) – Add To MetaCart
-
Program Checkers for Probability Generation
- Program Checkers for Probability Generation Sampath Kannan University of Arizona Andrew Yao
- Cited by 4 (1 self) – Add To MetaCart
-
Selection with Monotone Comparison Costs
- Selection with Monotone Comparison Costs Sampath Kannan Sanjeev Khanna y Abstract We consider
- Cited by 2 (0 self) – Add To MetaCart
-
Inferring mixtures of markov chains
- Inferring Mixtures of Markov Chains Tu˘gkan Batu ⋆1 , Sudipto Guha 2 , and Sampath Kannan ⋆⋆2 1
- Cited by 3 (0 self) – Add To MetaCart
-
A Fast Algorithm For The Computation And Enumeration Of Perfect Phylogenies
- A FAST ALGORITHM FOR THE COMPUTATION AND ENUMERATION OF PERFECT PHYLOGENIES # SAMPATH KANNAN
- Cited by 32 (7 self) – Add To MetaCart
-
Efficient Algorithms for Inverting Evolution
- Efficient Algorithms for Inverting Evolution Martin Farach ∗ Sampath Kannan † January 11, 1999
- Cited by 43 (3 self) – Add To MetaCart
-
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies Sampath Kannan
- Add To MetaCart
-
A Formal Framework for Evaluating Heuristic Programs
- Feigenbaum 2 Sampath Kannan 3 1 Dept. of Math. Sciences and Dept. of CS, Johns Hopkins University
- Add To MetaCart
-
An Approximate L¹-Difference Algorithm for Massive Data Streams
- -- Research 180 Park Avenue Florham Park, NJ 07932 USA jf@(email omitted); Sampath Kannan y AT&T Labs
- Add To MetaCart

