26 search results - page 3 / 6 » Random graphs and the parity quantifier |
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
ASPDAC
2004
ACM
14 years 25 days ago
2004
ACM
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...