default search action

combined dblp search
author search
venue search
publication search

ask others

Anna Nepomniaschaya

A. S. Nepomniaschaya

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2013
[j4]
- view
  - electronic edition @ cai.sk (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/cai/Nepomniaschaya13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cai/Nepomniaschaya13
Anna Nepomniaschaya:
Efficient Parallel Implementation of the Ramalingam Decremental Algorithm for Updating the Shortest Paths Subgraph. Comput. Informatics 32(2): 331-354 (2013)
2008
[j3]
- view
  - electronic edition @ iospress.com
  - no references & citations available
- export record
  dblp key:
  - journals/fuin/Nepomniaschaya08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/Nepomniaschaya08
Anna Nepomniaschaya:
Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors. Fundam. Informaticae 89(2-3): 313-329 (2008)
2001
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/pcs/Nepomniaschaya01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pcs/Nepomniaschaya01
A. S. Nepomniaschaya:
Representation of Edmonds' Algorithm for Finding Optimum Graph Branching on Associative Parallel Processors. Program. Comput. Softw. 27(4): 200-206 (2001)
2000
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/fuin/NepomniaschayaD00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/NepomniaschayaD00
A. S. Nepomniaschaya, Maria A. Dvoskina:
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors. Fundam. Informaticae 43(1-4): 227-243 (2000)

Conference and Workshop Papers

see FAQ

What is the meaning of the colors in the publication lists?

2015
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/pact/Nepomniaschaya15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pact/Nepomniaschaya15
Anna Nepomniaschaya:
Constructions Used in Associative Parallel Algorithms for Directed Graphs. PaCT 2015: 201-209
2011
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/pact/Nepomniaschaya11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pact/Nepomniaschaya11
Anna Nepomniaschaya:
Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph. PaCT 2011: 182-191
2009
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/pact/Nepomniaschaya09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pact/Nepomniaschaya09
Anna Nepomniaschaya:
Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph. PaCT 2009: 257-268
2007
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/pact/Nepomniaschaya07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pact/Nepomniaschaya07
Anna Nepomniaschaya:
Associative Version of Italiano's Decremental Algorithm for the Transitive Closure Problem. PaCT 2007: 442-452
2005
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/pact/Nepomniaschaya05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pact/Nepomniaschaya05
A. S. Nepomniaschaya:
Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex. PaCT 2005: 159-173
2004
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/parelec/NepomniaschayaK04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/parelec/NepomniaschayaK04
A. S. Nepomniaschaya, Zbigniew Kokosinski:
Associative Graph Processor and Its Properties. PARELEC 2004: 297-302
2003
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/pact/Nepomniaschaya03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pact/Nepomniaschaya03
A. S. Nepomniaschaya:
Associative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees. PaCT 2003: 141-159
2002
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/parelec/Nepomniaschaya02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/parelec/Nepomniaschaya02
A. S. Nepomniaschaya:
Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees. PARELEC 2002: 399-404
2001
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/icpads/Nepomniaschaya01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icpads/Nepomniaschaya01
A. S. Nepomniaschaya:
Efficient Implementation of Edmond's Algorithm for Finding Optimum Branchings on Associative Parallel Processors. ICPADS 2001: 3-8
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/pact/Nepomniaschaya01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pact/Nepomniaschaya01
A. S. Nepomniaschaya:
An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs. PaCT 2001: 285-292
2000
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/icpads/Nepomniaschaya00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icpads/Nepomniaschaya00
A. S. Nepomniaschaya:
An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs. ICPADS 2000: 455-462
1997
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/icpads/Nepomniaschaya97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icpads/Nepomniaschaya97
A. S. Nepomniaschaya:
Solution of Path Problems Using Associative Parallel Processors. ICPADS 1997: 610-617
1996
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/ershov/Nepomniaschaya96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ershov/Nepomniaschaya96
A. S. Nepomniaschaya:
An Associative Version of the Prim-Dijkstra Algorithm and Its Application to Some Graph Problems. Ershov Memorial Conference 1996: 203-213
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/europar/Nepomniaschaya96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/Nepomniaschaya96
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
[c2]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/parcella/Nepomniaschaya96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/parcella/Nepomniaschaya96
A. S. Nepomniaschaya:
Representations of the Prim-Dijkstra Algorithm on Associative Parallel Processors. Parcella 1996: 184-194
1995
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/pact/Nepomniaschaya95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pact/Nepomniaschaya95
A. S. Nepomniaschaya:
Comparison of Two MST Algorithms for Associative Parallel Processors. PaCT 1995: 85-93

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.