Skip to content
cs-conference-ranking.org

A. S. Nepomniaschaya

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

8

Venues

3

Active years

1995–2005

Best venue rank

B

Where they publish

Papers

8 indexed papers, newest first.

YearVenueTitleAuthors
2005PACTAssociative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex.A. S. Nepomniaschaya
2003PACTAssociative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees.A. S. Nepomniaschaya
2001ICPADSEfficient Implementation of Edmond's Algorithm for Finding Optimum Branchings on Associative Parallel Processors.A. S. Nepomniaschaya
2001PACTAn Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs.A. S. Nepomniaschaya
2000ICPADSAn Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs.A. S. Nepomniaschaya
1997ICPADSSolution of Path Problems Using Associative Parallel Processors.A. S. Nepomniaschaya
1996EuroParRepresentation of the Gabow Algorithm for Finding Smallest Trees with a Degree Constraint on Associative Parallel Processors.A. S. Nepomniaschaya
1995PACTComparison of Two MST Algorithms for Associative Parallel Processors.A. S. Nepomniaschaya