Exponential Search
Exponential Search is a searching algorithm that belongs to the class of incremental search methods by first determining the range in which the target element is likely to reside through exponentially growing bounds and then applying binary search within that range.
35
Publications
2.6K
Citations
104
Authors
52
Institutions
Publications per year
2017–2026
18
Parents
35
Efficient and extensible algorithms for multi query optimization
Prasan Roy, S. Seshadri, S. Sudarshan et al. · ACM SIGMOD Record · 2000 · 409 citations
Natural language question answering over RDF
Lei Zou, Ruizhe Huang, Haixun Wang et al. · 2014 · 238 citations
Efficient and extensible algorithms for multi query optimization
Prasan Roy, S. Seshadri, S. Sudarshan et al. · 2000 · 226 citations
1–5 of 35
104
École Polytechnique Fédérale de Lausanne, Switzerland
3 publications · 337 citations
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 104
52

Bharathiar University
Coimbatore, India
2 h-index
3 publications
57 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
276 citations

Indian Institute of Technology Bombay
Mumbai, India
2 h-index
4 publications
1.3K citations
Bell (Canada)
Montreal, Canada
2 h-index
2 publications
635 citations
PLA Army Engineering University
Nanjing, China
2 h-index
10 publications
195 citations

Harbin Institute of Technology
Harbin, China
2 h-index
5 publications
238 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
2 h-index
3 publications
363 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
1 publications
238 citations
1–8 of 52
Repository · 3 publications · 272 citations
3
h-index
3 publications · 85 citations
3
h-index
AAI · 2 publications · 146 citations
2
h-index
1 publications · 169 citations
1
h-index
JACM · 1 publications · 107 citations
1
h-index
1–5