• Publications
  • Influence
Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage
TLDR
We formalize a successful attack on Bloom filters composed of bigrams. Expand
  • 58
  • 6
  • PDF
The exact mass gap of the chiral Gross-Neveu model
Abstract Using the postulated S -matrix of the U( n ) symmetric chiral Gross-Neveu model the mass gap is calculated in terms of the Λ- parameter.
  • 22
  • 1
ON THE MEASUREMENT OF DEGRADATION AND RECOVERY OF SCINTILLATING PLASTIC FIBRES
Abstract Scintillating plastic fibres find an increasing number of applications in different fields ranging from elementary particle detection to radiobiology. One of the yet open questions is theExpand
  • 8
  • 1
f-Optimal factors of infinite graphs
  • F. Niedermeyer
  • Computer Science, Mathematics
  • Discret. Math.
  • 3 December 1991
TLDR
A necessary and sufficient condition for the existence of perfect f-factors of countable graphs is proved. Expand
  • 4
Matchable Infinite Graphs
TLDR
We give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinite graphs. Expand
  • 3
Large k-preserving sets in infinite graphs
TLDR
We prove a conjecture of Mader: Every infinite d-connected graph G contains a set S C V with IS1 = IVI such that G\S’ is K-connected for all S’ S. Expand
  • 1
Testing a model predictive control algorithm for a PV-CHP hybrid system on a laboratory test-bench
TLDR
A test-bench is introduced to test different control algorithms for photovoltaic systems in combination with storage systems and a micro- combined heat and power plant. Expand
  • 4
Boron implantation into CdTe
Abstract The behaviour of 12 B implanted into p-type, highly resistive n-type and n-type CdTe is investigated by the β-NMR method. At the Larmor frequency a single line resonance shows up whichExpand
  • 4
The f-factor Problem for Graphs and the Hereditary Property
TLDR
We show that, for the existence of a perfect f-factor, P is a necessary condition for countable graphs and yields a sufficient condition for graphs of size ℵ1. Expand
  • 1
  • PDF