Demo Data from EDBT 2026 / reviewers in the wild / expert
Michael Lucks
dblp:24/1490
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-authorTheory of computation · 1 · 1 first-author
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% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › cryptanalysis › cipher cryptanalysis
classical cipher cryptanalysis |
0.0 | 1 | 1988 | A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers · CRYPTO 1988 |
Cryptographic primitives and cryptanalysis › cryptanalysis › cipher cryptanalysis
substitution cipher decryption |
0.0 | 1 | 1988 | A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers · CRYPTO 1988 |
Computational complexity
constraint satisfaction |
0.0 | 1 | 1988 | A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers · CRYPTO 1988 |
Methods — techniques the papers use, named apart from their topics
constraint satisfaction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Automated selection of mathematical softwareabstractCurrent approaches to recommending mathematical software are qualitative and categorical. These approaches are unsatisfactory when the problem to be solved has features that can “trade-off” in the recommendation process. A quantitative system is proposed that permits tradeoffs and can be built and modified incrementally. This quantitative approach extends other knowledge-engineering techniques in its knowledge representation and aggregation facilities. The system is demonstrated on the domain of ordinary differential equation initial value problems. The results are significantly superior to an existing qualitative (decision tree) system. Michael Lucks, Ian Gladwell |
ACM Trans. Math. Softw. | 1 |
| 1988 | A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers
Michael Lucks |
CRYPTO | 1 |