WG
1993
Springer
14 years 3 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
WG
1993
Springer
14 years 3 months ago
1993
Springer
WG
1993
Springer
14 years 3 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
STACS
1994
Springer
14 years 3 months ago
1994
Springer
STACS
1994
Springer
14 years 3 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
TLCA
1993
Springer
14 years 3 months ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
STACS
1994
Springer
14 years 3 months ago
1994
Springer
STACS
1994
Springer
14 years 3 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
TLCA
1993
Springer
14 years 3 months ago
1993
Springer
TLCA
1993
Springer
14 years 3 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...