skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, November 14 until 2:00 AM ET on Saturday, November 15 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 12

Search for: All records

Creators/Authors contains: "Pandey, A."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ; ; ; ; ; ; et al (, International Ocean Discovery Program)
    Free, publicly-accessible full text available April 8, 2026
  2. ; ; ; ; ; ; ; ; ; ; et al (, International Ocean Discovery Program)
    Free, publicly-accessible full text available April 8, 2026
  3. ; ; ; ; ; ; ; ; ; ; et al (, International Ocean Discovery Program)
    Free, publicly-accessible full text available April 8, 2026
  4. ; ; ; ; ; ; ; ; ; ; et al (, International Ocean Discovery Program)
    Free, publicly-accessible full text available April 8, 2026
  5. ; ; ; ; ; ; ; ; ; ; et al (, International Ocean Discovery Program)
    Free, publicly-accessible full text available April 8, 2026
  6. ; ; ; ; ; ; ; ; ; ; et al (, International Ocean Discovery Program)
    Free, publicly-accessible full text available April 8, 2026
  7. ; ; ; ; ; ; ; ; ; ; et al (, International Ocean Discovery Program)
    Free, publicly-accessible full text available April 8, 2026
  8. ; ; ; ; ; ; ; ; ; ; et al (, International Ocean Discovery Program)
    Free, publicly-accessible full text available April 8, 2026
  9. ; ; ; ; ; ; ; ; ; ; et al (, AAMAS)
    Accepted Manuscript Full Text Available
  10. ; ; ; ; ; ; (, IEEE)
    Incremental graphs that change over time capture the changing relationships of different entities. Given that many real-world networks are extremely large, it is often necessary to partition the network over many distributed systems and solve a complex graph problem over the partitioned network. This paper presents a distributed algorithm for identifying strongly connected components (SCC) on incremental graphs. We propose a two-phase asynchronous algorithm that involves storing the intermediate results between each iteration of dynamic updates in a novel meta-graph storage format for efficient recomputation of the SCC for successive iterations. To the best of our knowledge, this is the first attempt at identifying SCC for incremental graphs across distributed compute nodes. Our experimental analysis on real and synthesized graphs shows up to 2.8x performance improvement over the state-of-the-art by reducing the overall memory utilized and improving the communication bandwidth. 
    more » « less
    Full Text Available