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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Slobodan V. Petrovic

dblp:21/4069 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1

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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › stream cipher
clock-controlled shift registers		 0.011996
Correlation Attacks on Clock-Controlled Shift Registers in Keystream Generators · IEEE Trans. Computers 1996
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis
correlation attack		 0.011996
Correlation Attacks on Clock-Controlled Shift Registers in Keystream Generators · IEEE Trans. Computers 1996
Cryptographic primitives and cryptanalysis
stream cipher		 0.011996
Correlation Attacks on Clock-Controlled Shift Registers in Keystream Generators · IEEE Trans. Computers 1996

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

string edit distance · 0.0
YearPublicationVenuePosition
1996 Correlation Attacks on Clock-Controlled Shift Registers in Keystream Generators
abstract
A concept of constrained many-to-one string edit distances, with or without memory, based on edit operations of deletion and substitution is introduced, and the recursive algorithms for their efficient computation are derived. Their use for correlation attacks on clock-controlled shift register based keystream generators is proposed, the divide and conquer effect is examined, and the generalized reducibility property of functions with memory is pointed out as a design criterion.
Jovan Dj. Golic, Slobodan V. Petrovic
 IEEE Trans. Computers2
1995 Constrained Many-to-One String Editing with Memory
Jovan Dj. Golic, Slobodan V. Petrovic
 Inf. Sci.2
1993 String editing under a combination of constraints
Slobodan V. Petrovic, Jovan Dj. Golic
 Inf. Sci.1