default search action
Sarnath Ramnath
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Sarnath Ramnath
, Stephen Walk
Structuring Formal Methods into the Undergraduate Computer Science Curriculum. NFM 2024: 399-405 - 2023
- [i2]Sarnath Ramnath, Venkata M. V. Gunturi, Subi Dangol, Abhishek Mishra, Pradeep Kumar:
Load Balanced Demand Distribution under Overload Penalties. CoRR abs/2304.06543 (2023) - 2022
- [c10]Sarnath Ramnath, Brahma Dathan:
Crossing Learning Thresholds Progressively via Active Learning. SPLASH-E 2022: 14-23 - 2020
- [c9]Abhishek Mishra, Venkata M. V. Gunturi
A Multi-threaded Algorithm for Capacity Constrained Assignment over Road Networks. ICA3PP (1) 2020: 125-142 - [i1]Sarnath Ramnath, Venkata M. V. Gunturi:
Optimal Load Balanced Demand Distribution under Overload Penalties. CoRR abs/2009.01765 (2020)
2010 – 2019
- 2016
- [c8]Sarnath Ramnath:
Applying the Whole-Part-Whole Andragogy to Computing. ITiCSE 2016: 372 - [c7]Sarnath Ramnath, John H. Hoover:
Enhancing Engagement by Blending Rigor and Relevance. SIGCSE 2016: 108-113 - 2015
- [b2]Brahma Dathan, Sarnath Ramnath:
Object-Oriented Analysis, Design and Implementation - An Integrated Approach, Second Edition. Undergraduate Topics in Computer Science, Springer 2015, ISBN 978-3-319-24278-1, pp. 3-453 - [c6]Sarnath Ramnath, Zhe Jiang
A Spatio-Temporally Opportunistic Approach to Best-Start-Time Lagrangian Shortest Path. SSTD 2015: 274-291 - 2011
- [b1]Sarnath Ramnath, Brahma Dathan:
Object-Oriented Analysis and Design. Undergraduate Topics in Computer Science, Springer 2011, ISBN 978-1-84996-521-7, pp. i-xvii, 1-470
2000 – 2009
- 2008
- [c5]Sarnath Ramnath, Brahma Dathan:
Evolving an integrated curriculum for object-oriented analysis and design. SIGCSE 2008: 337-341 - 2004
- [j11]Sarnath Ramnath:
Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering. SIAM J. Discret. Math. 18(2): 272-286 (2004) - 2003
- [j10]Sarnath Ramnath, Brahma Dathan:
Pattern Integration: Emphasizing the De-Coupling of Software Subsystems in Conjunction with the Use of Design Patterns. J. Object Technol. 2(2): 7-16 (2003) - [j9]Sarnath Ramnath:
New approximations for the rectilinear Steiner arborescence problem [VLSI layout]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(7): 859-869 (2003) - 2002
- [c4]Sarnath Ramnath:
Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm. SWAT 2002: 220-229 - [c3]Jayantha Herath, Sarnath Ramnath, Ajantha Herath, Susantha Herath:
An active learning environment for intermediate computer architecture courses. WCAE 2002: 8 - 2000
- [j8]Sarnath Ramnath, Peiyi Zhao:
On the isomorphism of expressions. Inf. Process. Lett. 74(3-4): 97-102 (2000)
1990 – 1999
- 1999
- [j7]Sarnath Ramnath, Venkatesh Raman:
Selecting Small Ranks in EREW PRAM. Inf. Process. Lett. 71(5-6): 183-186 (1999) - [j6]Venkatesh Raman, Sarnath Ramnath:
Improved Upper Bounds for Time-Space Trade-offs for Selection. Nord. J. Comput. 6(2): 162-180 (1999) - 1998
- [j5]Sarnath Ramnath:
Scalable algorithms for the mesh with buses: merging, sorting and selection. Int. J. Comput. Math. 69(1-2): 17-32 (1998) - [c2]Venkatesh Raman, Sarnath Ramnath:
Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. SWAT 1998: 131-142 - 1997
- [j4]Zoran Ivkovic, Sarnath Ramnath, Sivaprakasam Sunder:
Fully dynamic algorithms for permutation graph coloring. Int. J. Comput. Math. 63(1-2): 37-55 (1997) - [c1]Sarnath Ramnath, Hong Shen:
A Centroid Labeling Technique and its Application to Path Selection in Trees (Extended Abstract). WADS 1997: 368-377 - 1996
- [j3]Sarnath Ramnath, Sivaprakasam Sunder:
On Two-Processor Scheduling and Maximum Matching in Permutation Graphs. Inf. Process. Lett. 57(6): 321-327 (1996) - [j2]Hong Shen, Sarnath Ramnath:
Optimal Parallel Selection in Sorted Matrices. Inf. Process. Lett. 59(3): 117-122 (1996) - 1992
- [j1]Sarnath Ramnath:
DTML is Logspace Hard under NC1 Reductions. Parallel Process. Lett. 2: 189-193 (1992)
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 2024-07-05 21:05 CEST 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: