Hermann Jung

According to our database, Hermann Jung authored at least 15 papers between 1977 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2003

An efficient deterministic parallel algorithm for two processors precedence constraint scheduling.

Hermann Jung, Maria J. Serna, Paul G. Spirakis

Theor. Comput. Sci., 2003

1995

A Communication-Randomness Tradeoff for Two-Processor Systems

Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn

Inf. Comput., February, 1995

1994

Dynamic Point Location in General Subdivisions.

Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn

J. Algorithms, 1994

1993

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays

Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis

Inf. Comput., July, 1993

1991

A Parallel Algorithm for Two Processors Precedence Constraint Scheduling.

Hermann Jung, Maria J. Serna, Paul G. Spirakis

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

A Time-Randomness Tradeoff for Communication Complexity.

Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays.

Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988

Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees.

Hermann Jung, Kurt Mehlhorn

Inf. Process. Lett., 1988

Implementing Abstract Data Structures in Hardware.

Frank Bauernöppel, Hermann Jung

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1985

Stochastische Turingmaschinen und die Kompliziertheit arithmetischer Probleme.

Hermann Jung

PhD thesis, 1985

On Probabilistic Time and Space.

Hermann Jung

Proceedings of the Automata, 1985

Depth efficient transformations of arithmetic into Boolean circuits.

Hermann Jung

Proceedings of the Fundamentals of Computation Theory, 1985

Fast parallel vertex colouring.

Frank Bauernöppel, Hermann Jung

Proceedings of the Fundamentals of Computation Theory, 1985

1984

On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract).

Hermann Jung

Proceedings of the Automata, 1984

1977

Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen.

Rolf Wiehagen, Hermann Jung

J. Inf. Process. Cybern., 1977