default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjeev K. Aggarwal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c11]Debjyoti Paul, Sanjeev K. Aggarwal:
Multi-objective Evolution Based Dynamic Job Scheduler in Grid. CISIS 2014: 359-366- 2013
- [c10]Varun Modi, Subhajit Roy, Sanjeev K. Aggarwal:
Exploring program phases for statistical bug localization. PASTE 2013: 33-40 - 2012
- [c9]Saurabh Joshi, R. K. Shyamasundar, Sanjeev K. Aggarwal:
A New Method of MHP Analysis for Languages with Dynamic Barriers. IPDPS Workshops 2012: 519-528 - [e3]Sanjeev K. Aggarwal, T. V. Prabhakar, Vasudeva Varma, Srinivas Padmanabhuni:
Proceeding of the 5th Annual India Software Engineering Conference, ISEC 2012, Kanpur, India, February 22-25, 2012. ACM 2012, ISBN 978-1-4503-1142-7 [contents] - 2011
- [c8]Varun Mishra, Sanjeev K. Aggarwal:
ParTool: A Feedback-Directed Parallelizer. APPT 2011: 157-171 - [c7]Bruce Andrew Doyle, Alvin Leng Sun Loke, Sanjeev K. Maheshwari, Charles Lin Wang, Dennis Michael Fischette, Jeffrey G. Cooper, Sanjeev K. Aggarwal, Tin Tin Wee, Chad O. Lackey, Harishkumar S. Kedarnath, Michael M. Oshima, Gerry R. Talbot, Emerson S. Fang:
Extending HyperTransport™ technology to 8.0 Gb/s in 32-nm SOI-CMOS processors. A-SSCC 2011: 133-136 - [c6]Sanjeev K. Maheshwari, Emerson S. Fang, Sanjeev K. Aggarwal:
32-nm SOI programmable, high-bandwidth 8.0-GHz digital PLL. CICC 2011: 1-4 - 2010
- [e2]Srinivas Padmanabhuni, Sanjeev K. Aggarwal, Umesh Bellur:
Proceeding of the 3rd Annual India Software Engineering Conference, ISEC 2010, Mysore, India, February 25-27, 2010. ACM 2010, ISBN 978-1-60558-922-0 [contents]
2000 – 2009
- 2009
- [e1]Manish Parashar, Sanjeev K. Aggarwal:
Distributed Computing and Internet Technology, 5th International Conference, ICDCIT 2008, New Delhi, India, December 10-12, 2008. Proceedings. Lecture Notes in Computer Science 5375, Springer 2009, ISBN 978-3-540-89736-1 [contents] - 2008
- [c5]Nitin B. Gorde, Sanjeev K. Aggarwal:
A Fault Tolerance Scheme for Hierarchical Dynamic Schedulers in Grids. ICPP Workshops 2008: 53-58 - 2007
- [c4]Sumit W. Sorde, Sanjeev K. Aggarwal, Jie Song, Melvin Koh, Simon See:
Modeling and Verifying Non-DAG Workflows for Computational Grids. IEEE SCW 2007: 237-243 - 2006
- [c3]Arati Kadav, Sanjeev K. Aggarwal:
A Workflow Editor and Scheduler for Composing Applications on Computational Grids. ICPADS (2) 2006: 127-132 - 2005
- [c2]Y. Prasanth, Sanjeev K. Aggarwal:
From Specifications to Code Compliance Checkers. IASTED Conf. on Software Engineering 2005: 287-292 - 2004
- [c1]Shiladitya Biswas, Sanjeev K. Aggarwal:
A technique for extracting grammar from legacy programs. IASTED Conf. on Software Engineering 2004: 652-657
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-09 13:23 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:
