Anna Sh. Nepomniaschaya E-mail anep@ssd.sscc.ru anep@comcen.nsk.su Organization Institute of Computational Mathematics and Mathematical Geophysics SB RAS — senior researcher Academic degree PhD
Nepomniaschaya A. Efficient parallel implementation of the Ramalingam decremental algorithm for updating the all-pairs shortest paths // Computer Science. — 2018. — # 42 — P. 41-60
Nepomniaschaya A. Associative version of the Ramalingam incremental algorithm for the dynamic all-pairs shortest-path problem // Computer Science. — 2016. — # 40 — P. 75–86
Nepomniaschaya A. An associative version of the Ramalingam decremental algorithm for the dynamic all-pairs shortest-path problem // Computer Science. — 2016. — # 39 — P. 37-50
Nepomniaschaya A. Constructions used in associative parallel algorithms for undirected graphs. Part 2 // Computer Science. — 2014. — # 36 — P. 65-78
Nepomniaschaya A. Constructions used in associative parallel algorithms for undirected graphs. Part 1 // Computer Science. — 2013. — # 35 — P. 69-83
Nepomniaschaya A. A technique for finding the second simple shortest paths using associative parallel processors // Computer Science. — 2012. — # 33 — P. 43-57
Nepomniaschaya A. Decremental associative algorithm for updating the shortest paths tree // Computer Science. — 2011. — # 32 — P. 93-106
Nepomniaschaya A. Parallel implementation of the Ramalingam incremental algorithm for dynamic updating the shortest-paths subgraph // Computer Science. — 2010. — # 30 — P. 53-69
Nepomniaschaya A. Basic associative parallel algorithms for vertical processing systems // Computer Science. — 2009. — # 29 — P. 63-77
Nepomniaschaya A. Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph // Computer Science. — 2008. — # 28 — P. 93-109
Nepomniaschaya A. Efficient associative algorithms for implementing the second group of relational algebra operations // Computer Science. — 2008. — # 27 — P. 105-117
Nepomniaschaya A. Associative version of Italiano's incremental algorithm for dynamic updating the transitive closure // Computer Science. — 2007. — # 26 — P. 91-101
Nepomniaschaya A. An efficient associative algorithm for multi-comparand parallel searching and its applications // Computer Science. — 2006. — # 25 — P. 37-48
Nepomniaschaya A., Snytnikova T. Associative parallel algorithm for dynamic reconstruction of the shortest paths tree after insertion of a vertex // Computer Science. — 2006. — # 24 — P. 89-103
Nepomniaschaya A. Efficient update of tree paths on associative systems with bit-parallel processing // Computer Science. — 2005. — # 23 — P. 71-83
Nepomniaschaya A. A new technique for updating tree paths on associative parallel processors // Computer Science. — 2004. — # 21 — P. 85-97
Nepomniaschaya A. Concurrent selection of the shortest paths and distances in directed graphs using vertical processing systems // Computer Science. — 2003. — # 19 — P. 61-71
Nepomniaschaya A., Borets T. Associative parallel algorithm of checking spanning trees for optimality // Computer Science. — 2002. — # 17 — P. 75-88
Nepomniaschaya A. An associative version of the Edmonds–Karp–Ford shortest path algorithm // Computer Science. — 2001. — # 14 — P. 29-42
Nepomniaschaya A. An associative algorithm for finding a maximum-weight cycle in directed graphs // Computer Science. — 1999. — # 11 — P. 45-58
Nepomniaschaya A., Dvoskina M. Finding single-source shortest paths using associative parallel processors // Computer Science. — 1999. — # 10 — P. 57-72
Nepomniaschaya A. An associative version of Edmond's algorithm for finding optimum branchings // Computer Science. — 1998. — # 9 — P. 77-92
Nepomniaschaya A., Taborskaya O. Associative algorithms for graphs represented as an adjacency matrix // Computer Science. — 1997. — # 7 — P. 21-33
Nepomniaschaya A., Vladyko M. Comparison of two models for associative parallel computations // Computer Science. — 1997. — # 6 — P. 59-69
Nepomniaschaya A. Associative version of the Gabow algorithm for finding smallest spanning trees with a degree constraint // Computer Science. — 1996. — # 4 — P. 55-66
Nepomniaschaya A. Effective representation of algorithm for finding a minimal spanning tree of a graph in associative parallel processor // Computer Science. — 1995. — # 3 — P. 77-88
Nepomniaschaya A., Fet Y. Investigation of some hardware accelerators for relational algebra operations // Computer Science. — 1994. — # 2 — P. 45-62
Nepomniaschaya A. High level language STAR for associative parallel processors and its application to relational algebra // Computer Science. — 1993. — # 1 — P. 23-35
