Sarnath Ramnath

According to our database1, Sarnath Ramnath authored at least 23 papers between 1992 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Optimal Load Balanced Demand Distribution under Overload Penalties.
CoRR, 2020

A Multi-threaded Algorithm for Capacity Constrained Assignment over Road Networks.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2020

2016
Enhancing Engagement by Blending Rigor and Relevance.
Proceedings of the 47th ACM Technical Symposium on Computing Science Education, 2016

Applying the Whole-Part-Whole Andragogy to Computing.
Proceedings of the 2016 ACM Conference on Innovation and Technology in Computer Science Education, 2016

2015
Object-Oriented Analysis, Design and Implementation - An Integrated Approach, Second Edition
Undergraduate Topics in Computer Science, Springer, ISBN: 978-3-319-24280-4, 2015

A Spatio-Temporally Opportunistic Approach to Best-Start-Time Lagrangian Shortest Path.
Proceedings of the Advances in Spatial and Temporal Databases, 2015

2011
Object-Oriented Analysis and Design.
Undergraduate Topics in Computer Science, Springer, ISBN: 978-1-84996-522-4, 2011

2008
Evolving an integrated curriculum for object-oriented analysis and design.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

2004
Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering.
SIAM J. Discret. Math., 2004

2003
New approximations for the rectilinear Steiner arborescence problem [VLSI layout].
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003

Pattern Integration: Emphasizing the De-Coupling of Software Subsystems in Conjunction with the Use of Design Patterns.
J. Object Technol., 2003

2002
An active learning environment for intermediate computer architecture courses.
Proceedings of the 2002 workshop on Computer architecture education, 2002

Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm.
Proceedings of the Algorithm Theory, 2002

2000
On the isomorphism of expressions.
Inf. Process. Lett., 2000

1999
Improved Upper Bounds for Time-Space Trade-offs for Selection.
Nord. J. Comput., 1999

Selecting Small Ranks in EREW PRAM.
Inf. Process. Lett., 1999

1998
Scalable algorithms for the mesh with buses: merging, sorting and selection.
Int. J. Comput. Math., 1998

Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage.
Proceedings of the Algorithm Theory, 1998

1997
Fully dynamic algorithms for permutation graph coloring.
Int. J. Comput. Math., 1997

A Centroid Labeling Technique and its Application to Path Selection in Trees (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

1996
Optimal Parallel Selection in Sorted Matrices.
Inf. Process. Lett., 1996

On Two-Processor Scheduling and Maximum Matching in Permutation Graphs.
Inf. Process. Lett., 1996

1992
DTML is Logspace Hard under NC<sup>1</sup> Reductions.
Parallel Process. Lett., 1992


  Loading...