H. Ramesh

California State University, Fresno — United States

Computer Science · Physical Sciences

13h-index724citations23works1.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(9), Complexity and Algorithms in Graphs(6), Computational Geometry and Mesh Generation(6), Algorithms and Data Compression(6), semigroups and automata theory(3)

Publications23 total

Demonstrating Simple Power Analysis on a B-163 Scalar Multiplier Using ChipWhisperer
2025
Efficient Designs for the 8-Bit Approximate Fixed Point Multiplication
2024· 2 cited
Application of Quantum-Based K-Nearest Neighbors Algorithm in Optical Fiber Classification
Lecture notes in electrical engineering·2023· 1 cited
Algorithms for generating all spanning trees of undirected, directed and weighted graphs
Lecture notes in computer science·2005· 15 cited
Covering Rectilinear Polygons with Axis-Parallel Rectangles
NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)·2003· 31 cited
String matching in O(n+m) quantum time
Journal of Discrete Algorithms·2003· 95 cited
Derandomizing semidefinite programming based approximation algorithms
2002· 67 cited
The restriction mapping problem revisited
Journal of Computer and System Sciences·2002· 26 cited
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
Lecture notes in computer science·2002· 1 cited
String Matching in ${\tilde O}(\sqrt{n}+\sqrt{m})$ Quantum Time
arXiv (Cornell University)·2000· 1 citedOpen Access
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
Algorithmica·2000· 47 cited
Hardness of set cover with intersection 1
Rare & Special e-Zone (The Hong Kong University of Science and Technology)·2000· 82 cited
Coupling vs. conductance for the Jerrum-Sinclair chain
Random Structures and Algorithms·2000· 13 cited
Efficient Expected-Case Algorithms for Planar Point Location
Lecture notes in computer science·2000· 24 cited
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)·1999· 3 cited
Derandomizing Approximation Algorithms Based on Semidefinite Programming
SIAM Journal on Computing·1999· 103 cited
Who will win the toss?
Resonance·1998· 2 cited
A 2.5-factor approximation algorithm for the k-MST problem
Information Processing Letters·1998· 45 cited
Graph editing to bipartite interval graphs: Exact and asymptotic bounds
Lecture notes in computer science·1997· 13 cited
String Matching under a General Matching Relation
Information and Computation·1995· 26 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Vijay Kumar(4), Sanjiv Kapoor(3), Vishwa Vinay(3), Sunil Arya(3), Sanjeev Mahajan(2), S. Muthukrishnan(2), Hayssam El-Razouk(2), Gopal Pandurangan(1), Siu-Wing Cheng(1), David M. Mount(1), K. Cirino(1), S. Muthukrishnan(1), N. S. Narayanaswamy(1), Kaptan Singh(1), Sai Varun Puligilla(1), Ankur Lnu(1), K. V. M. Naidu(1), Kaustav Bhowmick(1)