A. S. Nepomniaschaya

Publication Activity (10 Years)

Years Active: 1995-2005
Publications (10 Years): 0

Publications

A. S. Nepomniaschaya
Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex. PaCT (2005)
A. S. Nepomniaschaya, Zbigniew Kokosinski
Associative Graph Processor and Its Properties. PARELEC (2004)
A. S. Nepomniaschaya
Associative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees. PaCT (2003)
A. S. Nepomniaschaya
Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees. PARELEC (2002)
A. S. Nepomniaschaya
Efficient Implementation of Edmond's Algorithm for Finding Optimum Branchings on Associative Parallel Processors. ICPADS (2001)
A. S. Nepomniaschaya
An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs. PaCT (2001)
A. S. Nepomniaschaya
Representation of Edmonds' Algorithm for Finding Optimum Graph Branching on Associative Parallel Processors. Program. Comput. Softw. 27 (4) (2001)
A. S. Nepomniaschaya, Maria A. Dvoskina
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors. Fundam. Informaticae 43 (1-4) (2000)
A. S. Nepomniaschaya
An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs. ICPADS (2000)
A. S. Nepomniaschaya
Solution of Path Problems Using Associative Parallel Processors. ICPADS (1997)
A. S. Nepomniaschaya
An Associative Version of the Prim-Dijkstra Algorithm and Its Application to Some Graph Problems. Ershov Memorial Conference (1996)
A. S. Nepomniaschaya
Representations of the Prim-Dijkstra Algorithm on Associative Parallel Processors. Parcella (1996)
A. S. Nepomniaschaya
Representation of the Gabow Algorithm for Finding Smallest Trees with a Degree Constraint on Associative Parallel Processors. Euro-Par, Vol. I (1996)
A. S. Nepomniaschaya
Comparison of Two MST Algorithms for Associative Parallel Processors. PaCT (1995)