 | 2011 |
|---|
| 4 |       | Anna Nepomniaschaya:
Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph.
PaCT 2011: 182-191 |
| 2009 |
|---|
| 3 | | Anna Nepomniaschaya:
Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph.
PaCT 2009: 257-268 |
| 2008 |
|---|
| 2 | | Anna Nepomniaschaya:
Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors.
Fundam. Inform. 89(2-3): 313-329 (2008) |
| 2007 |
|---|
| 1 | | Anna Nepomniaschaya:
Associative Version of Italiano's Decremental Algorithm for the Transitive Closure Problem.
PaCT 2007: 442-452 |
Data released under the ODC-BY 1.0 license — See also our legal information page