default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHermann Jung 0001
Person information
- affiliation (former): Humboldt University, Germany
Other persons with the same name
- Hermann Jung 0002 — University of Erlangen-Nuremberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1985
[b1]Hermann Jung:
Stochastische Turingmaschinen und die Kompliziertheit arithmetischer Probleme. Humboldt University of Berlin, Unter den Linden, Germany, 1985
Journal Articles
- 2003
- [j6]Hermann Jung, Maria J. Serna
, Paul G. Spirakis:
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. Theor. Comput. Sci. 292(3): 639-652 (2003) - 1995
- [j5]Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn:
A Communication-Randomness Tradeoff for Two-Processor Systems. Inf. Comput. 116(2): 155-161 (1995) - 1994
- [j4]Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn:
Dynamic Point Location in General Subdivisions. J. Algorithms 17(3): 342-380 (1994) - 1993
- [j3]Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis:
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays. Inf. Comput. 105(1): 94-104 (1993) - 1988
- [j2]Hermann Jung, Kurt Mehlhorn:
Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. Inf. Process. Lett. 27(5): 227-236 (1988) - 1977
- [j1]Rolf Wiehagen, Hermann Jung:
Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen. J. Inf. Process. Cybern. 13(7/8): 385-397 (1977)
Conference and Workshop Papers
- 1992
- [c9]Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn:
Dynamic Point Location in General Subdivisions. SODA 1992: 250-258 - 1991
- [c8]Hermann Jung, Maria J. Serna, Paul G. Spirakis:
A Parallel Algorithm for Two Processors Precedence Constraint Scheduling. ICALP 1991: 417-428 - 1990
- [c7]Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn:
A Time-Randomness Tradeoff for Communication Complexity. WDAG 1990: 390-401 - 1989
- [c6]Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis:
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. SPAA 1989: 254-264 - 1988
- [c5]Frank Bauernöppel, Hermann Jung:
Implementing Abstract Data Structures in Hardware. MFCS 1988: 171-179 - 1985
- [c4]Frank Bauernöppel, Hermann Jung:
Fast parallel vertex colouring. FCT 1985: 28-35 - [c3]Hermann Jung:
Depth efficient transformations of arithmetic into Boolean circuits. FCT 1985: 167-174 - [c2]Hermann Jung:
On Probabilistic Time and Space. ICALP 1985: 310-317 - 1984
- [c1]Hermann Jung:
On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract). ICALP 1984: 281-291
Editorship
- 1987
- [e1]Andreas Alexander Albrecht, Hermann Jung, Kurt Mehlhorn:
Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings. Lecture Notes in Computer Science 269, Springer 1987, ISBN 3-540-18099-0 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
