Learning Switch Configurations. - Vijay Raghavan 002; Stephen R. Schach (COLT, 1990)

Improved Diagnosability Algorithms. - Vijay Raghavan 002; Anand R. Tripathi (IEEE Trans. Computers, 1991)

Sequential Diagnosability is Co-NP Complete. - Vijay Raghavan 002; Anand R. Tripathi (IEEE Trans. Computers, 1991)

Learning µ-branching Programs with Queries. - Vijay Raghavan 002; Dawn Wilkins (COLT, 1993)

A Linear Time Equivalene Test for Read-Twice DNF Formulas. - Krishnan Pillaipakkamnatt; Vijay Raghavan 002 (Inf. Process. Lett., 1993)

On Asymmetric Invalidation with Partial Tests. - Vijay Raghavan 002 (IEEE Trans. Computers, 1993)

Bounded Degree Graph Inference from Walks. - Vijay Raghavan 002 (J. Comput. Syst. Sci., 1994)

Read-Twice DNF Formulas are Properly Learnable. - Krishnan Pillaipakkamnatt; Vijay Raghavan 002 (Inf. Comput., 1995)

How Many Queries Are Needed to Learn? - Lisa Hellerstein; Krishnan Pillaipakkamnatt; Vijay Raghavan 002; Dawn Wilkins (J. ACM, 1996)

On the Limits of Proper Learnability of Subclasses of DNF Formulas. - Krishnan Pillaipakkamnatt; Vijay Raghavan 002 (Mach. Learn., 1996)

Weighted Diagnosis with Asymmetric Invalidation. - Vijay Raghavan 002 (IEEE Trans. Computers, 1996)

Learning Monotone Term Decision Lists. - David Guijarro; Víctor Lavín; Vijay Raghavan 002 (EuroCOLT, 1997)

A Characterization and Nearly Linear-Time Equivalence Test for µ-Branching Programs. - Vijay Raghavan 002; Dawn Wilkins (Theory Comput. Syst., 1997)

On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms. - Antoni Lozano; Vijay Raghavan 002 (FSTTCS, 1998)

Exact Learning when Irrelevant Variables Abound. - David Guijarro; Víctor Lavín; Vijay Raghavan 002 (Inf. Process. Lett., 1999)

Solving Problems on Special Classes of Graphs. - Vijay Raghavan 002; Jeremy P. Spinrad (Electron. Notes Discret. Math., 2000)

Editor's Foreword. - Vijay Raghavan 002 (J. Comput. Syst. Sci., 2000)

A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions. - Calvin R. Maurer Jr.; Vijay Raghavan 002; Rensheng Qi (IPMI, 2001)

Monotone term decision lists. - David Guijarro; Víctor Lavín; Vijay Raghavan 002 (Theor. Comput. Sci., 2001)

Decision tree approximations of Boolean functions. - Dinesh P. Mehta; Vijay Raghavan 002 (Theor. Comput. Sci., 2002)

Robust algorithms for restricted domains. - Vijay Raghavan 002; Jeremy P. Spinrad (J. Algorithms, 2003)

Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. - Stefan Felsner; Vijay Raghavan 002; Jeremy P. Spinrad (Order, 2003)

A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions. - Calvin R. Maurer Jr.; Rensheng Qi; Vijay Raghavan 002 (IEEE Trans. Pattern Anal. Mach. Intell., 2003)

Scalar aggregation in inconsistent databases. - Marcelo Arenas; Leopoldo E. Bertossi; Jan Chomicki; Xin He; Vijay Raghavan 002; Jeremy P. Spinrad (Theor. Comput. Sci., 2003)

Exact learning of DNF formulas using DNF hypotheses. - Lisa Hellerstein; Vijay Raghavan 002 (J. Comput. Syst. Sci., 2005)