S. N. Maheshwari
VIDWAN ID: 16660

Prof S. N. Maheshwari

Male
Honorary Professor | Department of Computer Science and Engineering
Indian Institute of Technology, Delhi
Delhi
Expertise: Computer Science Software Engineering
30 Publications
0 Projects
606 Scopus Citations
563 CrossRef
6 Years 8 Months Total Experience
Publications
30 Total
Articles
13
Proceedings
17
Activity

No publication activity to display.

Scopus Scopus
606 Citations
10 h-index
CrossRef CrossRef
563 Citations
9 h-index
Google Scholar Google Scholar

Loading Scholar statistics...

Professional Recognition

No Data Found

There is currently nothing to display here.

Community & Membership

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Personal Details

No Information Available

No information is available at this time.

Honorary Professor
Jan 2020 – Present
Indian Institute of Technology, Delhi | Department of Computer Science and Engineering
Engineering and Technology
Computer Science Software Engineering

Related Profiles

Scholarly Work

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

No Data Found

There is currently nothing to display here.

Scholarly Publications

Parallel algorithms for the convex hull problem in two dimensions

Conference Paper
Year: 1981. Volume: 111 LNCS , Pages: 358-372 .
Authors: Dhruva Nath; S. N. Maheshwari; P. C. P. Bhatt

Parallel algorithms for the connected components and minimal spanning tree problems

Journal Article
Information Processing Letters. Year: 1982. Volume: 14 , Issue: 1 , Pages: 7-11 .
Authors: Dhruva Nath; S.N. Maheshwari

Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees

Journal Article
IEEE Transactions on Computers. Year: 1983. Volume: C-32 , Issue: 6 , Pages: 569-581 .
Authors: Nath; Maheshwari; Bhatt

MULTI-LEVEL ASSOCIATIVE PROCESSOR ARCHITECTURE FOR PARALLEL PROCESSING.

Conference Paper
Year: 1985. Pages: 641-649 .

An O(n2) algorithm for fan-out free query optimization

Conference Paper
Year: 1987. Volume: 287 LNCS , Pages: 242-264 .
Authors: Pratul Dublish; S. N. Maheshwari

An O(N2) equivalence algorithm for fan-out free queries

Conference Paper
Year: 1988. Volume: 326 LNCS , Pages: 176-190 .
Authors: Pratul Dublish; S. N. Maheshwari

Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

Journal Article
Journal of Algorithms. Year: 1988. Volume: 9 , Issue: 4 , Pages: 507-537 .
Authors: J Cheriyan; S.N Maheshwari

Analysis of preflow push algorithms for maximum network flow

Conference Paper
Year: 1988. Volume: 338 LNCS , Pages: 30-48 .
Authors: J. Cheriyan; S. N. Maheshwari
Showing 1 to 8 of 30 publications