Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...