A. Sh. Nepomnyashchaya

From MaRDI portal
Person:1062449

Available identifiers

zbMath Open nepomniaschaya.anna-shmilevnaMaRDI QIDQ1062449

List of research outcomes

PublicationDate of PublicationType
ASSOCIATIVE PARALLEL ALGORITHM FOR DYNAMIC UPDATE OF SHORTEST PATHS TREE AFTER INSERTING AN ARC2021-02-17Paper
SOLUTION OF GRAPH PROBLEMS BY MEANS OF THE STAR-MACHINE BEING IMPLEMENTED ON GPUS2021-02-15Paper
https://portal.mardi4nfdi.de/entity/Q45536292018-10-30Paper
https://portal.mardi4nfdi.de/entity/Q46100762018-04-05Paper
https://portal.mardi4nfdi.de/entity/Q29798242017-04-26Paper
https://portal.mardi4nfdi.de/entity/Q29798322017-04-26Paper
https://portal.mardi4nfdi.de/entity/Q29798512017-04-26Paper
https://portal.mardi4nfdi.de/entity/Q29798592017-04-26Paper
https://portal.mardi4nfdi.de/entity/Q29798862017-04-26Paper
https://portal.mardi4nfdi.de/entity/Q29702132017-03-29Paper
https://portal.mardi4nfdi.de/entity/Q29638752017-02-21Paper
https://portal.mardi4nfdi.de/entity/Q29638842017-02-21Paper
https://portal.mardi4nfdi.de/entity/Q28829452012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q28829882012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q28830052012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q28805902012-04-13Paper
https://portal.mardi4nfdi.de/entity/Q28806062012-04-13Paper
https://portal.mardi4nfdi.de/entity/Q28806152012-04-13Paper
https://portal.mardi4nfdi.de/entity/Q36014052009-02-10Paper
Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph2006-09-06Paper
https://portal.mardi4nfdi.de/entity/Q57112592005-12-12Paper
https://portal.mardi4nfdi.de/entity/Q44294272003-09-25Paper
Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors2003-09-01Paper
https://portal.mardi4nfdi.de/entity/Q47786492002-11-18Paper
A comparison of associative computation models2001-07-24Paper
Comparison of the Prim-Dijkstra and Kraskal algorithms on an associative parallel processor2001-01-15Paper
https://portal.mardi4nfdi.de/entity/Q45173722000-11-21Paper
https://portal.mardi4nfdi.de/entity/Q45078252000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q44994842000-08-30Paper
https://portal.mardi4nfdi.de/entity/Q49472232000-04-16Paper
https://portal.mardi4nfdi.de/entity/Q49473092000-04-16Paper
https://portal.mardi4nfdi.de/entity/Q49473172000-04-16Paper
https://portal.mardi4nfdi.de/entity/Q49473262000-04-16Paper
https://portal.mardi4nfdi.de/entity/Q49473332000-04-16Paper
Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint1999-05-03Paper
STAR -- a language for associative and parallel computation with vertical processing1997-01-14Paper
Optimal representation of the minimum spanning tree algorithm in associative parallel processors1996-08-25Paper
Use of special processors for efficient realization of operations of relational algebra in vertical-processing systems1995-08-06Paper
https://portal.mardi4nfdi.de/entity/Q52037021986-01-01Paper
Decidability of the equivalence problem for synchronous deterministic pushdown-store automata1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32191351984-01-01Paper
The equivalence problem for an extension of LL(k)-grammars1981-01-01Paper
Generalization of LL(k)-grammars containing non-single-valued grammars, and the problem of syntactic analysis1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41310501977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41397021975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47700021974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56407281972-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: A. Sh. Nepomnyashchaya