Shashank K. Mehta

41 papers A* 1A 2B 7C 2Misc 7Journal 15Unranked 7
YearRankTypeTitle / Venue / Authors
2024 Misc conf
On the Maximum Distance Sublattice Problem and Closest Vector Problem.
SYNASC
Rajendra Kumar, Shashank K. Mehta, Mahesh Sreekumar Rajasree
2022 Misc conf
On the bases of Z
SYNASC
Shashank K. Mehta, Mahesh Sreekumar Rajasree
2020 J jnl
A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation.
J. Comb. Optim.
Pawan Aurora, Shashank K. Mehta
2019 A conf
Depth First Search in the Semi-streaming Model.
STACS
Shahbaz Khan, Shashank K. Mehta
2019 J jnl
Depth First Search in the Semi-streaming Model.
CoRR
Shahbaz Khan, Shashank K. Mehta
2018 J jnl
Maximum Distance Sub-Lattice Problem.
CoRR
Shashank K. Mehta, Mahesh Sreekumar Rajasree, Rajendra Kumar
2018 J jnl
The QAP-polytope and the graph isomorphism problem.
J. Comb. Optim.
Pawan Aurora, Shashank K. Mehta
2016 J jnl
Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs.
J. Comb. Optim.
Pawan Aurora, Sumit Singh, Shashank K. Mehta
2014 B conf
A Divide and Conquer Method to Compute Binomial Ideals.
LATIN
Deepanjan Kesh, Shashank K. Mehta
2014 B conf
A Geometric Approach to Graph Isomorphism.
ISAAC
Pawan Aurora, Shashank K. Mehta
2013 J jnl
Completely Positive formulation of the Graph Isomorphism Problem
CoRR
Shashank K. Mehta, Pawan Aurora
2013 — conf
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds.
FAW-AAIM
Pawan Aurora, Sumit Singh, Shashank K. Mehta
2012 J jnl
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds
CoRR
Pawan Aurora, Sumit Singh, Shashank K. Mehta
2011 C conf
A Saturation Algorithm for Homogeneous Binomial Ideals.
COCOA
Deepanjan Kesh, Shashank K. Mehta
2011 J jnl
A saturation algorithm for homogeneous binomial ideals.
ACM Commun. Comput. Algebra
Deepanjan Kesh, Shashank K. Mehta
2010 J jnl
Generalized Reduction to Compute toric ideals.
Discret. Math. Algorithms Appl.
Deepanjan Kesh, Shashank K. Mehta
2009 J jnl
Critically indecomposable graphs.
Discret. Appl. Math.
Chandan K. Dubey, Shashank K. Mehta
2009 B conf
Generalized Reduction to Compute Toric Ideals.
ISAAC
Deepanjan Kesh, Shashank K. Mehta
2008 A* conf
Implied Set Closure and Its Application to Memory Consistency Verification.
CAV
Surender Baswana, Shashank K. Mehta, Vishal Powar
2008 — conf
Polynomial irreducibility testing through Minkowski summand computation.
CCCG
Deepanjan Kesh, Shashank K. Mehta
2007 — conf
Symbolic Path Sensitization Analysis and Applications.
ATS
Jian Kang, Sharad C. Seth, Shashank K. Mehta
2006 B conf
Algorithms on Graphs with Small Dominating Targets.
ISAAC
Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta
2006 Misc conf
On Indecomposability Preserving Elimination Sequences.
COCOON
Chandan K. Dubey, Shashank K. Mehta
2005 Misc conf
Conditionally Critical Indecomposable Graphs.
COCOON
Chandan K. Dubey, Shashank K. Mehta, Jitender S. Deogun
2005 B conf
Domination Search on Graphs with Low Dominating-Target-Number.
WG
Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun
2005 J jnl
Some Algorithms on Conditionally Critical Indecomposable Graphs.
Electron. Notes Discret. Math.
Chandan K. Dubey, Shashank K. Mehta
2004 — conf
A nonparametric classifier for unsegmented text.
DRR
George Nagy, Ashutosh Joshi, Mukkai S. Krishnamoorthy, Yu Lin, Daniel P. Lopresti, Shashank K. Mehta, Sharad C. Seth
2004 C conf
Broadband Optical Wireless Internet: Delay Optimization.
BROADNETS
Ahmed M. Mahdy, Jitender S. Deogun, Shashank K. Mehta
2004 B conf
End-to-End Delay Heuristics for Adaptive Optical Wireless Networks.
MASCOTS
Ahmed M. Mahdy, Jitender S. Deogun, Shashank K. Mehta
2003 — conf
Indirect Symbolic Correlation Approach to Unsegmented Text Recognition.
CVPR Workshops
George Nagy, Sharad C. Seth, Shashank K. Mehta, Yu Lin
2003 J jnl
Modeling Fault Coverage of Random Test Patterns.
J. Electron. Test.
Hailong Cui, Sharad C. Seth, Shashank K. Mehta
2002 — conf
A Novel Method to Improve the Test Efficiency of VLSI Tests.
ASP-DAC/VLSI Design
Hailong Cui, Sharad C. Seth, Shashank K. Mehta
2001 Misc conf
Design Verification and Functional Testing of FiniteState Machines.
VLSI Design
Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr
2000 A conf
Exploiting don't cares to enhance functional tests.
ITC
Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr
1999 J jnl
A synthesis for testability scheme for finite state machines using clock control.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Kent L. Einspahr, Shashank K. Mehta, Sharad C. Seth
1999 Misc conf
Empirical Computation of Reject Ratio in VLSI Testing.
VLSI Design
Shashank K. Mehta, Sharad C. Seth
1998 — conf
Synthesis of Sequential Circuits with Clock Control to Improve Testability.
Asian Test Symposium
Kent L. Einspahr, Shashank K. Mehta, Sharad C. Seth
1997 Misc conf
Synthesis for Testability by Two-Clock Control.
VLSI Design
Shashank K. Mehta, Kent L. Einspahr, Sharad C. Seth
1993 J jnl
An analog neural network to solve the hamiltonian cycle problem.
Neural Networks
Shashank K. Mehta, Laszlo Fulop
1991 J jnl
Constrained Integer Approximation to Planar Line Intersection.
Inf. Process. Lett.
Shashank K. Mehta, Maharaj Mukherjee, George Nagy
1990 B conf
A neural algorithm to solve the Hamiltonian cycle problem.
IJCNN
Shashank K. Mehta, Laszlo Fulop