default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Nepomniaschaya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j4]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]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]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]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
- 2015
- [c16]Anna Nepomniaschaya:
Constructions Used in Associative Parallel Algorithms for Directed Graphs. PaCT 2015: 201-209 - 2011
- [c15]Anna Nepomniaschaya:
Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph. PaCT 2011: 182-191 - 2009
- [c14]Anna Nepomniaschaya:
Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph. PaCT 2009: 257-268 - 2007
- [c13]Anna Nepomniaschaya:
Associative Version of Italiano's Decremental Algorithm for the Transitive Closure Problem. PaCT 2007: 442-452 - 2005
- [c12]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]A. S. Nepomniaschaya, Zbigniew Kokosinski:
Associative Graph Processor and Its Properties. PARELEC 2004: 297-302 - 2003
- [c10]A. S. Nepomniaschaya:
Associative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees. PaCT 2003: 141-159 - 2002
- [c9]A. S. Nepomniaschaya:
Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees. PARELEC 2002: 399-404 - 2001
- [c8]A. S. Nepomniaschaya:
Efficient Implementation of Edmond's Algorithm for Finding Optimum Branchings on Associative Parallel Processors. ICPADS 2001: 3-8 - [c7]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]A. S. Nepomniaschaya:
An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs. ICPADS 2000: 455-462 - 1997
- [c5]A. S. Nepomniaschaya:
Solution of Path Problems Using Associative Parallel Processors. ICPADS 1997: 610-617 - 1996
- [c4]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]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]A. S. Nepomniaschaya:
Representations of the Prim-Dijkstra Algorithm on Associative Parallel Processors. Parcella 1996: 184-194 - 1995
- [c1]A. S. Nepomniaschaya:
Comparison of Two MST Algorithms for Associative Parallel Processors. PaCT 1995: 85-93
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
