default search action
Karl Weber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c6]Jonas Schoch, David Ganz, Hans Dermot Doran
, Karl Weber:
Dynamic Frame Packing in industrial applications using COTS components. WFCS 2012: 145-148 - [c5]Jahanzaib Imtiaz, Jürgen Jasperneite
Approaches to reduce the latency for high priority traffic in IEEE 802.1 AVB networks. WFCS 2012: 161-164 - 2010
- [c4]Jahanzaib Imtiaz, Jürgen Jasperneite
Redundant structures for a generic real-time ethernet system. ETFA 2010: 1-4
2000 – 2009
- 2009
- [j12]Jürgen Jasperneite
A Proposal for a Generic Real-Time Ethernet System. IEEE Trans. Ind. Informatics 5(2): 75-85 (2009) - [c3]Hubert D. Kirrmann, Karl Weber, Oliver Kleineberg, Hans Weibel:
HSR: Zero Recovery Time and Low-cost Redundancy for Industrial Ethernet (High Availability Seamless Redundancy, IEC 62439-3). ETFA 2009: 1-4 - 2008
- [c2]Jahanzaib Imtiaz, Jürgen Jasperneite
A novel method for auto configuration of Realtime Ethernet Networks. ETFA 2008: 861-868 - 2007
- [c1]Jürgen Jasperneite
Limits of increasing the performance of Industrial Ethernet protocols. ETFA 2007: 17-24
1990 – 1999
- 1993
- [j11]Sergei L. Bezrukov, Norbert Grünwald, Karl Weber:
On Edge Numberings of the n-Cube Graph. Discret. Appl. Math. 46(2): 99-116 (1993)
1980 – 1989
- 1989
- [j10]Norbert Grünwald, Karl Weber:
On Optimal Pair Sequences. J. Inf. Process. Cybern. 25(3): 75-86 (1989) - 1986
- [j9]Norbert Wischnevski, Karl Weber:
Small Nonplanar Subgraphs of the Cube. J. Inf. Process. Cybern. 22(10/11): 547-552 (1986) - [j8]Karl Weber:
On Components of Random Graphs in the n-Cube. J. Inf. Process. Cybern. 22(12): 601-613 (1986) - 1985
- [j7]Karl Weber:
Lineare Kostenfunktionen für alternative Normalformen. J. Inf. Process. Cybern. 21(12): 625-630 (1985) - 1983
- [b1]Karl Weber:
Modellierung von Fehlverhalten mit Berücksichtigung paralleler Abläufe. University of Erlangen-Nuremberg, Germany, 1983, pp. 1-200 - [j6]Karl Weber, Bernd Klipps:
Boolean Functions of Maximum Length and Sperner Type Conditions About the Set of Faces of the n-cube. J. Inf. Process. Cybern. 19(4/5): 187-193 (1983) - [j5]Karl Weber:
Subcubes of Random Boolean Functions. J. Inf. Process. Cybern. 19(7/8): 365-374 (1983) - [j4]Karl Weber:
Prime Implicants of Random Boolean Functions. J. Inf. Process. Cybern. 19(9): 449-458 (1983) - [j3]Karl Weber:
Irredundant Disjunctive Normal Forms of Random Boolean Functions. J. Inf. Process. Cybern. 19(10/11): 529-534 (1983) - 1982
- [j2]Karl Weber:
The Length of Random Boolean Functions. J. Inf. Process. Cybern. 18(12): 659-668 (1982)
1970 – 1979
- 1975
- [j1]Karl Weber:
Über verschiedene Kompliziertheitsmaße bei alternativen Normalformen. J. Inf. Process. Cybern. 11(10-12): 606-607 (1975)
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-25 05:56 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: