A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “average-case complexity” 2

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Hard Problems on Random Graphs
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Henri Lotze, Peter Rossmanith

0

citations
Predicting Module-Lattice Reduction
2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

2

citations

2 results