| 2005 |
|---|
| 14 | EE | A. S. Nepomniaschaya:
Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex.
PaCT 2005: 159-173 |
| 2004 |
|---|
| 13 | EE | A. S. Nepomniaschaya,
Zbigniew Kokosinski:
Associative Graph Processor and Its Properties.
PARELEC 2004: 297-302 |
| 2003 |
|---|
| 12 | EE | A. S. Nepomniaschaya:
Associative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees.
PaCT 2003: 141-159 |
| 2002 |
|---|
| 11 | EE | A. S. Nepomniaschaya:
Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees.
PARELEC 2002: 399-404 |
| 2001 |
|---|
| 10 | | A. S. Nepomniaschaya:
Efficient Implementation of Edmond's Algorithm for Finding Optimum Branchings on Associative Parallel Processors.
ICPADS 2001: 3-8 |
| 9 | EE | A. S. Nepomniaschaya:
An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs.
PaCT 2001: 285-292 |
| 8 | EE | A. S. Nepomniaschaya:
Representation of Edmonds' Algorithm for Finding Optimum Graph Branching on Associative Parallel Processors.
Programming and Computer Software 27(4): 200-206 (2001) |
| 2000 |
|---|
| 7 | EE | A. S. Nepomniaschaya:
An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs.
ICPADS 2000: 455-462 |
| 6 | | A. S. Nepomniaschaya,
Maria A. Dvoskina:
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors.
Fundam. Inform. 43(1-4): 227-243 (2000) |
| 1997 |
|---|
| 5 | EE | A. S. Nepomniaschaya:
Solution of Path Problems Using Associative Parallel Processors.
ICPADS 1997: 610-617 |
| 1996 |
|---|
| 4 | | A. S. Nepomniaschaya:
An Associative Version of the Prim-Dijkstra Algorithm and Its Application to Some Graph Problems.
Ershov Memorial Conference 1996: 203-213 |
| 3 | | 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: 813-817 |
| 2 | | A. S. Nepomniaschaya:
Representations of the Prim-Dijkstra Algorithm on Associative Parallel Processors.
Parcella 1996: 184-194 |
| 1995 |
|---|
| 1 | | A. S. Nepomniaschaya:
Comparison of Two MST Algorithms for Associative Parallel Processors.
PaCT 1995: 85-93 |
