VLDB 2026 Research / reviewers in the wild / expert
Hermann Jung 0001
dblp:97/4799-1
· DBLP profile ↗
12ranked-venue papers
8as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 11 · 7 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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.
| Theoretical computer science
6 papers |
Computational geometry · 40% Computational complexity · 33% Mathematical optimization · 26% | |
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
Embedded and real-time systems · 62% Parallel and multicore computing · 38% |
Topics — the 13 heaviest of 15, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
communication complexity |
0.0 | 1 | 1995 | A Communication-Randomness Tradeoff for Two-Processor Systems · Inf. Comput. 1995 |
Mathematical optimization
scheduling |
0.0 | 2 | 1993 | A Parallel Algorithm for Two Processors Precedence Constraint Scheduling · ICALP 1991 Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays · Inf. Comput. 1993 |
Embedded and real-time systems › real-time scheduling
multiprocessor scheduling |
0.0 | 1 | 1993 | Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays · Inf. Comput. 1993 |
Computational geometry › point location
dynamic point location |
0.0 | 1 | 1992 | Dynamic Point Location in General Subdivisions · SODA 1992 |
Computational geometry
geometric data structures |
0.0 | 1 | 1992 | Dynamic Point Location in General Subdivisions · SODA 1992 |
Computational geometry
point location |
0.0 | 1 | 1992 | Dynamic Point Location in General Subdivisions · SODA 1992 |
Mathematical optimization › scheduling
precedence constrained scheduling |
0.0 | 1 | 1991 | A Parallel Algorithm for Two Processors Precedence Constraint Scheduling · ICALP 1991 |
Computational complexity
randomized computation |
0.0 | 1 | 1985 | On Probabilistic Time and Space · ICALP 1985 |
Computational complexity
lower bounds |
0.0 | 1 | 1993 | Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays · Inf. Comput. 1993 |
Computational geometry › geometric data structures
planar subdivision |
0.0 | 1 | 1992 | Dynamic Point Location in General Subdivisions · SODA 1992 |
Parallel and multicore computing
parallel algorithms |
0.0 | 1 | 1991 | A Parallel Algorithm for Two Processors Precedence Constraint Scheduling · ICALP 1991 |
Computational complexity
complexity measures |
0.0 | 1 | 1985 | On Probabilistic Time and Space · ICALP 1985 |
Algorithms and data structures › numerical linear algebra › generalized inverse
matrix inversion |
0.0 | 1 | 1984 | On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract) · ICALP 1984 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
Hermann Jung 0001, Maria J. Serna, Paul G. Spirakis |
Theor. Comput. Sci. | 1 |
| 1995 | A Communication-Randomness Tradeoff for Two-Processor Systems
Rudolf Fleischer, Hermann Jung 0001, Kurt Mehlhorn |
Inf. Comput. | 2 |
| 1993 | Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays
Hermann Jung 0001, Lefteris M. Kirousis, Paul G. Spirakis |
Inf. Comput. | 1 |
| 1992 | Dynamic Point Location in General Subdivisions
Hanna Baumgarten, Hermann Jung 0001, Kurt Mehlhorn |
SODA | 2 |
| 1991 | A Parallel Algorithm for Two Processors Precedence Constraint Scheduling
Hermann Jung 0001, Maria J. Serna, Paul G. Spirakis |
ICALP | 1 |
| 1989 | Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication DelaysabstractArticle Free Access Share on Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays Authors: H. Jung Mathematics Dept., Humboldt Univ., GDR Mathematics Dept., Humboldt Univ., GDRView Profile , L. Kirousis Computer Technology Institute, Patras Univ., Greece Computer Technology Institute, Patras Univ., GreeceView Profile , P. Spirakis Computer Technology Institute, Patras Univ., Greece and Courant Inst. Math. Sciences, NYU Computer Technology Institute, Patras Univ., Greece and Courant Inst. Math. Sciences, NYUView Profile Authors Info & Claims SPAA '89: Proceedings of the first annual ACM symposium on Parallel algorithms and architecturesMarch 1989 Pages 254–264https://doi.org/10.1145/72935.72962Published:01 March 1989Publication History 24citation304DownloadsMetricsTotal Citations24Total Downloads304Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF Hermann Jung 0001, Lefteris M. Kirousis, Paul G. Spirakis |
SPAA | 1 |
| 1988 | Implementing Abstract Data Structures in Hardware
Frank Bauernöppel, Hermann Jung 0001 |
MFCS | 2 |
| 1988 | Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees
Hermann Jung 0001, Kurt Mehlhorn |
Inf. Process. Lett. | 1 |
| 1985 | Fast parallel vertex colouring
Frank Bauernöppel, Hermann Jung 0001 |
FCT | 2 |
| 1985 | Depth efficient transformations of arithmetic into Boolean circuits
Hermann Jung 0001 |
FCT | 1 |
| 1985 | On Probabilistic Time and Space
Hermann Jung 0001 |
ICALP | 1 |
| 1984 | On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract)
Hermann Jung 0001 |
ICALP | 1 |