default search action
Jochen Bern
Person information
- affiliation: University of Trier, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1996
- [j2]Jochen Bern, Christoph Meinel, Anna Slobodová:
Some heuristics for generating tree-like FBDD types. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(1): 127-130 (1996) - [j1]Jochen Bern, Christoph Meinel, Anna Slobodová:
Global rebuilding of OBDD's avoiding memory requirement maxima. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(1): 131-134 (1996)
Conference and Workshop Papers
- 2003
- [c8]Feng Cheng, Paul Ferring, Christoph Meinel, Gerhard Müllenheim, Jochen Bern:
The DualGate Lock-Keeper: A Highly Efficient, Flexible and Applicable Network Security Solution. SNPD 2003: 152-159 - 1999
- [c7]Jochen Bern, Christoph Meinel:
One step further: extending electronic submission into the reviewing process. SIGDOC 1999: 65-69 - 1998
- [c6]Jochen Bern, Christoph Meinel, Harald Sack:
The STACS Electronic Submission Service. ECDL 1998: 639-640 - [c5]Jochen Bern, Christoph Meinel, Harald Sack:
Electronic Colloquia: Idea and Practice. SIGDOC 1998: 113-119 - 1997
- [c4]Jochen Bern, Carsten Damm, Christoph Meinel:
The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use. ECDL 1997: 405-421 - 1995
- [c3]Jochen Bern, Christoph Meinel, Anna Slobodová:
Global rebuilding of OBDDs Avoiding Memory Requirement Maxima. CAV 1995: 4-15 - [c2]Jochen Bern, Christoph Meinel, Anna Slobodová:
Efficient OBDD-Based Boolean Manipulation in CAD beyond Current Limits. DAC 1995: 408-413 - 1994
- [c1]Jochen Bern, Jordan Gergov, Christoph Meinel, Anna Slobodová:
Boolean Manipulation with Free BDD's. First Experimental Results. EDAC-ETC-EUROASIC 1994: 200-207
Informal and Other Publications
- 1999
- [i6]Jochen Bern, Christoph Meinel:
One Step Further: Integrating Electronic Submission and the Reviewing Process. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-16 (1999) - 1997
- [i5]Jochen Bern, Christoph Meinel:
The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-16 (1997) - 1995
- [i4]Jochen Bern, Christoph Meinel, Anna Slobodová:
Global Rebuilding of OBDD's - Tunneling Memory Requirement Maxima. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-03 (1995) - 1994
- [i3]Jochen Bern, Christoph Meinel, Anna Slobodová:
Some Heuristics for Generating Tree-like FBDD Types. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-03 (1994) - [i2]Jochen Bern, Christoph Meinel, Anna Slobodová:
Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-16 (1994) - 1993
- [i1]Jochen Bern, Jordan Gergov, Christoph Meinel, Anna Slobodová:
Boolean Manipulation with Free BDD's - First Experimental Results. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-20 (1993)
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 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint