Anna Nepomniaschaya

According to our database, Anna Nepomniaschaya authored at least 20 papers between 1995 and 2015.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2015

Constructions Used in Associative Parallel Algorithms for Directed Graphs.

Anna Nepomniaschaya

Proceedings of the Parallel Computing Technologies - 13th International Conference, PaCT 2015, Petrozavodsk, Russia, August 31, 2015

2013

Efficient Parallel Implementation of the Ramalingam Decremental Algorithm for Updating the Shortest Paths Subgraph.

Anna Nepomniaschaya

Comput. Informatics, 2013

2011

Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph.

Anna Nepomniaschaya

Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011

2009

Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph.

Anna Nepomniaschaya

Proceedings of the Parallel Computing Technologies, 10th International Conference, 2009

2008

Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors.

Anna Nepomniaschaya

Fundam. Informaticae, 2008

2007

Associative Version of Italiano's Decremental Algorithm for the Transitive Closure Problem.

Anna Nepomniaschaya

Proceedings of the Parallel Computing Technologies, 2007

2005

Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex.

A. S. Nepomniaschaya

Proceedings of the Parallel Computing Technologies, 2005

2004

Associative Graph Processor and Its Properties.

A. S. Nepomniaschaya, Zbigniew Kokosinski

Proceedings of the 2004 International Conference on Parallel Computing in Electrical Engineering (PARELEC 2004), 2004

2003

Associative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees.

A. S. Nepomniaschaya

Proceedings of the Parallel Computing Technologies, 2003

2002

Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees.

A. S. Nepomniaschaya

Proceedings of the 2002 International Conference on Parallel Computing in Electrical Engineering (PARELEC 2002), 2002

2001

Representation of Edmonds' Algorithm for Finding Optimum Graph Branching on Associative Parallel Processors.

A. S. Nepomniaschaya

Program. Comput. Softw., 2001

An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs.

A. S. Nepomniaschaya

Proceedings of the Parallel Computing Technologies, 2001

Efficient Implementation of Edmond's Algorithm for Finding Optimum Branchings on Associative Parallel Processors.

A. S. Nepomniaschaya

Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001

2000

A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors.

A. S. Nepomniaschaya, Maria A. Dvoskina

Fundam. Informaticae, 2000

An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs.

A. S. Nepomniaschaya

Proceedings of the Seventh International Conference on Parallel and Distributed Systems, 2000

1997

Solution of Path Problems Using Associative Parallel Processors.

A. S. Nepomniaschaya

Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

1996

Representations of the Prim-Dijkstra Algorithm on Associative Parallel Processors.

A. S. Nepomniaschaya

Proceedings of the Parcella 1996, 1996

Representation of the Gabow Algorithm for Finding Smallest Trees with a Degree Constraint on Associative Parallel Processors.

A. S. Nepomniaschaya

Proceedings of the Euro-Par '96 Parallel Processing, 1996

An Associative Version of the Prim-Dijkstra Algorithm and Its Application to Some Graph Problems.

A. S. Nepomniaschaya

Proceedings of the Perspectives of System Informatics, 1996

1995

Comparison of Two MST Algorithms for Associative Parallel Processors.

A. S. Nepomniaschaya

Proceedings of the Parallel Computing Technologies, 1995