Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen. - Rolf Wiehagen; Hermann Jung 001 (J. Inf. Process. Cybern., 1977)

On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract). - Hermann Jung 001 (ICALP, 1984)

Fast parallel vertex colouring. - Frank Bauernöppel; Hermann Jung 001 (FCT, 1985)

Depth efficient transformations of arithmetic into Boolean circuits. - Hermann Jung 001 (FCT, 1985)

On Probabilistic Time and Space. - Hermann Jung 001 (ICALP, 1985)

Stochastische Turingmaschinen und die Kompliziertheit arithmetischer Probleme. - Hermann Jung 001 (1985)

Implementing Abstract Data Structures in Hardware. - Frank Bauernöppel; Hermann Jung 001 (MFCS, 1988)

Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. - Hermann Jung 001; Kurt Mehlhorn (Inf. Process. Lett., 1988)

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. - Hermann Jung 001; Lefteris M. Kirousis; Paul G. Spirakis (SPAA, 1989)

A Time-Randomness Tradeoff for Communication Complexity. - Rudolf Fleischer; Hermann Jung 001; Kurt Mehlhorn (WDAG, 1990)

A Parallel Algorithm for Two Processors Precedence Constraint Scheduling. - Hermann Jung 001; Maria J. Serna; Paul G. Spirakis (ICALP, 1991)

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays - Hermann Jung 001; Lefteris M. Kirousis; Paul G. Spirakis (Inf. Comput., 1993)

Dynamic Point Location in General Subdivisions. - Hanna Baumgarten; Hermann Jung 001; Kurt Mehlhorn (J. Algorithms, 1994)

A Communication-Randomness Tradeoff for Two-Processor Systems - Rudolf Fleischer; Hermann Jung 001; Kurt Mehlhorn (Inf. Comput., 1995)

An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. - Hermann Jung 001; Maria J. Serna; Paul G. Spirakis (Theor. Comput. Sci., 2003)