#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1991

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

A key component of the IP Security architecture is the Internet Key Exchange Daemon (IKE). IKE is invoked to establish keys and security related parameters between hosts in order to protected the exchanged application data with them. The IKE concept can not be used for securing group communication based on IP multicast services since it is only addressed to… (More)

- Christoph Karg, Rainer Schuler
- ISAAC
- 1995

In Schapire gave an equivalent characterization of Levin s notion of functions that are polynomial on average This characterization gives a very smooth translation from worst case complexity to average case complexity of the notions for time and space complexity We prove tight space and time hierarchy theorems and discuss the structure of deterministic and… (More)

- Thorsten Aurisch, Christoph Karg
- LCN
- 2003

- Christoph Karg, Johannes Köbler, Rainer Schuler
- STACS
- 1997

Recently, Watanabe proposed a framework for testing the correctAbstract-1 ness and average-case performance of algorithms that purport to solve a given NP search problem efficiently on average with respect to some distribution on the instances. The idea is to randomly generate certified instances under some distribution that resembles the input… (More)

- Christoph Karg
- 1998

- K Meyer, A Möller, C Karg, H Steinhart
- Advances in experimental medicine and biology
- 1996

The purpose of this paper is to give an overview of the current state of IP Security implementations for the Internet Protocol 6. The focus lies on the PC platform and the operating systems BSD, Linux, and Windows. In particular, we introduce the available implementations, describe the state of their development and the features they provide. We test the… (More)

- C. Karg
- Deutsche Zeitschrift für Chirurgie
- 2008

- Christoph Karg
- IEEE Conference on Computational Complexity
- 1997

In this note, we show that LR(k) testing of context-free grammars with respect to random instances is many-one complete for DistNP (Distributional NP). The same result holds for testing whether a context-free grammar is LL(k), strong LL(k), SLR(k), LC(k) or strong LC(k), respectively.

- ‹
- 1
- ›