Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
H. Ramesh
Observed names:
H Ramesh,
Harshitha Ramesh,
Ramesh, H,
Ramesh, H.
Institution:
California State University, Fresno
Observed institutions:
Max Planck Society,
Courant Institute of Mathematical Sciences,
Max Planck Institute for Informatics,
New York University,
Indian Institute of Science Bangalore,
California State University, Fresno,
Indian Institute of Technology Delhi
show all 7
OpenAlex ID:
A5113688016
String matching in O(n+m) quantum time
2003
·
H Ramesh
, V Vinay
·
Journal of Discrete Algorithms
·
113
PDF
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
1995
·
Sanjiv Kapoor
, H. Ramesh
·
SIAM Journal on Computing
·
106
Derandomizing Approximation Algorithms Based on Semidefinite Programming
1999
·
Sanjeev Mahajan
, H. Ramesh
·
SIAM Journal on Computing
·
101
Derandomizing semidefinite programming based approximation algorithms
2002
·
S. Mahajan
, H. Ramesh
·
Annual Symposium on Foundations of Computer Science
·
67
A 2.5-factor approximation algorithm for the k-MST problem
1998
·
Sunil Arya
, H. Ramesh
·
Information Processing Letters
·
47
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
2000
·
S. Kapoor
, H. Ramesh
·
Algorithmica
·
43
The restriction mapping problem revisited
2002
·
Gopal Pandurangan
, H. Ramesh
·
Journal of Computer and System Sciences
·
25
PDF
Efficient Expected-Case Algorithms for Planar Point Location
2000
·
Sunil Arya
, Siu-Wing Cheng
, et al.
·
Lecture notes in computer science
·
25
String Matching under a General Matching Relation
1995
·
S. Muthukrishnan
, H. Ramesh
·
Information and Computation
·
25
Algorithms for generating all spanning trees of undirected, directed and weighted graphs
2005
·
Sanjiv Kapoor
, H. Ramesh
·
Springer eBooks
·
17
Coupling vs. conductance for the Jerrum-Sinclair chain
2000
·
V.S. Anil Kumar
, H. Ramesh
·
Random Structures and Algorithms
·
14
On traversing layered graphs on-line
1993
·
H. Ramesh
·
14
Graph editing to bipartite interval graphs: Exact and asymptotic bounds
1997
·
K. Cirino
, S. Muthukrishnan
, et al.
·
Lecture notes in computer science
·
11
String Matching in ${\tilde O}(\sqrt{n}+\sqrt{m})$ Quantum Time
2000
·
Ramesh, H.
, Vinay, V.
·
arXiv (Cornell University)
·
6
PDF
String matching under a general matching relation
1992
·
S. Muthukrishnan
, H. Ramesh
·
Lecture notes in computer science
·
5
Who will win the toss?
1998
·
H. Ramesh
, V. Vinay
·
Resonance
·
2
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
2002
·
K. V. M. Naidu
, H. Ramesh
·
Lecture notes in computer science
·
1
Demonstrating Simple Power Analysis on a B-163 Scalar Multiplier Using ChipWhisperer
2025
·
Harshitha Ramesh
, Hayssam El-Razouk
·
IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)
Show more works
View as search
Works count:
20
Citation count:
622
H-index:
12
I10-index:
13
Year
Topic
Type
