A. S. Nepomniaschaya

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