default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLov K. Grover
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Lovleen Kumar Grover
, Anchal Sharma:
Improved estimators of population variance using robust measures in case of missing data. J. Comput. Appl. Math. 442: 115729 (2024)- 2021
- [j13]Lovleen Kumar Grover, Amanpreet Kaur:
An improved regression type estimator of population mean with two auxiliary variables and its variant using robust regression method. J. Comput. Appl. Math. 382: 113072 (2021)
2010 – 2019
- 2016
- [r2]Apoorva D. Patel, Lov K. Grover:
Quantum Search. Encyclopedia of Algorithms 2016: 1707-1716 - 2014
- [j12]Lovleen Kumar Grover, Parmdeep Kaur:
A Generalized Class of Ratio Type Exponential Estimators of Population Mean Under Linear Transformation of Auxiliary Variable. Commun. Stat. Simul. Comput. 43(7): 1552-1574 (2014) - 2012
- [j11]Lovleen Kumar Grover, Parmdeep Kaur, Gajendra K. Vishawkarma:
Product type exponential estimators of population mean under linear transformation of auxiliary variable in simple random sampling. Appl. Math. Comput. 219(4): 1937-1946 (2012) - 2011
- [j10]Lovleen Kumar Grover, Parmdeep Kaur:
An improved exponential estimator of finite population mean in simple random sampling using an auxiliary attribute. Appl. Math. Comput. 218(7): 3093-3099 (2011) - [j9]Lovleen Kumar Grover, Paramdeep Kaur:
An improved estimator of the finite population mean in simple random sampling. Model. Assist. Stat. Appl. 6(1): 47-55 (2011)
2000 – 2009
- 2008
- [r1]Lov K. Grover, Ben Reichardt:
Quantum Search. Encyclopedia of Algorithms 2008 - 2007
- [j8]Lovleen Kumar Grover:
A wide and efficient class of estimators of population variance under sub-sampling scheme. Model. Assist. Stat. Appl. 2(1): 41-51 (2007) - 2006
- [j7]Tathagat Tulsi, Lov K. Grover, Apoorva D. Patel:
A new algorithm for fixed point quantum search. Quantum Inf. Comput. 6(6): 483-494 (2006) - [j6]Vladimir E. Korepin, Lov K. Grover:
Simple Algorithm for Partial Quantum Search. Quantum Inf. Process. 5(1): 5-10 (2006) - 2005
- [c11]Lov K. Grover, Jaikumar Radhakrishnan:
Is partial quantum search of a database any easier? SPAA 2005: 186-194 - [c10]Lov K. Grover:
Quantum Searching Amidst Uncertainty. UC 2005: 11-18 - 2004
- [j5]Lov K. Grover, Terry Rudolph:
How significant are the known collision and element distinctness quantum algorithms? Quantum Inf. Comput. 4(3): 201-206 (2004) - 2003
- [j4]Lov K. Grover:
An Improved Quantum Scheduling Algorithm. Int. J. Found. Comput. Sci. 14(5): 715-722 (2003) - 2000
- [j3]Nicolas J. Cerf, Lov K. Grover, Colin P. Williams:
Nested Quantum Search and NP-Hard Problems. Appl. Algebra Eng. Commun. Comput. 10(4/5): 311-338 (2000) - [c9]Lov K. Grover:
Rapid sampling though quantum computing. STOC 2000: 618-626
1990 – 1999
- 1999
- [c8]Lov K. Grover:
Quantum mechanical searching. CEC 1999: 2255-2264 - [c7]Lov K. Grover:
Invited Talk: Quantum Computation. VLSI Design 1999: 548- - 1998
- [c6]Lov K. Grover:
Quantum Search on Structured Problems. QCQC 1998: 126-139 - [c5]Lov K. Grover:
A Framework for Fast Quantum Mechanical Algorithms. STOC 1998: 53-62 - 1996
- [c4]Lov K. Grover:
A Fast Quantum Mechanical Algorithm for Database Search. STOC 1996: 212-219 - 1995
- [j2]Lov K. Grover:
Fast Interior Point Methods for Bipartite Matching. SIAM J. Optim. 5(4): 740-769 (1995) - 1992
- [j1]Lov K. Grover:
Local search and the local structure of NP-complete problems. Oper. Res. Lett. 12(4): 235-243 (1992) - [c3]Lov K. Grover:
Fast Parallel Algorithms for Bipartite Matching. IPCO 1992: 367-384
1980 – 1989
- 1988
- [c2]Sivanarayana Mallela, Lov K. Grover:
Clustering Based Simulated Annealing for Standard Cell Placement. DAC 1988: 312-317 - 1987
- [c1]Lov K. Grover:
Standard Cell Placement Using Simulated Sintering. DAC 1987: 56-59
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
