Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nedyalko Prisadnikov

dblp:02/11515 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0004-2202-8431ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › memory consistency
memory consistency model
0.112012
Dynamic synthesis for relaxed memory models · PLDI 2012
Memory systems › memory consistency › memory consistency model
weak memory model
0.112012
Dynamic synthesis for relaxed memory models · PLDI 2012
Memory systems › memory consistency
memory fences
0.012012
Dynamic synthesis for relaxed memory models · PLDI 2012

Methods — techniques the papers use, named apart from their topics

dynamic synthesis · 0.1
YearPublicationVenuePosition
2026 Accelerating Vision Foundation Models with Drop-in Depthwise Convolution
Carmelo Scribano, Mohammad Mahdi, Nedyalko Prisadnikov, Yuqian Fu, Giorgia Franchini, Danda Pani Paudel, Marko Bertogna, Luc Van Gool
ICPR (13)3
2012 Dynamic synthesis for relaxed memory models
abstract
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, allowing control of this behavior.
Nayden Nedev, Nedyalko Prisadnikov, Martin T. Vechev, Eran Yahav
PLDI3